/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 16:18:58,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 16:18:58,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 16:18:58,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 16:18:58,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 16:18:58,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 16:18:58,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 16:18:58,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 16:18:58,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 16:18:58,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 16:18:58,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 16:18:58,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 16:18:58,775 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 16:18:58,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 16:18:58,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 16:18:58,778 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 16:18:58,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 16:18:58,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 16:18:58,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 16:18:58,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 16:18:58,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 16:18:58,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 16:18:58,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 16:18:58,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 16:18:58,780 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 16:18:58,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 16:18:58,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 16:18:58,781 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 16:18:58,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 16:18:58,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 16:18:58,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 16:18:58,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 16:18:58,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 16:18:58,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 16:18:58,783 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 16:18:58,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 16:18:58,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 16:18:58,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 16:18:58,784 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 16:18:58,784 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.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS 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: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 16:18:59,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 16:18:59,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 16:18:59,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 16:18:59,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 16:18:59,117 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 16:18:59,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2024-05-06 16:19:00,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 16:19:00,553 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 16:19:00,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2024-05-06 16:19:00,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8fcf30a98/c3bf6a6e646a4bc195f05ba9928f9fb4/FLAG2b47b3cd9 [2024-05-06 16:19:00,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8fcf30a98/c3bf6a6e646a4bc195f05ba9928f9fb4 [2024-05-06 16:19:00,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 16:19:00,599 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 16:19:00,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 16:19:00,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 16:19:00,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 16:19:00,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 04:19:00" (1/1) ... [2024-05-06 16:19:00,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e83d436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:00, skipping insertion in model container [2024-05-06 16:19:00,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 04:19:00" (1/1) ... [2024-05-06 16:19:00,665 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 16:19:01,094 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2024-05-06 16:19:01,100 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2024-05-06 16:19:01,104 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2024-05-06 16:19:01,182 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2024-05-06 16:19:01,184 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2024-05-06 16:19:01,186 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2024-05-06 16:19:01,187 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2024-05-06 16:19:01,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 16:19:01,206 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 16:19:01,248 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2024-05-06 16:19:01,249 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2024-05-06 16:19:01,250 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2024-05-06 16:19:01,273 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2024-05-06 16:19:01,275 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2024-05-06 16:19:01,276 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2024-05-06 16:19:01,277 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2024-05-06 16:19:01,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 16:19:01,416 INFO L206 MainTranslator]: Completed translation [2024-05-06 16:19:01,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01 WrapperNode [2024-05-06 16:19:01,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 16:19:01,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 16:19:01,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 16:19:01,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 16:19:01,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,496 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 211 [2024-05-06 16:19:01,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 16:19:01,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 16:19:01,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 16:19:01,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 16:19:01,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 16:19:01,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 16:19:01,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 16:19:01,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 16:19:01,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (1/1) ... [2024-05-06 16:19:01,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 16:19:01,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 16:19:01,580 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-05-06 16:19:01,588 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-05-06 16:19:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2024-05-06 16:19:01,623 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2024-05-06 16:19:01,623 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2024-05-06 16:19:01,624 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2024-05-06 16:19:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 16:19:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 16:19:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-06 16:19:01,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-06 16:19:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 16:19:01,625 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-06 16:19:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 16:19:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 16:19:01,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 16:19:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 16:19:01,629 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 16:19:01,754 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 16:19:01,756 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 16:19:02,103 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 16:19:02,123 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 16:19:02,123 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2024-05-06 16:19:02,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 04:19:02 BoogieIcfgContainer [2024-05-06 16:19:02,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 16:19:02,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 16:19:02,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 16:19:02,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 16:19:02,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 04:19:00" (1/3) ... [2024-05-06 16:19:02,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f29f8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 04:19:02, skipping insertion in model container [2024-05-06 16:19:02,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 04:19:01" (2/3) ... [2024-05-06 16:19:02,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f29f8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 04:19:02, skipping insertion in model container [2024-05-06 16:19:02,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 04:19:02" (3/3) ... [2024-05-06 16:19:02,132 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2024-05-06 16:19:02,140 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 16:19:02,148 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 16:19:02,149 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-06 16:19:02,149 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 16:19:02,248 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-06 16:19:02,296 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 16:19:02,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 16:19:02,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 16:19:02,300 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-05-06 16:19:02,301 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-05-06 16:19:02,339 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 16:19:02,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:19:02,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 16:19:02,359 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@cc13abd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 16:19:02,359 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-05-06 16:19:02,584 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 37 treesize of output 31 [2024-05-06 16:19:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1329901190, now seen corresponding path program 1 times [2024-05-06 16:19:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:04,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:19:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:19:05,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 16:19:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-06 16:19:06,021 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 33 treesize of output 29 [2024-05-06 16:19:06,114 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 8 treesize of output 4 [2024-05-06 16:19:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1696175707, now seen corresponding path program 1 times [2024-05-06 16:19:06,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:06,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:06,873 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 33 treesize of output 29 [2024-05-06 16:19:06,896 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 31 treesize of output 27 [2024-05-06 16:19:06,946 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 8 treesize of output 4 [2024-05-06 16:19:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash -479581409, now seen corresponding path program 2 times [2024-05-06 16:19:09,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:09,744 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 33 treesize of output 29 [2024-05-06 16:19:09,766 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 31 treesize of output 27 [2024-05-06 16:19:09,818 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 8 treesize of output 4 [2024-05-06 16:19:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash -688799903, now seen corresponding path program 3 times [2024-05-06 16:19:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:12,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:12,655 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 33 treesize of output 29 [2024-05-06 16:19:12,712 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 8 treesize of output 4 [2024-05-06 16:19:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash -80167483, now seen corresponding path program 4 times [2024-05-06 16:19:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:12,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:12,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:13,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-06 16:19:13,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:19:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 538585321, now seen corresponding path program 1 times [2024-05-06 16:19:13,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:19:13,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468562079] [2024-05-06 16:19:13,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:13,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:19:14,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:19:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468562079] [2024-05-06 16:19:14,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468562079] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 16:19:14,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 16:19:14,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-05-06 16:19:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107243666] [2024-05-06 16:19:14,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 16:19:14,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-06 16:19:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:19:14,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-06 16:19:14,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-05-06 16:19:14,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:19:14,719 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:19:14,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 20 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 16:19:14,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:19:17,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-05-06 16:19:17,234 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:17,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:17,267 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 8 treesize of output 4 [2024-05-06 16:19:17,466 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:17,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:17,489 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 8 treesize of output 4 [2024-05-06 16:19:19,647 INFO L85 PathProgramCache]: Analyzing trace with hash -62292534, now seen corresponding path program 1 times [2024-05-06 16:19:19,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:19,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:19,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:20,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:20,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-05-06 16:19:20,360 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:20,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:20,386 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 8 treesize of output 4 [2024-05-06 16:19:20,512 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:20,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash -330340134, now seen corresponding path program 2 times [2024-05-06 16:19:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-06 16:19:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-06 16:19:23,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-05-06 16:19:23,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:23,618 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 8 treesize of output 4 [2024-05-06 16:19:23,685 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:23,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:23,816 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 8 treesize of output 4 [2024-05-06 16:19:23,873 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:23,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1970970037, now seen corresponding path program 3 times [2024-05-06 16:19:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:19:27,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:27,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:19:28,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-05-06 16:19:28,549 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:28,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:28,573 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 8 treesize of output 4 [2024-05-06 16:19:28,792 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:28,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:28,813 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 8 treesize of output 4 [2024-05-06 16:19:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash -888138981, now seen corresponding path program 4 times [2024-05-06 16:19:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:29,817 INFO L349 Elim1Store]: treesize reduction 96, result has 41.1 percent of original size [2024-05-06 16:19:29,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 5 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 30 case distinctions, treesize of input 97 treesize of output 127 [2024-05-06 16:19:30,908 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:30,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:31,113 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 8 treesize of output 4 [2024-05-06 16:19:31,687 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:31,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:31,821 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 8 treesize of output 4 [2024-05-06 16:19:32,653 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:32,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1686041095, now seen corresponding path program 1 times [2024-05-06 16:19:33,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:33,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:33,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 16:19:33,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-05-06 16:19:33,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-05-06 16:19:33,751 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:33,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:33,778 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 8 treesize of output 4 [2024-05-06 16:19:33,956 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:33,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash -575303592, now seen corresponding path program 1 times [2024-05-06 16:19:34,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:34,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:19:34,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:34,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:19:34,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:34,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-05-06 16:19:35,110 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 8 treesize of output 4 [2024-05-06 16:19:35,283 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:35,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:36,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1949129844, now seen corresponding path program 2 times [2024-05-06 16:19:36,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:36,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-05-06 16:19:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-05-06 16:19:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-06 16:19:37,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-05-06 16:19:37,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:37,832 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:37,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:38,000 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 8 treesize of output 4 [2024-05-06 16:19:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash -575303592, now seen corresponding path program 3 times [2024-05-06 16:19:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:19:38,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:38,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:19:39,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:39,496 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 8 treesize of output 4 [2024-05-06 16:19:39,579 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:39,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash -790615118, now seen corresponding path program 4 times [2024-05-06 16:19:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:19:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:19:40,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:40,660 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 8 treesize of output 4 [2024-05-06 16:19:40,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1414741495, now seen corresponding path program 5 times [2024-05-06 16:19:40,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:40,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:40,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:41,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:42,308 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 8 treesize of output 4 [2024-05-06 16:19:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1783079711, now seen corresponding path program 6 times [2024-05-06 16:19:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:42,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:42,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:19:42,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:43,291 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:43,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:43,340 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 8 treesize of output 4 [2024-05-06 16:19:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1836429819, now seen corresponding path program 7 times [2024-05-06 16:19:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 16:19:43,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:43,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 16:19:44,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:44,709 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:44,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:44,765 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 8 treesize of output 4 [2024-05-06 16:19:44,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1696837807, now seen corresponding path program 8 times [2024-05-06 16:19:44,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:44,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 16:19:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 16:19:45,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:46,304 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 8 treesize of output 4 [2024-05-06 16:19:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1083689974, now seen corresponding path program 5 times [2024-05-06 16:19:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:47,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:47,741 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 8 treesize of output 4 [2024-05-06 16:19:47,906 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:47,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash -343782828, now seen corresponding path program 6 times [2024-05-06 16:19:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:48,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:48,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:49,189 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 8 treesize of output 4 [2024-05-06 16:19:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1951799581, now seen corresponding path program 1 times [2024-05-06 16:19:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:49,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:50,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:50,717 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:50,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:50,890 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 8 treesize of output 4 [2024-05-06 16:19:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1809098931, now seen corresponding path program 2 times [2024-05-06 16:19:50,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:50,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:51,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:52,101 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 8 treesize of output 4 [2024-05-06 16:19:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -206400425, now seen corresponding path program 1 times [2024-05-06 16:19:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:52,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:52,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:53,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:53,625 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 8 treesize of output 4 [2024-05-06 16:19:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1655554349, now seen corresponding path program 2 times [2024-05-06 16:19:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:54,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:54,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:55,159 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 8 treesize of output 4 [2024-05-06 16:19:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1555649310, now seen corresponding path program 1 times [2024-05-06 16:19:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:56,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:56,893 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 8 treesize of output 4 [2024-05-06 16:19:56,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1321158188, now seen corresponding path program 2 times [2024-05-06 16:19:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:57,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:57,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:57,898 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 8 treesize of output 4 [2024-05-06 16:19:57,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1227401400, now seen corresponding path program 1 times [2024-05-06 16:19:57,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:57,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:59,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:19:59,229 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:19:59,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:19:59,312 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 8 treesize of output 4 [2024-05-06 16:19:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1014405294, now seen corresponding path program 2 times [2024-05-06 16:19:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:59,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:19:59,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:19:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:19:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:19:59,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:00,142 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:00,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:00,280 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 8 treesize of output 4 [2024-05-06 16:20:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2077769441, now seen corresponding path program 1 times [2024-05-06 16:20:00,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:01,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:01,712 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:01,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:01,740 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 8 treesize of output 4 [2024-05-06 16:20:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1858764533, now seen corresponding path program 2 times [2024-05-06 16:20:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:01,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:02,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:02,877 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:02,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:03,044 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 8 treesize of output 4 [2024-05-06 16:20:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2002585881, now seen corresponding path program 1 times [2024-05-06 16:20:03,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:04,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:04,384 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:04,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:04,499 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 8 treesize of output 4 [2024-05-06 16:20:04,643 INFO L85 PathProgramCache]: Analyzing trace with hash -161168431, now seen corresponding path program 2 times [2024-05-06 16:20:04,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:04,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:04,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:05,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:05,568 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 8 treesize of output 4 [2024-05-06 16:20:05,621 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:05,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:05,677 INFO L85 PathProgramCache]: Analyzing trace with hash -606182624, now seen corresponding path program 1 times [2024-05-06 16:20:05,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:06,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:06,785 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:06,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:06,840 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 8 treesize of output 4 [2024-05-06 16:20:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1202784234, now seen corresponding path program 2 times [2024-05-06 16:20:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:07,720 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2024-05-06 16:20:07,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 30 case distinctions, treesize of input 87 treesize of output 51 [2024-05-06 16:20:08,480 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:08,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:08,959 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 8 treesize of output 4 [2024-05-06 16:20:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash 569483278, now seen corresponding path program 1 times [2024-05-06 16:20:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:20:09,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:20:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:20:09,478 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 29 treesize of output 25 [2024-05-06 16:20:09,496 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 27 treesize of output 23 [2024-05-06 16:20:09,751 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:09,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:09,870 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 8 treesize of output 4 [2024-05-06 16:20:10,003 INFO L85 PathProgramCache]: Analyzing trace with hash 270746730, now seen corresponding path program 1 times [2024-05-06 16:20:10,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:20:10,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:10,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:20:10,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 16:20:10,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2024-05-06 16:20:10,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:11,072 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:11,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:11,094 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 8 treesize of output 4 [2024-05-06 16:20:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash -575303592, now seen corresponding path program 9 times [2024-05-06 16:20:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:20:11,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:11,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:20:12,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:12,848 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:12,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:13,036 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 8 treesize of output 4 [2024-05-06 16:20:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash -790615118, now seen corresponding path program 10 times [2024-05-06 16:20:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:20:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-06 16:20:13,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:14,346 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:14,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:14,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 8 treesize of output 4 [2024-05-06 16:20:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1414741495, now seen corresponding path program 11 times [2024-05-06 16:20:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:20:14,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:20:15,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:15,920 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:15,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:16,090 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 8 treesize of output 4 [2024-05-06 16:20:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1783079711, now seen corresponding path program 12 times [2024-05-06 16:20:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:16,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:20:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-06 16:20:16,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:16,936 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:16,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:17,078 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 8 treesize of output 4 [2024-05-06 16:20:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1836429819, now seen corresponding path program 13 times [2024-05-06 16:20:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 16:20:17,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:17,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 16:20:18,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:18,777 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 8 treesize of output 4 [2024-05-06 16:20:18,860 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:18,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:18,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1696837807, now seen corresponding path program 14 times [2024-05-06 16:20:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:18,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 16:20:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-06 16:20:19,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:19,993 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 8 treesize of output 4 [2024-05-06 16:20:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1083689974, now seen corresponding path program 7 times [2024-05-06 16:20:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:21,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:21,966 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 8 treesize of output 4 [2024-05-06 16:20:22,047 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:22,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash -343782828, now seen corresponding path program 8 times [2024-05-06 16:20:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:22,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:22,946 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:22,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:23,035 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 8 treesize of output 4 [2024-05-06 16:20:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1951799581, now seen corresponding path program 3 times [2024-05-06 16:20:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:23,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:23,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:24,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:24,916 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:24,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:25,055 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 8 treesize of output 4 [2024-05-06 16:20:25,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1809098931, now seen corresponding path program 4 times [2024-05-06 16:20:25,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:25,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:25,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:25,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:26,284 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:26,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:26,443 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 8 treesize of output 4 [2024-05-06 16:20:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -206400425, now seen corresponding path program 3 times [2024-05-06 16:20:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:27,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:28,458 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:28,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:28,539 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 8 treesize of output 4 [2024-05-06 16:20:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1655554349, now seen corresponding path program 4 times [2024-05-06 16:20:28,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:28,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:28,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:28,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:29,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:29,669 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:29,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:29,950 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 8 treesize of output 4 [2024-05-06 16:20:30,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1555649310, now seen corresponding path program 3 times [2024-05-06 16:20:30,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:30,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:31,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:32,275 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:32,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:32,324 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 8 treesize of output 4 [2024-05-06 16:20:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1321158188, now seen corresponding path program 4 times [2024-05-06 16:20:32,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:32,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:33,218 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:33,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:33,402 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 8 treesize of output 4 [2024-05-06 16:20:33,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1227401400, now seen corresponding path program 3 times [2024-05-06 16:20:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:34,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:35,401 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 8 treesize of output 4 [2024-05-06 16:20:35,492 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:35,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:35,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1014405294, now seen corresponding path program 4 times [2024-05-06 16:20:35,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:35,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:35,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:35,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:36,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:36,593 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:36,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:36,683 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 8 treesize of output 4 [2024-05-06 16:20:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2077769441, now seen corresponding path program 3 times [2024-05-06 16:20:36,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:36,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:36,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:37,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:38,332 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:38,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:38,743 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 8 treesize of output 4 [2024-05-06 16:20:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1858764533, now seen corresponding path program 4 times [2024-05-06 16:20:38,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:39,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:39,870 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:39,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:40,189 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 8 treesize of output 4 [2024-05-06 16:20:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2002585881, now seen corresponding path program 3 times [2024-05-06 16:20:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:41,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:41,780 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:41,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:42,070 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 8 treesize of output 4 [2024-05-06 16:20:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash -161168431, now seen corresponding path program 4 times [2024-05-06 16:20:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:42,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:42,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:43,129 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:43,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:43,316 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 8 treesize of output 4 [2024-05-06 16:20:43,533 INFO L85 PathProgramCache]: Analyzing trace with hash -606182624, now seen corresponding path program 3 times [2024-05-06 16:20:43,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:43,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:44,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 [2024-05-06 16:20:45,082 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 8 treesize of output 4 [2024-05-06 16:20:45,614 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:45,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1202784234, now seen corresponding path program 4 times [2024-05-06 16:20:45,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-06 16:20:46,482 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2024-05-06 16:20:46,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 30 case distinctions, treesize of input 87 treesize of output 51 [2024-05-06 16:20:47,075 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-06 16:20:47,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2024-05-06 16:20:47,807 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 8 treesize of output 4 [2024-05-06 16:20:47,914 INFO L85 PathProgramCache]: Analyzing trace with hash 569483278, now seen corresponding path program 2 times [2024-05-06 16:20:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:47,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:20:47,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 16:20:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 16:20:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-06 16:20:49,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable98,SelfDestructingSolverStorable11,SelfDestructingSolverStorable99,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable115,SelfDestructingSolverStorable66,SelfDestructingSolverStorable116,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 16:20:49,237 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-06 16:20:49,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:20:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 388017180, now seen corresponding path program 1 times [2024-05-06 16:20:49,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:20:49,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777134000] [2024-05-06 16:20:49,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:49,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:20:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:20:51,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:20:51,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777134000] [2024-05-06 16:20:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777134000] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 16:20:51,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102742389] [2024-05-06 16:20:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:20:51,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 16:20:51,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 16:20:52,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 16:20:52,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-06 16:20:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:20:52,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 94 conjunts are in the unsatisfiable core [2024-05-06 16:20:52,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 16:20:52,478 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 6 treesize of output 5 [2024-05-06 16:20:52,504 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-06 16:20:52,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-05-06 16:20:52,532 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-06 16:20:52,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-05-06 16:20:52,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-06 16:20:52,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-05-06 16:20:52,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-05-06 16:20:53,124 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 16 [2024-05-06 16:20:53,904 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-05-06 16:20:53,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 35 [2024-05-06 16:20:54,201 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 89 treesize of output 71 [2024-05-06 16:20:54,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 97 [2024-05-06 16:20:54,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 16:20:54,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 16:20:54,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-05-06 16:20:54,919 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-05-06 16:20:54,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 55 [2024-05-06 16:20:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:20:55,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 16:20:55,638 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (.cse2 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (and (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse0 (select v_ArrVal_5839 .cse2))) (or (< 4 .cse0) (not (= v_ArrVal_5839 (store .cse1 .cse2 .cse0))) (= .cse0 4) (< 0 (let ((.cse3 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< .cse0 1)))) (<= 1 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse1 .cse2 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse5 (select v_ArrVal_5839 .cse2))) (or (< 0 .cse5) (not (= v_ArrVal_5839 (store .cse1 .cse2 .cse5))) (< 0 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< (+ .cse5 3) 0)))))) is different from false [2024-05-06 16:20:56,389 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| (* |c_writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6#1| 4) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)) (.cse2 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (and (<= 1 (let ((.cse0 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse1 .cse2 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse0 (+ (* (select .cse0 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse3 (select v_ArrVal_5839 .cse2))) (or (< 0 .cse3) (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= (store .cse1 .cse2 .cse3) v_ArrVal_5839)) (< (+ .cse3 3) 0)))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse5 (select v_ArrVal_5839 .cse2))) (or (< 4 .cse5) (= .cse5 4) (< 0 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< .cse5 1) (not (= (store .cse1 .cse2 .cse5) v_ArrVal_5839))))))) is different from false [2024-05-06 16:20:56,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20))) (let ((.cse2 (let ((.cse7 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_~x#1|)))) (and (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse0 (select v_ArrVal_5839 .cse3))) (or (< 4 .cse0) (= .cse0 4) (< 0 (let ((.cse1 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse1 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse1 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< .cse0 1) (not (= v_ArrVal_5839 (store .cse2 .cse3 .cse0)))))) (<= 1 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse2 .cse3 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse5 (select v_ArrVal_5839 .cse3))) (or (< 0 .cse5) (< 0 (let ((.cse6 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse6 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse6 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< (+ .cse5 3) 0) (not (= v_ArrVal_5839 (store .cse2 .cse3 .cse5))))))))) is different from false [2024-05-06 16:21:00,746 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5839 (Array Int Int))) (let ((.cse0 (select v_ArrVal_5839 .cse2)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837))) (or (< (+ .cse0 3) 0) (not (= v_ArrVal_5839 (store (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 .cse2) 4) 4) 1)) .cse2 .cse0))) (< 0 .cse0) (< 0 (let ((.cse4 (select (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4))))))) (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5839 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837)) (.cse7 (select v_ArrVal_5839 .cse2))) (or (not (= v_ArrVal_5839 (store (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 .cse2) 4) 4) 1)) .cse2 .cse7))) (< .cse7 1) (< 0 (let ((.cse8 (select (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse8 (+ (* (select .cse8 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 4 .cse7) (= .cse7 4)))) (forall ((v_ArrVal_5837 (Array Int Int))) (<= 1 (let ((.cse9 (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837))) (store .cse10 |c_ULTIMATE.start_main_~#r~3#1.base| (store (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse11 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse11 .cse2) 4) 4) 1)) .cse2 0))) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse9 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse9 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) is different from false [2024-05-06 16:21:01,334 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5839 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837)) (.cse0 (select v_ArrVal_5839 .cse2))) (or (< (+ .cse0 3) 0) (not (= v_ArrVal_5839 (store (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 .cse2) 4) 4) 1)) .cse2 .cse0))) (< 0 (let ((.cse4 (select (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse4 (+ (* 4 (select .cse4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)))) (< 0 .cse0)))) (forall ((v_ArrVal_5837 (Array Int Int))) (<= 1 (let ((.cse5 (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837))) (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| (store (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse7 .cse2) 4) 4) 1)) .cse2 0))) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse5 (+ 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset| (* (select .cse5 |c_reader_twoThread1of1ForFork0_~arg#1.offset|) 4)))))) (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5839 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837)) (.cse10 (select v_ArrVal_5839 .cse2))) (or (not (= v_ArrVal_5839 (store (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse8 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse8 .cse2) 4) 4) 1)) .cse2 .cse10))) (< .cse10 1) (< 0 (let ((.cse11 (select (store .cse9 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~arg#1.base|))) (select .cse11 (+ (* 4 (select .cse11 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)) 4 |c_reader_twoThread1of1ForFork0_~arg#1.offset|)))) (< 4 .cse10) (= .cse10 4)))))) is different from false [2024-05-06 16:21:01,394 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5839 (Array Int Int))) (let ((.cse0 (select v_ArrVal_5839 .cse2)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837))) (or (< (+ .cse0 3) 0) (not (= v_ArrVal_5839 (store (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse1 .cse2) 4) 4) 1)) .cse2 .cse0))) (< 0 .cse0) (< 0 (let ((.cse4 (select (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse4 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* 4 (select .cse4 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|)) 4))))))) (forall ((v_ArrVal_5837 (Array Int Int))) (<= 1 (let ((.cse5 (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837))) (store .cse6 |c_ULTIMATE.start_main_~#r~3#1.base| (store (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse7 .cse2) 4) 4) 1)) .cse2 0))) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse5 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* (select .cse5 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|) 4) 4))))) (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5839 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837)) (.cse10 (select v_ArrVal_5839 .cse2))) (or (not (= v_ArrVal_5839 (store (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse8 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse8 .cse2) 4) 4) 1)) .cse2 .cse10))) (< .cse10 1) (< 4 .cse10) (< 0 (let ((.cse11 (select (store .cse9 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_#in~arg#1.base|))) (select .cse11 (+ |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| (* 4 (select .cse11 |c_reader_twoThread1of1ForFork0_#in~arg#1.offset|)) 4)))) (= .cse10 4)))))) is different from false [2024-05-06 16:21:01,438 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_5837 (Array Int Int)) (v_DerPreprocessor_3 Int)) (or (< v_DerPreprocessor_3 1) (< 4 v_DerPreprocessor_3) (< 0 (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse1) 4) 4) 1)))) (select (store .cse0 .cse1 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (= v_DerPreprocessor_3 4))) (forall ((v_ArrVal_5837 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (< 0 v_DerPreprocessor_2) (< 0 (let ((.cse3 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse4 .cse1) 4) 4) 1)))) (select (store .cse3 .cse1 v_DerPreprocessor_2) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< (+ 3 v_DerPreprocessor_2) 0))) (forall ((v_ArrVal_5837 (Array Int Int))) (<= 1 (let ((.cse5 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse6 .cse1) 4) 4) 1)))) (select (store .cse5 .cse1 0) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))))))) is different from false [2024-05-06 16:21:01,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (and (forall ((v_ArrVal_5837 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_5836 (Array Int Int))) (or (< v_DerPreprocessor_3 1) (< 4 v_DerPreprocessor_3) (< 0 (let ((.cse0 (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_5836) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* 4 (select .cse2 .cse1))) 1)))) (select (store .cse0 .cse1 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4))))) (= v_DerPreprocessor_3 4))) (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (< 0 v_DerPreprocessor_2) (< (+ 3 v_DerPreprocessor_2) 0) (< 0 (let ((.cse3 (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_5836) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* 4 (select .cse4 .cse1))) 1)))) (select (store .cse3 .cse1 v_DerPreprocessor_2) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4))))))) (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5836 (Array Int Int))) (<= 1 (let ((.cse5 (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_5836) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse6 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* 4 (select .cse6 .cse1))) 1)))) (select (store .cse5 .cse1 0) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse5 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)))))))) is different from false [2024-05-06 16:21:01,630 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_ring_init_~r#1.base|) |c_ULTIMATE.start_ring_init_~r#1.offset| 0)))) (and (forall ((v_ArrVal_5837 (Array Int Int)) (v_DerPreprocessor_3 Int) (v_ArrVal_5836 (Array Int Int))) (or (< v_DerPreprocessor_3 1) (< 4 v_DerPreprocessor_3) (< 0 (let ((.cse0 (let ((.cse2 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_5836) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse1) 4) 4) 1)))) (select (store .cse0 .cse1 v_DerPreprocessor_3) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (= v_DerPreprocessor_3 4))) (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5836 (Array Int Int)) (v_DerPreprocessor_2 Int)) (or (< 0 v_DerPreprocessor_2) (< 0 (let ((.cse4 (let ((.cse5 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_5836) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 .cse1) 4) 4) 1)))) (select (store .cse4 .cse1 v_DerPreprocessor_2) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse4 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)))) (< (+ 3 v_DerPreprocessor_2) 0))) (forall ((v_ArrVal_5837 (Array Int Int)) (v_ArrVal_5836 (Array Int Int))) (<= 1 (let ((.cse6 (let ((.cse7 (select (store (store .cse3 |c_ULTIMATE.start_main_~#reader~0#1.base| v_ArrVal_5836) |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5837) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse7 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse7 .cse1) 4) 4) 1)))) (select (store .cse6 .cse1 0) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse6 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))))))) is different from false [2024-05-06 16:21:01,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 16:21:01,647 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 92 [2024-05-06 16:21:01,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 16:21:01,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 432 treesize of output 420 [2024-05-06 16:21:01,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 16:21:01,686 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 424 treesize of output 275 [2024-05-06 16:21:01,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 16:21:01,783 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 209 treesize of output 178 [2024-05-06 16:21:01,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-05-06 16:21:02,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 16:21:02,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 182 treesize of output 218 [2024-05-06 16:21:04,128 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-06 16:21:04,133 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-06 16:21:04,133 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 1 [2024-05-06 16:21:04,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-06 16:21:04,139 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-05-06 16:21:04,140 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 1 [2024-05-06 16:21:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-05-06 16:21:04,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102742389] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 16:21:04,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 16:21:04,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 32] total 90 [2024-05-06 16:21:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175075796] [2024-05-06 16:21:04,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 16:21:04,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2024-05-06 16:21:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:21:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2024-05-06 16:21:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=6213, Unknown=24, NotChecked=1494, Total=8010 [2024-05-06 16:21:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:21:04,511 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:21:04,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.7444444444444445) internal successors, (337), 90 states have internal predecessors, (337), 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-05-06 16:21:04,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-06 16:21:04,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:22:14,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-06 16:23:32,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-06 16:25:36,915 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse55 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base|)) (.cse17 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20))) (let ((.cse56 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse55 .cse17) 4) 4)) (.cse32 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| 20)) (.cse6 (+ |c_writer_fnThread1of1ForFork1_~arg#1.offset| 20)) (.cse1 (+ |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| 20)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse24 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse44 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (.cse12 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20)) (.cse27 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse8 (= (select .cse27 0) 0)) (.cse11 (store .cse44 (+ (* (select .cse44 .cse12) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1|)) (.cse23 (store .cse13 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse13 .cse24) 4) 4) 1)) (.cse21 (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0)) (.cse0 (let ((.cse59 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base|))) (store .cse59 (+ |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| (* (select .cse59 .cse1) 4) 4) 1))) (.cse5 (let ((.cse58 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base|))) (store .cse58 (+ |c_writer_fnThread1of1ForFork1_~arg#1.offset| 4 (* (select .cse58 .cse6) 4)) 1))) (.cse31 (let ((.cse57 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base|))) (store .cse57 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| (* (select .cse57 .cse32) 4) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1|))) (.cse33 (store .cse55 .cse56 (+ |c_writer_fnThread1of1ForFork1_~i~1#1| 1))) (.cse16 (store .cse55 .cse56 1))) (and (= |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= |c_reader_twoThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse2 (select v_ArrVal_5839 .cse1))) (or (not (= (store .cse0 .cse1 .cse2) v_ArrVal_5839)) (< .cse2 1) (< 4 .cse2) (= .cse2 4) (< 0 (let ((.cse3 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse7 (select v_ArrVal_5839 .cse6))) (or (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse5 .cse6 .cse7) v_ArrVal_5839)) (< 0 .cse7) (< (+ .cse7 3) 0)))) .cse8 (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) 0) 0) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse9 (select v_ArrVal_5839 .cse12))) (or (< 4 .cse9) (= .cse9 4) (< 0 (let ((.cse10 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse10 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse10 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< .cse9 1) (not (= v_ArrVal_5839 (store .cse11 .cse12 .cse9)))))) (= (select .cse13 0) 0) (<= 1 (let ((.cse14 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse11 .cse12 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse14 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 1) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse18 (select v_ArrVal_5839 .cse17))) (or (< 0 (let ((.cse15 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse15 (+ (* (select .cse15 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse16 .cse17 .cse18) v_ArrVal_5839)) (< 0 .cse18) (< (+ .cse18 3) 0)))) (= |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.offset| 0) (= |c_writer_fnThread1of1ForFork1_~arg#1.base| |c_reader_twoThread1of1ForFork0_~r~2#1.base|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~arg#1.base|) 0) 0) (= |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse19 (select v_ArrVal_5839 .cse1))) (or (not (= (store .cse0 .cse1 .cse19) v_ArrVal_5839)) (< 0 .cse19) (< (+ 3 .cse19) 0) (< 0 (let ((.cse20 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse20 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse20 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) .cse21 (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~arg#1.base|) (<= 1 (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse23 .cse24 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse22 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (let ((.cse25 (select .cse27 20)) (.cse26 (= (select .cse27 4) 1))) (or (and .cse8 (= 0 .cse25) .cse26) (and .cse8 (<= 1 .cse25) (<= .cse25 3) .cse26) (and .cse8 (<= (+ 1 .cse25) 0) (<= 0 (+ 3 .cse25)) .cse26))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse28 (select v_ArrVal_5839 .cse12))) (or (< 0 .cse28) (< 0 (let ((.cse29 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse29 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse29 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< (+ .cse28 3) 0) (not (= v_ArrVal_5839 (store .cse11 .cse12 .cse28)))))) (<= 1 (let ((.cse30 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| (store .cse31 .cse32 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse30 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse30 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_writer_fnThread1of1ForFork1_#in~arg#1.base|) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse34 (select v_ArrVal_5839 .cse17))) (or (not (= (store .cse33 .cse17 .cse34) v_ArrVal_5839)) (< 0 (let ((.cse35 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse35 (+ (* (select .cse35 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (= .cse34 4) (< 4 .cse34) (< .cse34 1)))) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse36 (select v_ArrVal_5839 .cse24))) (or (< (+ .cse36 3) 0) (< 0 .cse36) (< 0 (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse37 (+ (* (select .cse37 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse23 .cse24 .cse36) v_ArrVal_5839))))) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse38 (select v_ArrVal_5839 .cse6))) (or (< 4 .cse38) (< 0 (let ((.cse39 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse39 (+ (* (select .cse39 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< .cse38 1) (= .cse38 4) (not (= (store .cse5 .cse6 .cse38) v_ArrVal_5839))))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse41 (select v_ArrVal_5839 .cse17))) (or (< 0 (let ((.cse40 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse40 (+ (* (select .cse40 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (= .cse41 4) (not (= (store .cse16 .cse17 .cse41) v_ArrVal_5839)) (< 4 .cse41) (< .cse41 1)))) (= |c_writer_fnThread1of1ForFork1_~arg#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~r~2#1.base|) (= |c_writer_fnThread1of1ForFork1_~i~1#1| 0) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse42 (select v_ArrVal_5839 .cse24))) (or (< .cse42 1) (< 0 (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse43 (+ (* (select .cse43 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 4 .cse42) (not (= (store .cse23 .cse24 .cse42) v_ArrVal_5839)) (= .cse42 4)))) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_writer_fnThread1of1ForFork1_~r~1#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (not (= |c_reader_twoThread1of1ForFork0_~arg#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (or (and .cse21 (= (select .cse44 0) 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) (= (select .cse44 4) 1) (= (select .cse44 20) 0)) (= 0 |c_reader_twoThread1of1ForFork0_ring_empty_#res#1|)) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base|) 0) 0) (= |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| |c_writer_fnThread1of1ForFork1_~r~1#1.base|) (= |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse45 (select v_ArrVal_5839 .cse17))) (or (not (= (store .cse33 .cse17 .cse45) v_ArrVal_5839)) (< 0 (let ((.cse46 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse46 (+ (* (select .cse46 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 0 .cse45) (< (+ .cse45 3) 0)))) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) 0) 0) (<= 1 (let ((.cse47 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| (store .cse0 .cse1 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse47 (+ (* (select .cse47 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (<= 1 (let ((.cse48 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| (store .cse5 .cse6 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse48 (+ (* (select .cse48 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse50 (select v_ArrVal_5839 .cse32))) (or (< 0 (let ((.cse49 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse49 (+ (* (select .cse49 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= v_ArrVal_5839 (store .cse31 .cse32 .cse50))) (< 0 .cse50) (< (+ .cse50 3) 0)))) (= |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 0) (= |c_reader_twoThread1of1ForFork0_ring_empty_~r#1.base| |c_writer_fnThread1of1ForFork1_~r~1#1.base|) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse52 (select v_ArrVal_5839 .cse32))) (or (< 0 (let ((.cse51 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse51 (+ (* (select .cse51 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= v_ArrVal_5839 (store .cse31 .cse32 .cse52))) (= .cse52 4) (< .cse52 1) (< 4 .cse52)))) (<= 1 (let ((.cse53 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store .cse33 .cse17 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse53 (+ (* (select .cse53 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (= |c_reader_twoThread1of1ForFork0_~arg#1.offset| 0) (<= 1 (let ((.cse54 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store .cse16 .cse17 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse54 (+ (* (select .cse54 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))))))) is different from false [2024-05-06 16:27:34,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse56 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base|)) (.cse17 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 20))) (let ((.cse57 (+ |c_writer_fnThread1of1ForFork1_~r~1#1.offset| (* (select .cse56 .cse17) 4) 4)) (.cse32 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| 20)) (.cse6 (+ |c_writer_fnThread1of1ForFork1_~arg#1.offset| 20)) (.cse1 (+ |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| 20)) (.cse21 (= |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 0)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|)) (.cse24 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse61 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|)) (.cse12 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 20)) (.cse27 (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (let ((.cse8 (= (select .cse27 0) 0)) (.cse11 (store .cse61 (+ (* (select .cse61 .cse12) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1|)) (.cse23 (store .cse13 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse13 .cse24) 4) 4) 1)) (.cse33 (and .cse21 (= (select .cse61 0) 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base|) (= (select .cse61 4) 1) (= (select .cse61 20) 0))) (.cse0 (let ((.cse60 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base|))) (store .cse60 (+ |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| (* (select .cse60 .cse1) 4) 4) 1))) (.cse5 (let ((.cse59 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base|))) (store .cse59 (+ |c_writer_fnThread1of1ForFork1_~arg#1.offset| 4 (* (select .cse59 .cse6) 4)) 1))) (.cse31 (let ((.cse58 (select |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base|))) (store .cse58 (+ |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.offset| (* (select .cse58 .cse32) 4) 4) |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~x#1|))) (.cse35 (store .cse56 .cse57 (+ |c_writer_fnThread1of1ForFork1_~i~1#1| 1))) (.cse16 (store .cse56 .cse57 1))) (and (= |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.offset| 0) (not (= |c_reader_twoThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse2 (select v_ArrVal_5839 .cse1))) (or (not (= (store .cse0 .cse1 .cse2) v_ArrVal_5839)) (< .cse2 1) (< 4 .cse2) (= .cse2 4) (< 0 (let ((.cse3 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse3 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse3 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse7 (select v_ArrVal_5839 .cse6))) (or (< 0 (let ((.cse4 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse4 (+ (* (select .cse4 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse5 .cse6 .cse7) v_ArrVal_5839)) (< 0 .cse7) (< (+ .cse7 3) 0)))) .cse8 (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) 0) 0) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse9 (select v_ArrVal_5839 .cse12))) (or (< 4 .cse9) (= .cse9 4) (< 0 (let ((.cse10 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse10 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse10 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< .cse9 1) (not (= v_ArrVal_5839 (store .cse11 .cse12 .cse9)))))) (= (select .cse13 0) 0) (<= 1 (let ((.cse14 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| (store .cse11 .cse12 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse14 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse14 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 1) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse18 (select v_ArrVal_5839 .cse17))) (or (< 0 (let ((.cse15 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse15 (+ (* (select .cse15 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse16 .cse17 .cse18) v_ArrVal_5839)) (< 0 .cse18) (< (+ .cse18 3) 0)))) (= |c_writer_fnThread1of1ForFork1_~arg#1.base| |c_reader_twoThread1of1ForFork0_~r~2#1.base|) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_~arg#1.base|) 0) 0) (= |c_writer_fnThread1of1ForFork1_#in~arg#1.offset| 0) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse19 (select v_ArrVal_5839 .cse1))) (or (not (= (store .cse0 .cse1 .cse19) v_ArrVal_5839)) (< 0 .cse19) (< (+ 3 .cse19) 0) (< 0 (let ((.cse20 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse20 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse20 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4))))))) .cse21 (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~arg#1.base|) (<= 1 (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store .cse23 .cse24 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse22 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse22 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (let ((.cse25 (select .cse27 20)) (.cse26 (= (select .cse27 4) 1))) (or (and .cse8 (= 0 .cse25) .cse26) (and .cse8 (<= 1 .cse25) (<= .cse25 3) .cse26) (and .cse8 (<= (+ 1 .cse25) 0) (<= 0 (+ 3 .cse25)) .cse26))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse28 (select v_ArrVal_5839 .cse12))) (or (< 0 .cse28) (< 0 (let ((.cse29 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse29 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse29 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (< (+ .cse28 3) 0) (not (= v_ArrVal_5839 (store .cse11 .cse12 .cse28)))))) (<= 1 (let ((.cse30 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| (store .cse31 .cse32 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse30 (+ |c_reader_twoThread1of1ForFork0_~r~2#1.offset| (* (select .cse30 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) 4)))) (not (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_writer_fnThread1of1ForFork1_#in~arg#1.base|) (or .cse33 (let ((.cse34 (div |c_reader_twoThread1of1ForFork0_#t~ret23#1| 256))) (and (<= |c_reader_twoThread1of1ForFork0_#t~ret23#1| (* 256 .cse34)) (<= 0 .cse34)))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse36 (select v_ArrVal_5839 .cse17))) (or (not (= (store .cse35 .cse17 .cse36) v_ArrVal_5839)) (< 0 (let ((.cse37 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse37 (+ (* (select .cse37 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (= .cse36 4) (< 4 .cse36) (< .cse36 1)))) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_#in~arg#1.base|) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse38 (select v_ArrVal_5839 .cse24))) (or (< (+ .cse38 3) 0) (< 0 .cse38) (< 0 (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse39 (+ (* (select .cse39 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= (store .cse23 .cse24 .cse38) v_ArrVal_5839))))) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse40 (select v_ArrVal_5839 .cse6))) (or (< 4 .cse40) (< 0 (let ((.cse41 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse41 (+ (* (select .cse41 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< .cse40 1) (= .cse40 4) (not (= (store .cse5 .cse6 .cse40) v_ArrVal_5839))))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse43 (select v_ArrVal_5839 .cse17))) (or (< 0 (let ((.cse42 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse42 (+ (* (select .cse42 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (= .cse43 4) (not (= (store .cse16 .cse17 .cse43) v_ArrVal_5839)) (< 4 .cse43) (< .cse43 1)))) (= |c_writer_fnThread1of1ForFork1_~arg#1.offset| 0) (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_reader_twoThread1of1ForFork0_~r~2#1.base|) (= |c_writer_fnThread1of1ForFork1_~i~1#1| 0) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse44 (select v_ArrVal_5839 .cse24))) (or (< .cse44 1) (< 0 (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse45 (+ (* (select .cse45 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 4 .cse44) (not (= (store .cse23 .cse24 .cse44) v_ArrVal_5839)) (= .cse44 4)))) (= |c_ULTIMATE.start_main_~#r~3#1.offset| 0) (= |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.offset| 0) (= |c_reader_twoThread1of1ForFork0_~r~2#1.base| |c_writer_fnThread1of1ForFork1_~r~1#1.base|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#reader~0#1.base|)) (not (= |c_reader_twoThread1of1ForFork0_~arg#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (or .cse33 (= 0 |c_reader_twoThread1of1ForFork0_ring_empty_#res#1|)) (= |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base| |c_writer_fnThread1of1ForFork1_~r~1#1.base|) (= |c_writer_fnThread1of1ForFork1_~r~1#1.offset| 0) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse46 (select v_ArrVal_5839 .cse17))) (or (not (= (store .cse35 .cse17 .cse46) v_ArrVal_5839)) (< 0 (let ((.cse47 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse47 (+ (* (select .cse47 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (< 0 .cse46) (< (+ .cse46 3) 0)))) (= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork0_ring_empty_#in~r#1.base|) 0) 0) (<= 1 (let ((.cse48 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_#in~arg#1.base| (store .cse0 .cse1 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse48 (+ (* (select .cse48 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= |c_ULTIMATE.start_main_~#r~3#1.base| |c_ULTIMATE.start_main_~#writer~0#1.base|)) (<= 1 (let ((.cse49 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~arg#1.base| (store .cse5 .cse6 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse49 (+ (* (select .cse49 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse51 (select v_ArrVal_5839 .cse32))) (or (< 0 (let ((.cse50 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse50 (+ (* (select .cse50 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= v_ArrVal_5839 (store .cse31 .cse32 .cse51))) (< 0 .cse51) (< (+ .cse51 3) 0)))) (= |c_reader_twoThread1of1ForFork0_#in~arg#1.offset| 0) (forall ((v_ArrVal_5839 (Array Int Int))) (let ((.cse53 (select v_ArrVal_5839 .cse32))) (or (< 0 (let ((.cse52 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_ring_enqueue_#in~r#1.base| v_ArrVal_5839) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse52 (+ (* (select .cse52 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (not (= v_ArrVal_5839 (store .cse31 .cse32 .cse53))) (= .cse53 4) (< .cse53 1) (< 4 .cse53)))) (<= 1 (let ((.cse54 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store .cse35 .cse17 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse54 (+ (* (select .cse54 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))) (= |c_reader_twoThread1of1ForFork0_~arg#1.offset| 0) (<= 1 (let ((.cse55 (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork1_~r~1#1.base| (store .cse16 .cse17 0)) |c_reader_twoThread1of1ForFork0_~r~2#1.base|))) (select .cse55 (+ (* (select .cse55 |c_reader_twoThread1of1ForFork0_~r~2#1.offset|) 4) |c_reader_twoThread1of1ForFork0_~r~2#1.offset| 4)))))))) is different from false [2024-05-06 16:29:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-06 16:29:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-05-06 16:29:53,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-06 16:29:53,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2024-05-06 16:29:53,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-05-06 16:29:53,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 16:29:53,583 INFO L85 PathProgramCache]: Analyzing trace with hash 250164921, now seen corresponding path program 1 times [2024-05-06 16:29:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 16:29:53,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795977596] [2024-05-06 16:29:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:29:53,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 16:29:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:29:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:29:56,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 16:29:56,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795977596] [2024-05-06 16:29:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795977596] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-06 16:29:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839453103] [2024-05-06 16:29:56,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 16:29:56,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-06 16:29:56,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 16:29:56,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-06 16:29:56,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-06 16:29:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 16:29:57,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 112 conjunts are in the unsatisfiable core [2024-05-06 16:29:57,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-06 16:29:57,340 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 6 treesize of output 5 [2024-05-06 16:29:57,359 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-05-06 16:29:57,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-05-06 16:29:57,391 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-05-06 16:29:57,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-05-06 16:29:57,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-06 16:29:57,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-05-06 16:29:57,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-06 16:29:57,871 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 11 [2024-05-06 16:29:58,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-06 16:29:58,936 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-05-06 16:29:58,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 29 [2024-05-06 16:29:59,170 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 107 treesize of output 79 [2024-05-06 16:29:59,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 79 treesize of output 85 [2024-05-06 16:29:59,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 23 [2024-05-06 16:29:59,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 30 [2024-05-06 16:30:01,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-06 16:30:01,338 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 1 case distinctions, treesize of input 95 treesize of output 43 [2024-05-06 16:30:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:30:01,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-06 16:31:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 16:31:38,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839453103] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-06 16:31:38,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-06 16:31:38,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39, 31] total 82 [2024-05-06 16:31:38,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140657841] [2024-05-06 16:31:38,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-06 16:31:38,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-05-06 16:31:38,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 16:31:38,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-05-06 16:31:38,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=6230, Unknown=4, NotChecked=0, Total=6642 [2024-05-06 16:31:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:31:38,623 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 16:31:38,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 3.182926829268293) internal successors, (261), 82 states have internal predecessors, (261), 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-05-06 16:31:38,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-06 16:31:38,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-05-06 16:31:38,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 16:31:50,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2024-05-06 16:32:38,855 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 16:32:38,856 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 16:32:38,856 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-06 16:32:38,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-06 16:32:39,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2024-05-06 16:32:39,058 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 116 known predicates. [2024-05-06 16:32:39,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 10 remaining) [2024-05-06 16:32:39,060 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2024-05-06 16:32:39,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-05-06 16:32:39,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2024-05-06 16:32:39,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2024-05-06 16:32:39,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2024-05-06 16:32:39,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 10 remaining) [2024-05-06 16:32:39,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2024-05-06 16:32:39,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2024-05-06 16:32:39,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-05-06 16:32:39,065 INFO L448 BasicCegarLoop]: Path program histogram: [14, 8, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2024-05-06 16:32:39,069 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 16:32:39,070 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 16:32:39,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 04:32:39 BasicIcfg [2024-05-06 16:32:39,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 16:32:39,072 INFO L158 Benchmark]: Toolchain (without parser) took 818473.60ms. Allocated memory was 278.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 206.0MB in the beginning and 944.0MB in the end (delta: -738.0MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-05-06 16:32:39,072 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 278.9MB. Free memory is still 245.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 16:32:39,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 814.18ms. Allocated memory is still 278.9MB. Free memory was 206.0MB in the beginning and 239.9MB in the end (delta: -33.9MB). Peak memory consumption was 39.0MB. Max. memory is 8.0GB. [2024-05-06 16:32:39,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.02ms. Allocated memory is still 278.9MB. Free memory was 239.9MB in the beginning and 236.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 16:32:39,073 INFO L158 Benchmark]: Boogie Preprocessor took 37.35ms. Allocated memory is still 278.9MB. Free memory was 236.7MB in the beginning and 234.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 16:32:39,073 INFO L158 Benchmark]: RCFGBuilder took 589.89ms. Allocated memory is still 278.9MB. Free memory was 234.6MB in the beginning and 210.0MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2024-05-06 16:32:39,073 INFO L158 Benchmark]: TraceAbstraction took 816945.33ms. Allocated memory was 278.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 208.4MB in the beginning and 944.0MB in the end (delta: -735.6MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-05-06 16:32:39,074 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.13ms. Allocated memory is still 278.9MB. Free memory is still 245.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 814.18ms. Allocated memory is still 278.9MB. Free memory was 206.0MB in the beginning and 239.9MB in the end (delta: -33.9MB). Peak memory consumption was 39.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.02ms. Allocated memory is still 278.9MB. Free memory was 239.9MB in the beginning and 236.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.35ms. Allocated memory is still 278.9MB. Free memory was 236.7MB in the beginning and 234.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 589.89ms. Allocated memory is still 278.9MB. Free memory was 234.6MB in the beginning and 210.0MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 816945.33ms. Allocated memory was 278.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 208.4MB in the beginning and 944.0MB in the end (delta: -735.6MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 360231, independent: 351554, independent conditional: 349987, independent unconditional: 1567, dependent: 8677, dependent conditional: 8676, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 351993, independent: 351554, independent conditional: 349987, independent unconditional: 1567, dependent: 439, dependent conditional: 438, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 351993, independent: 351554, independent conditional: 349987, independent unconditional: 1567, dependent: 439, dependent conditional: 438, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 351993, independent: 351554, independent conditional: 349987, independent unconditional: 1567, dependent: 439, dependent conditional: 438, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 353716, independent: 351554, independent conditional: 163842, independent unconditional: 187712, dependent: 2162, dependent conditional: 1551, dependent unconditional: 611, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 353716, independent: 351554, independent conditional: 59461, independent unconditional: 292093, dependent: 2162, dependent conditional: 727, dependent unconditional: 1435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 353716, independent: 351554, independent conditional: 59461, independent unconditional: 292093, dependent: 2162, dependent conditional: 727, dependent unconditional: 1435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3616, independent: 3573, independent conditional: 425, independent unconditional: 3148, dependent: 43, dependent conditional: 33, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3616, independent: 3568, independent conditional: 0, independent unconditional: 3568, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 43, dependent conditional: 33, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 43, dependent conditional: 33, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, independent: 11, independent conditional: 8, independent unconditional: 3, dependent: 132, dependent conditional: 84, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 353716, independent: 347981, independent conditional: 59036, independent unconditional: 288945, dependent: 2119, dependent conditional: 694, dependent unconditional: 1425, unknown: 3616, unknown conditional: 458, unknown unconditional: 3158] , Statistics on independence cache: Total cache size (in pairs): 3616, Positive cache size: 3573, Positive conditional cache size: 425, Positive unconditional cache size: 3148, Negative cache size: 43, Negative conditional cache size: 33, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105205, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 353716, independent: 351554, independent conditional: 163842, independent unconditional: 187712, dependent: 2162, dependent conditional: 1551, dependent unconditional: 611, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 353716, independent: 351554, independent conditional: 59461, independent unconditional: 292093, dependent: 2162, dependent conditional: 727, dependent unconditional: 1435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 353716, independent: 351554, independent conditional: 59461, independent unconditional: 292093, dependent: 2162, dependent conditional: 727, dependent unconditional: 1435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3616, independent: 3573, independent conditional: 425, independent unconditional: 3148, dependent: 43, dependent conditional: 33, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3616, independent: 3568, independent conditional: 0, independent unconditional: 3568, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 48, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 43, dependent conditional: 33, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 43, dependent conditional: 33, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, independent: 11, independent conditional: 8, independent unconditional: 3, dependent: 132, dependent conditional: 84, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 353716, independent: 347981, independent conditional: 59036, independent unconditional: 288945, dependent: 2119, dependent conditional: 694, dependent unconditional: 1425, unknown: 3616, unknown conditional: 458, unknown unconditional: 3158] , Statistics on independence cache: Total cache size (in pairs): 3616, Positive cache size: 3573, Positive conditional cache size: 425, Positive unconditional cache size: 3148, Negative cache size: 43, Negative conditional cache size: 33, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105205 ], Independence queries for same thread: 8238 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 116 known predicates. - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 116 known predicates. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 116 known predicates. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 116 known predicates. - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 116 known predicates. - TimeoutResultAtElement [Line: 1076]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 116 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 338 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 816.8s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 14, EmptinessCheckTime: 694.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 120.9s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 915 ConstructedInterpolants, 129 QuantifiedInterpolants, 99375 SizeOfPredicates, 91 NumberOfNonLiveVariables, 689 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 2/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 100.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 4, ConditionalCommutativityConditionCalculations: 107, ConditionalCommutativityTraceChecks: 59, ConditionalCommutativityImperfectProofs: 53 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown