./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d59c014df9ead169c56b7ae39b852ef0f17fdf8c183ee9a03f7bf209d03f772f --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-16 23:39:59,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-16 23:39:59,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-16 23:39:59,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-16 23:39:59,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-16 23:39:59,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-16 23:39:59,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-16 23:39:59,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-16 23:39:59,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-16 23:39:59,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-16 23:39:59,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-16 23:39:59,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-16 23:39:59,899 INFO L153 SettingsManager]: * Use SBE=true [2024-10-16 23:39:59,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-16 23:39:59,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-16 23:39:59,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-16 23:39:59,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-16 23:39:59,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-16 23:39:59,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-16 23:39:59,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-16 23:39:59,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-16 23:39:59,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-16 23:39:59,902 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-16 23:39:59,903 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-16 23:39:59,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-16 23:39:59,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-16 23:39:59,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-16 23:39:59,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-16 23:39:59,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-16 23:39:59,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-16 23:39:59,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 23:39:59,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-16 23:39:59,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-16 23:39:59,905 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-16 23:39:59,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-16 23:39:59,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-16 23:39:59,906 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-16 23:39:59,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-16 23:39:59,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-16 23:39:59,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-16 23:39:59,907 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-16 23:39:59,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d59c014df9ead169c56b7ae39b852ef0f17fdf8c183ee9a03f7bf209d03f772f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR [2024-10-16 23:40:00,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-16 23:40:00,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-16 23:40:00,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-16 23:40:00,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-16 23:40:00,131 INFO L274 PluginConnector]: CDTParser initialized [2024-10-16 23:40:00,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-10-16 23:40:01,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-16 23:40:01,530 INFO L384 CDTParser]: Found 1 translation units. [2024-10-16 23:40:01,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-10-16 23:40:01,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/543ef52d8/e41c630b94ef424ba7aa45d1ba103bfc/FLAGbd049e0a6 [2024-10-16 23:40:01,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/543ef52d8/e41c630b94ef424ba7aa45d1ba103bfc [2024-10-16 23:40:01,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-16 23:40:01,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-16 23:40:01,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-16 23:40:01,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-16 23:40:01,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-16 23:40:01,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:01,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529d1c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01, skipping insertion in model container [2024-10-16 23:40:01,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:01,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-16 23:40:01,917 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] [2024-10-16 23:40:01,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 23:40:01,934 INFO L200 MainTranslator]: Completed pre-run [2024-10-16 23:40:01,975 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] [2024-10-16 23:40:01,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 23:40:02,013 INFO L204 MainTranslator]: Completed translation [2024-10-16 23:40:02,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02 WrapperNode [2024-10-16 23:40:02,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-16 23:40:02,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-16 23:40:02,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-16 23:40:02,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-16 23:40:02,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,053 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2024-10-16 23:40:02,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-16 23:40:02,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-16 23:40:02,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-16 23:40:02,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-16 23:40:02,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-16 23:40:02,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-16 23:40:02,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-16 23:40:02,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-16 23:40:02,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (1/1) ... [2024-10-16 23:40:02,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 23:40:02,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:02,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:02,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-16 23:40:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-16 23:40:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-16 23:40:02,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-16 23:40:02,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-16 23:40:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-16 23:40:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-16 23:40:02,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-16 23:40:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-16 23:40:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-16 23:40:02,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-16 23:40:02,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-16 23:40:02,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-16 23:40:02,161 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-16 23:40:02,263 INFO L238 CfgBuilder]: Building ICFG [2024-10-16 23:40:02,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-16 23:40:02,387 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-16 23:40:02,387 INFO L287 CfgBuilder]: Performing block encoding [2024-10-16 23:40:02,468 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-16 23:40:02,469 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-16 23:40:02,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:40:02 BoogieIcfgContainer [2024-10-16 23:40:02,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-16 23:40:02,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-16 23:40:02,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-16 23:40:02,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-16 23:40:02,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:40:01" (1/3) ... [2024-10-16 23:40:02,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d9840f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:40:02, skipping insertion in model container [2024-10-16 23:40:02,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:02" (2/3) ... [2024-10-16 23:40:02,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d9840f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:40:02, skipping insertion in model container [2024-10-16 23:40:02,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:40:02" (3/3) ... [2024-10-16 23:40:02,476 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-10-16 23:40:02,488 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-16 23:40:02,488 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-16 23:40:02,489 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-16 23:40:02,525 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-16 23:40:02,555 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:40:02,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:40:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:02,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:02,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-16 23:40:02,628 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:40:02,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:02,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-16 23:40:02,651 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6296d9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:40:02,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:40:03,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:03,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:03,251 INFO L85 PathProgramCache]: Analyzing trace with hash 253978131, now seen corresponding path program 1 times [2024-10-16 23:40:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614701744] [2024-10-16 23:40:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:03,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614701744] [2024-10-16 23:40:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614701744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:03,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:40:03,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:40:03,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61809420] [2024-10-16 23:40:03,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:03,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:40:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:03,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:40:03,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:40:03,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:03,561 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:03,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:03,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:04,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-16 23:40:04,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-16 23:40:04,036 INFO L414 BasicCegarLoop]: Path program histogram: [1] [2024-10-16 23:40:04,039 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-16 23:40:04,043 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:40:04,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:40:04,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:04,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:04,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-10-16 23:40:04,095 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:40:04,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:04,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-16 23:40:04,096 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6296d9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:40:04,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:40:04,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:40:04,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash -740144592, now seen corresponding path program 1 times [2024-10-16 23:40:04,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:04,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491668412] [2024-10-16 23:40:04,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:04,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:04,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491668412] [2024-10-16 23:40:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491668412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:04,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:40:04,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:40:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003261722] [2024-10-16 23:40:04,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:04,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:40:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:40:04,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:40:04,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:04,470 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:04,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:04,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:04,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-16 23:40:04,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:40:04,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1468636501, now seen corresponding path program 1 times [2024-10-16 23:40:04,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:04,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137102306] [2024-10-16 23:40:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:04,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:04,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137102306] [2024-10-16 23:40:04,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137102306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:04,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:40:04,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-16 23:40:04,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560127931] [2024-10-16 23:40:04,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:04,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-16 23:40:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:04,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-16 23:40:04,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-16 23:40:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:04,755 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:04,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:04,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:04,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:04,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:04,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-16 23:40:04,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:40:04,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:04,827 INFO L85 PathProgramCache]: Analyzing trace with hash -716612086, now seen corresponding path program 1 times [2024-10-16 23:40:04,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:04,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086952389] [2024-10-16 23:40:04,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:04,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:04,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:40:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:04,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-16 23:40:04,865 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-16 23:40:04,865 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-16 23:40:04,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-16 23:40:04,870 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-16 23:40:04,870 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-16 23:40:04,871 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-16 23:40:04,871 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-16 23:40:04,883 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-16 23:40:04,885 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:40:04,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:40:04,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:04,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:04,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-16 23:40:04,919 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:40:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:04,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-16 23:40:04,920 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6296d9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:40:04,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:40:05,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:40:05,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1928881372, now seen corresponding path program 1 times [2024-10-16 23:40:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:05,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233978013] [2024-10-16 23:40:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 23:40:05,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:05,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233978013] [2024-10-16 23:40:05,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233978013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:05,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:40:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:40:05,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73101783] [2024-10-16 23:40:05,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:05,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:40:05,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:05,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:40:05,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:40:05,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:05,998 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:05,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:05,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:06,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-16 23:40:06,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:40:06,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash -117332995, now seen corresponding path program 1 times [2024-10-16 23:40:06,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:06,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278620753] [2024-10-16 23:40:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:06,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:40:06,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:06,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278620753] [2024-10-16 23:40:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278620753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:06,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:40:06,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-16 23:40:06,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800642680] [2024-10-16 23:40:06,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:06,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-16 23:40:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:06,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-16 23:40:06,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-16 23:40:06,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:06,968 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:06,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:06,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:06,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:07,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-16 23:40:07,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:40:07,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash 809276065, now seen corresponding path program 1 times [2024-10-16 23:40:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:07,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972332880] [2024-10-16 23:40:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:07,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:40:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:07,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-16 23:40:07,108 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-16 23:40:07,109 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-16 23:40:07,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-16 23:40:07,110 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-16 23:40:07,111 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-16 23:40:07,111 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-16 23:40:07,111 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-16 23:40:07,128 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-16 23:40:07,130 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:40:07,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:40:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:07,131 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:07,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-16 23:40:07,164 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:40:07,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:07,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-16 23:40:07,165 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6296d9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:40:07,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:40:09,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:09,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1189130370, now seen corresponding path program 1 times [2024-10-16 23:40:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:09,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580320269] [2024-10-16 23:40:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:40:09,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:09,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580320269] [2024-10-16 23:40:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580320269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:09,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:40:09,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:40:09,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12517953] [2024-10-16 23:40:09,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:09,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:40:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:09,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:40:09,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:40:09,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:09,085 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:09,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:09,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:10,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-16 23:40:10,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:10,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1104725074, now seen corresponding path program 1 times [2024-10-16 23:40:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:10,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376934186] [2024-10-16 23:40:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-16 23:40:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:10,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376934186] [2024-10-16 23:40:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376934186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:10,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:40:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-16 23:40:10,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634952932] [2024-10-16 23:40:10,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:10,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-16 23:40:10,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:10,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-16 23:40:10,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-16 23:40:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:10,716 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:10,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:10,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:10,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:12,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-16 23:40:12,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:12,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash 422354690, now seen corresponding path program 1 times [2024-10-16 23:40:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621129569] [2024-10-16 23:40:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-16 23:40:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:12,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621129569] [2024-10-16 23:40:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621129569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:12,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:40:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:40:12,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794434956] [2024-10-16 23:40:12,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:12,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:40:12,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:40:12,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:40:12,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:12,420 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:12,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:12,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:12,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:12,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:13,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-16 23:40:13,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:13,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1800356050, now seen corresponding path program 2 times [2024-10-16 23:40:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104073957] [2024-10-16 23:40:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104073957] [2024-10-16 23:40:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104073957] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003916719] [2024-10-16 23:40:13,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-16 23:40:13,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:13,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:13,910 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:13,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-16 23:40:14,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-16 23:40:14,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:40:14,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-16 23:40:14,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:14,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:40:14,071 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-10-16 23:40:14,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:40:14,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:40:14,142 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 11 treesize of output 11 [2024-10-16 23:40:14,162 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-10-16 23:40:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:14,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:14,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:40:14,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-16 23:40:14,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:40:14,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:14,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-16 23:40:14,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 23:40:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:14,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003916719] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:40:14,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:40:14,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2024-10-16 23:40:14,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569574856] [2024-10-16 23:40:14,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:40:14,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-16 23:40:14,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:14,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-16 23:40:14,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=546, Unknown=11, NotChecked=0, Total=650 [2024-10-16 23:40:14,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:14,786 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:14,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:14,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:14,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:14,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:14,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:15,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (not (= c_~top~0 0)) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-10-16 23:40:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-16 23:40:17,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-16 23:40:17,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-16 23:40:17,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:17,611 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 320 treesize of output 296 [2024-10-16 23:40:17,644 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 570 treesize of output 522 [2024-10-16 23:40:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash -693311828, now seen corresponding path program 1 times [2024-10-16 23:40:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:17,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:17,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:40:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:17,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash 374120906, now seen corresponding path program 3 times [2024-10-16 23:40:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:17,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270213962] [2024-10-16 23:40:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:17,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-16 23:40:17,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:17,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270213962] [2024-10-16 23:40:17,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270213962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:17,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:40:17,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:40:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547389848] [2024-10-16 23:40:17,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:17,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:40:17,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:40:17,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:40:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:17,819 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:17,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:17,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:17,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:17,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:17,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-16 23:40:17,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:19,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= c_~top~0 0)) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-10-16 23:40:19,200 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-10-16 23:40:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-16 23:40:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2024-10-16 23:40:20,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:20,367 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:40:20,370 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 1 case distinctions, treesize of input 264 treesize of output 242 [2024-10-16 23:40:20,387 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 10 treesize of output 6 [2024-10-16 23:40:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1978635647, now seen corresponding path program 1 times [2024-10-16 23:40:20,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:20,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:20,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:40:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:20,511 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 23 treesize of output 19 [2024-10-16 23:40:20,519 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 23 treesize of output 19 [2024-10-16 23:40:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash -376699701, now seen corresponding path program 1 times [2024-10-16 23:40:20,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:20,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:40:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:20,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1605480042, now seen corresponding path program 4 times [2024-10-16 23:40:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:20,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836541046] [2024-10-16 23:40:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:20,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:20,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836541046] [2024-10-16 23:40:20,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836541046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604289105] [2024-10-16 23:40:20,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-16 23:40:20,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:20,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:20,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:20,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-16 23:40:21,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-16 23:40:21,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:40:21,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-16 23:40:21,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:21,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:40:21,067 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-10-16 23:40:21,090 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-16 23:40:21,091 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 14 treesize of output 13 [2024-10-16 23:40:21,154 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:40:21,154 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 27 treesize of output 27 [2024-10-16 23:40:21,205 INFO L349 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2024-10-16 23:40:21,205 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 36 treesize of output 46 [2024-10-16 23:40:21,265 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-10-16 23:40:21,265 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 31 treesize of output 39 [2024-10-16 23:40:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:21,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:21,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2024-10-16 23:40:21,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-10-16 23:40:21,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-10-16 23:40:21,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:21,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-10-16 23:40:21,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:21,988 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-16 23:40:22,050 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-10-16 23:40:22,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 226 [2024-10-16 23:40:22,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 188 [2024-10-16 23:40:22,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 186 [2024-10-16 23:40:22,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 184 [2024-10-16 23:40:22,331 INFO L349 Elim1Store]: treesize reduction 135, result has 44.9 percent of original size [2024-10-16 23:40:22,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 159 treesize of output 242 [2024-10-16 23:40:22,356 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-10-16 23:40:22,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 148 [2024-10-16 23:40:22,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2024-10-16 23:40:22,401 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2024-10-16 23:40:22,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 182 [2024-10-16 23:40:22,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 100 [2024-10-16 23:40:22,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 98 [2024-10-16 23:40:22,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2024-10-16 23:40:22,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:22,541 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 20 treesize of output 24 [2024-10-16 23:40:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604289105] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:40:22,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:40:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2024-10-16 23:40:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461966298] [2024-10-16 23:40:22,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:40:22,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-16 23:40:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-16 23:40:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=702, Unknown=10, NotChecked=54, Total=870 [2024-10-16 23:40:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:22,600 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:22,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.9) internal successors, (117), 29 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:22,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:22,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:22,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:22,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-10-16 23:40:22,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:22,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:23,093 WARN L851 $PredicateComparison]: unable to prove that (and (not (= c_~top~0 0)) (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2024-10-16 23:40:25,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse2 (< c_~next_alloc_idx~0 65)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse3 (not (= (+ (select .cse4 0) 1) 0)))) (and (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (let ((.cse0 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| (store .cse0 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0))))) .cse1) (or .cse2 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 1) 0)) (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0)))))) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0) 0))) .cse3))) (or .cse2 (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_6) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0))))) (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))) (or .cse1 (and (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store .cse4 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0) 0))) .cse3) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (let ((.cse5 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|))) (or (not (= (+ (select .cse5 0) 1) 0)) (forall ((v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| (store .cse5 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0)))))))))))) is different from false [2024-10-16 23:40:26,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse2 (< c_~next_alloc_idx~0 65)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse3 (not (= (+ (select .cse4 0) 1) 0)))) (and (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (let ((.cse0 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| (store .cse0 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0))))) .cse1) (or .cse2 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 1) 0)) (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0)))))) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0) 0))) .cse3))) (or .cse2 (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_6) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0))))) (or .cse1 (and (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store .cse4 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0) 0))) .cse3) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (let ((.cse5 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|))) (or (not (= (+ (select .cse5 0) 1) 0)) (forall ((v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| (store .cse5 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0)))))))))))) is different from false [2024-10-16 23:40:26,922 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|)) (.cse7 (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse3 (< c_~next_alloc_idx~0 65)) (.cse2 (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (.cse1 (= |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (.cse0 (not .cse7)) (.cse6 (not (= (+ (select .cse8 0) 1) 0))) (.cse5 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and .cse1 (not (= .cse2 0)))) (or .cse3 (forall ((v_ArrVal_597 Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_6) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_597) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0))))) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (let ((.cse4 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| (store .cse4 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0))))) .cse5) (or .cse3 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 1) 0)) (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0)))))) (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0) 0))) .cse6))) (or .cse7 (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) |c_thr1Thread3of3ForFork0_push_#t~mem1#1|)) (or .cse3 (forall ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_6) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0))))) (not (= c_~top~0 0)) (or (and (= .cse2 |c_thr1Thread2of3ForFork0_push_#t~mem1#1|) .cse1) .cse0) (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))) (or .cse5 (and (or (forall ((v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store .cse8 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0) 0))) .cse6) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|))) (or (not (= (+ (select .cse9 0) 1) 0)) (forall ((v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| (store .cse9 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0))))))))) (or .cse5 (forall ((v_ArrVal_597 Int) (v_DerPreprocessor_5 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (let ((.cse10 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|))) (or (not (= (+ (select .cse10 0) 1) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| (store .cse10 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_597) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0))))))))) is different from false [2024-10-16 23:40:33,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-10-16 23:40:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-16 23:40:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-10-16 23:40:36,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-16 23:40:36,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-10-16 23:40:36,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:36,770 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 23 treesize of output 19 [2024-10-16 23:40:36,776 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 23 treesize of output 19 [2024-10-16 23:40:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1739801773, now seen corresponding path program 1 times [2024-10-16 23:40:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:38,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:40:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:38,975 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 23 treesize of output 19 [2024-10-16 23:40:38,980 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 23 treesize of output 19 [2024-10-16 23:40:41,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1431127785, now seen corresponding path program 1 times [2024-10-16 23:40:41,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:41,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:41,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:40:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:41,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash -534771958, now seen corresponding path program 5 times [2024-10-16 23:40:41,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:41,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407704683] [2024-10-16 23:40:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:40:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407704683] [2024-10-16 23:40:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407704683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266929409] [2024-10-16 23:40:41,346 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-16 23:40:41,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:41,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:41,347 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:41,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-16 23:40:41,453 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-16 23:40:41,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:40:41,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-16 23:40:41,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:41,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:40:41,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:40:41,563 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-16 23:40:41,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 22 [2024-10-16 23:40:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:40:41,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:42,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:42,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-16 23:40:42,115 INFO L349 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2024-10-16 23:40:42,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 195 [2024-10-16 23:40:42,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2024-10-16 23:40:42,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 114 [2024-10-16 23:40:42,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:42,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 366 treesize of output 404 [2024-10-16 23:40:42,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 140 [2024-10-16 23:40:42,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 136 [2024-10-16 23:40:42,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 134 [2024-10-16 23:40:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:40:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266929409] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:40:42,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:40:42,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 27 [2024-10-16 23:40:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411597745] [2024-10-16 23:40:42,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:40:42,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-16 23:40:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-16 23:40:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=635, Unknown=15, NotChecked=0, Total=756 [2024-10-16 23:40:42,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:42,771 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:42,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.214285714285714) internal successors, (118), 27 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-16 23:40:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-10-16 23:40:42,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:43,210 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65))) (and (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0)) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (or (< 0 (select (select (store .cse0 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select .cse0 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0))))) .cse1) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (< 0 (select (select (store .cse2 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select .cse2 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (< 0 (select (select (store .cse3 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0))))) (not (= c_~top~0 0)) (not (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse1 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (or (< 0 (select (select (store .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0)) (not (= (+ (select (select .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0)))))))) is different from false [2024-10-16 23:40:48,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:40:48,309 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0)) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (< 0 (select (select (store .cse0 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0)) (not (= (+ (select (select .cse0 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0))))) (not (= c_~top~0 0)) (or (= |c_thr1Thread3of3ForFork0_push_#t~mem1#1| 0) (not (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (or (< 0 (select (select (store .cse1 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0))))))) is different from false [2024-10-16 23:40:50,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:40:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-16 23:40:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-10-16 23:40:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-16 23:40:52,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-16 23:40:52,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-10-16 23:40:52,985 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:53,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1095418726, now seen corresponding path program 6 times [2024-10-16 23:40:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433768800] [2024-10-16 23:40:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:53,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:53,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433768800] [2024-10-16 23:40:53,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433768800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:53,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665800494] [2024-10-16 23:40:53,373 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-16 23:40:53,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:53,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:53,374 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:53,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-16 23:40:53,471 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-16 23:40:53,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:40:53,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-16 23:40:53,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:53,484 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-10-16 23:40:53,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:40:53,583 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:40:53,584 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 11 treesize of output 11 [2024-10-16 23:40:53,601 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-10-16 23:40:53,668 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-16 23:40:53,668 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 1 case distinctions, treesize of input 19 treesize of output 22 [2024-10-16 23:40:53,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:53,728 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 31 treesize of output 23 [2024-10-16 23:40:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:53,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:53,819 WARN L851 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (not (= 0 (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2024-10-16 23:40:53,897 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_prenex_78 Int) (v_DerPreprocessor_12 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12))) (store .cse0 v_prenex_78 (store (select .cse0 v_prenex_78) 0 (+ c_~next_alloc_idx~0 2)))) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))))) is different from false [2024-10-16 23:40:56,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:56,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-10-16 23:40:56,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:56,099 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-16 23:40:56,128 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 169 treesize of output 157 [2024-10-16 23:40:56,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-10-16 23:40:56,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-10-16 23:40:56,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-10-16 23:40:56,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:56,163 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 474 treesize of output 460 [2024-10-16 23:40:56,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 311 [2024-10-16 23:40:56,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 309 [2024-10-16 23:40:56,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 305 [2024-10-16 23:40:56,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 303 [2024-10-16 23:40:56,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 299 [2024-10-16 23:40:56,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 158 [2024-10-16 23:40:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-16 23:40:56,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665800494] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:40:56,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:40:56,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 27 [2024-10-16 23:40:56,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666369115] [2024-10-16 23:40:56,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:40:56,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-16 23:40:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-16 23:40:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=549, Unknown=11, NotChecked=98, Total=756 [2024-10-16 23:40:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:56,501 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:56,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.035714285714286) internal successors, (113), 27 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-16 23:40:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:40:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-10-16 23:40:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-10-16 23:40:56,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-10-16 23:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-10-16 23:41:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-16 23:41:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-10-16 23:41:10,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-16 23:41:10,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:41:10,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:41:10,770 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 622 treesize of output 574 [2024-10-16 23:41:10,792 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 1086 treesize of output 990 [2024-10-16 23:41:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash 851192786, now seen corresponding path program 1 times [2024-10-16 23:41:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:41:10,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:41:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:41:10,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:41:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:41:10,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 23 treesize of output 19 [2024-10-16 23:41:10,999 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 23 treesize of output 19 [2024-10-16 23:41:11,057 INFO L85 PathProgramCache]: Analyzing trace with hash 947995205, now seen corresponding path program 1 times [2024-10-16 23:41:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:41:11,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:41:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:41:11,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:41:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:41:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:41:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash 226482258, now seen corresponding path program 7 times [2024-10-16 23:41:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:41:11,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787308125] [2024-10-16 23:41:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:41:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:41:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:41:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:41:11,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:41:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787308125] [2024-10-16 23:41:11,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787308125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:41:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870057061] [2024-10-16 23:41:11,350 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-16 23:41:11,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:41:11,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:41:11,352 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:41:11,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-16 23:41:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:41:11,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-16 23:41:11,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:41:11,487 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-10-16 23:41:11,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:41:11,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:41:11,580 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:41:11,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 11 treesize of output 11 [2024-10-16 23:41:11,584 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 17 treesize of output 12 [2024-10-16 23:41:11,594 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 16 treesize of output 8 [2024-10-16 23:41:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:41:11,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:41:11,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:41:11,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-16 23:41:11,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-10-16 23:41:11,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-10-16 23:41:11,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-10-16 23:41:11,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-10-16 23:41:11,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:41:11,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-16 23:41:11,863 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 78 treesize of output 70 [2024-10-16 23:41:11,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-10-16 23:41:11,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-10-16 23:41:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:41:11,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870057061] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-16 23:41:11,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-16 23:41:11,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 10] total 24 [2024-10-16 23:41:11,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199524249] [2024-10-16 23:41:11,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:41:11,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-16 23:41:11,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:41:11,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-16 23:41:11,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=447, Unknown=6, NotChecked=0, Total=552 [2024-10-16 23:41:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:41:11,901 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:41:11,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:41:11,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:11,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:41:11,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:11,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-10-16 23:41:11,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:11,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2024-10-16 23:41:11,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-10-16 23:41:11,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-10-16 23:41:11,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:41:12,083 WARN L851 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_16 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16))) (or (= (select (select .cse0 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store .cse0 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_14) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) 0)))))) (forall ((v_DerPreprocessor_14 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (not (= c_~top~0 0)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_15 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15))) (or (not (= (select (select (store .cse1 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_14) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) 0)) (= (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| Int)) (or (forall ((v_DerPreprocessor_14 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_14) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) 0))))) is different from false [2024-10-16 23:41:16,585 WARN L851 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_16 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16))) (or (= (select (select .cse0 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store .cse0 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_14) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) 0)))))) (forall ((v_DerPreprocessor_14 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_15 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15))) (or (not (= (select (select (store .cse1 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_14) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) 0)) (= (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| Int)) (or (forall ((v_DerPreprocessor_14 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_14) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) 0))))) is different from false [2024-10-16 23:41:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:41:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-10-16 23:41:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-10-16 23:41:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-16 23:41:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-10-16 23:41:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:41:19,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-16 23:41:20,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:41:20,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:41:20,211 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 320 treesize of output 296 [2024-10-16 23:41:20,236 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 534 treesize of output 486 [2024-10-16 23:41:20,265 INFO L85 PathProgramCache]: Analyzing trace with hash 851192968, now seen corresponding path program 1 times [2024-10-16 23:41:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:41:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:41:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:41:20,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:41:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:41:20,426 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 23 treesize of output 19 [2024-10-16 23:41:20,433 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 23 treesize of output 19 [2024-10-16 23:41:20,470 INFO L85 PathProgramCache]: Analyzing trace with hash 765976792, now seen corresponding path program 1 times [2024-10-16 23:41:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:41:20,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:41:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:41:20,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:41:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:41:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:41:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1452260528, now seen corresponding path program 8 times [2024-10-16 23:41:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:41:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326363429] [2024-10-16 23:41:20,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:41:20,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:41:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:41:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:41:20,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:41:20,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326363429] [2024-10-16 23:41:20,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326363429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:41:20,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903986430] [2024-10-16 23:41:20,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-16 23:41:20,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:41:20,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:41:20,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:41:20,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-16 23:41:20,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-16 23:41:20,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:41:20,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-16 23:41:20,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:41:20,821 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-10-16 23:41:20,855 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-16 23:41:20,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-16 23:41:20,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:41:20,899 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-10-16 23:41:20,988 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-16 23:41:20,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-16 23:41:21,006 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-10-16 23:41:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:41:21,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:41:21,087 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_19) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_DerPreprocessor_18 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< c_~next_alloc_idx~0 65))) is different from false [2024-10-16 23:41:21,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:41:21,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-10-16 23:41:21,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:41:21,275 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-16 23:41:21,329 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 414 treesize of output 390 [2024-10-16 23:41:21,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-10-16 23:41:21,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-10-16 23:41:21,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-10-16 23:41:21,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2024-10-16 23:41:21,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-10-16 23:41:21,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2024-10-16 23:41:21,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-10-16 23:41:21,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-10-16 23:41:21,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-10-16 23:41:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:41:21,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903986430] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:41:21,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:41:21,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2024-10-16 23:41:21,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262247270] [2024-10-16 23:41:21,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:41:21,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-16 23:41:21,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:41:21,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-16 23:41:21,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=511, Unknown=2, NotChecked=46, Total=650 [2024-10-16 23:41:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:41:21,766 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:41:21,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:41:21,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:41:25,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:41:28,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:41:41,706 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 [0, 1] [2024-10-16 23:41:50,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-16 23:41:53,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-16 23:41:55,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-16 23:41:58,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-16 23:42:01,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-16 23:42:05,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-16 23:42:15,288 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-10-16 23:42:17,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:42:17,718 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65))) (and (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0)) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (<= 0 (+ c_~next_alloc_idx~0 1)) (<= c_~next_alloc_idx~0 62) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (or (< 0 (select (select (store .cse0 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select .cse0 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0))))) .cse1) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (< 0 (select (select (store .cse2 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select .cse2 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (< 0 (select (select (store .cse3 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0))))) (not (= c_~top~0 0)) (not (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse1 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_7 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (or (< 0 (select (select (store .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_7) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0)) (not (= (+ (select (select .cse4 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_27|) 0) 1) 0)))))))) is different from false [2024-10-16 23:42:21,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:42:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:42:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-10-16 23:42:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2024-10-16 23:42:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:42:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:42:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:42:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-10-16 23:42:23,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-16 23:42:23,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25 [2024-10-16 23:42:23,731 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:42:23,919 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 320 treesize of output 296 [2024-10-16 23:42:23,937 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 276 treesize of output 252 [2024-10-16 23:42:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1192433523, now seen corresponding path program 1 times [2024-10-16 23:42:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:23,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:42:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:24,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 23 treesize of output 19 [2024-10-16 23:42:24,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 23 treesize of output 19 [2024-10-16 23:42:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1851608221, now seen corresponding path program 1 times [2024-10-16 23:42:26,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:26,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:42:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:26,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:42:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash -510815486, now seen corresponding path program 9 times [2024-10-16 23:42:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:42:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914674546] [2024-10-16 23:42:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:42:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:42:26,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:42:26,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914674546] [2024-10-16 23:42:26,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914674546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:42:26,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:42:26,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-16 23:42:26,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796808393] [2024-10-16 23:42:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:42:26,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-16 23:42:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:42:26,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-16 23:42:26,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-16 23:42:26,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:42:26,426 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:42:26,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 147 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-10-16 23:42:26,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:42:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:42:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-10-16 23:42:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2024-10-16 23:42:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:42:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:42:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:42:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-10-16 23:42:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-16 23:42:31,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-10-16 23:42:31,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:42:31,654 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 320 treesize of output 296 [2024-10-16 23:42:31,678 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 570 treesize of output 522 [2024-10-16 23:42:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1192433701, now seen corresponding path program 1 times [2024-10-16 23:42:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:31,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:42:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:31,810 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 23 treesize of output 19 [2024-10-16 23:42:31,815 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 23 treesize of output 19 [2024-10-16 23:42:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1851608043, now seen corresponding path program 1 times [2024-10-16 23:42:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:33,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:33,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:42:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:33,914 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-16 23:42:33,914 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 35 treesize of output 19 [2024-10-16 23:42:33,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2024-10-16 23:42:33,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2024-10-16 23:42:33,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2024-10-16 23:42:34,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1260 treesize of output 1212 [2024-10-16 23:42:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1090401303, now seen corresponding path program 1 times [2024-10-16 23:42:34,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:42:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:42:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:42:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:42:34,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 23:42:34,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 23:42:34,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-16 23:42:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:42:34,148 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:42:34,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:42:34,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 147 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-16 23:42:34,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-16 23:42:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:42:36,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32 [2024-10-16 23:42:36,741 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:42:36,900 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 320 treesize of output 296 [2024-10-16 23:42:36,915 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 570 treesize of output 522 [2024-10-16 23:42:36,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1192433746, now seen corresponding path program 1 times [2024-10-16 23:42:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:36,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:36,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:42:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:37,057 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 23 treesize of output 19 [2024-10-16 23:42:37,064 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 23 treesize of output 19 [2024-10-16 23:42:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1851607998, now seen corresponding path program 1 times [2024-10-16 23:42:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:39,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:42:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:39,179 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-16 23:42:39,179 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 39 treesize of output 31 [2024-10-16 23:42:39,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 202 [2024-10-16 23:42:39,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 202 [2024-10-16 23:42:39,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 202 [2024-10-16 23:42:39,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 673 treesize of output 649 [2024-10-16 23:42:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash 93137460, now seen corresponding path program 1 times [2024-10-16 23:42:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:41,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:42:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:41,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:42:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1340353532, now seen corresponding path program 1 times [2024-10-16 23:42:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:42:41,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365665429] [2024-10-16 23:42:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:42:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:42:41,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:42:41,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365665429] [2024-10-16 23:42:41,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365665429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:42:41,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:42:41,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-16 23:42:41,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048417171] [2024-10-16 23:42:41,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:42:41,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-16 23:42:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:42:41,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-16 23:42:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-16 23:42:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:42:41,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:42:41,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 147 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:42:41,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-16 23:42:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:42:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-16 23:42:46,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36 [2024-10-16 23:42:46,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:42:47,283 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 320 treesize of output 296 [2024-10-16 23:42:47,301 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 276 treesize of output 252 [2024-10-16 23:42:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1192433933, now seen corresponding path program 1 times [2024-10-16 23:42:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:47,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:42:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:47,451 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 23 treesize of output 19 [2024-10-16 23:42:47,456 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 23 treesize of output 19 [2024-10-16 23:42:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1851607811, now seen corresponding path program 1 times [2024-10-16 23:42:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:49,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:42:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:42:49,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:42:49,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1716241379, now seen corresponding path program 1 times [2024-10-16 23:42:49,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:42:49,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76124087] [2024-10-16 23:42:49,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:42:49,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:42:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:42:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:42:49,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:42:49,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76124087] [2024-10-16 23:42:49,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76124087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:42:49,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:42:49,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-16 23:42:49,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292788156] [2024-10-16 23:42:49,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:42:49,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-16 23:42:49,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:42:49,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-16 23:42:49,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-16 23:42:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:42:49,718 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:42:49,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 147 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-16 23:42:49,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:43:00,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:43:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:43:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-10-16 23:43:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-10-16 23:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-16 23:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-10-16 23:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-16 23:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-16 23:43:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-16 23:43:02,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-10-16 23:43:02,758 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:43:02,853 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 23 treesize of output 19 [2024-10-16 23:43:02,859 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 23 treesize of output 19 [2024-10-16 23:43:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1689361030, now seen corresponding path program 1 times [2024-10-16 23:43:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:43:04,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:43:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:04,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:43:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:04,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:43:04,917 INFO L85 PathProgramCache]: Analyzing trace with hash 6468098, now seen corresponding path program 10 times [2024-10-16 23:43:04,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:43:04,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235459421] [2024-10-16 23:43:04,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:43:04,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:43:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:43:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:43:05,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:43:05,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235459421] [2024-10-16 23:43:05,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235459421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:43:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:43:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-16 23:43:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901320919] [2024-10-16 23:43:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:43:05,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-16 23:43:05,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:43:05,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-16 23:43:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-16 23:43:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:43:05,199 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:43:05,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 149 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-16 23:43:05,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:43:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-16 23:43:17,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-16 23:43:17,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-16 23:43:17,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41 [2024-10-16 23:43:17,620 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:43:17,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:43:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1406328192, now seen corresponding path program 11 times [2024-10-16 23:43:17,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:43:17,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401651741] [2024-10-16 23:43:17,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:43:17,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:43:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:43:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:43:17,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:43:17,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401651741] [2024-10-16 23:43:17,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401651741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:43:17,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138936688] [2024-10-16 23:43:17,984 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-16 23:43:17,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:43:17,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:43:17,986 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:43:17,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-16 23:43:18,129 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-16 23:43:18,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:43:18,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-16 23:43:18,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:43:18,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:43:18,171 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-10-16 23:43:18,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:43:18,247 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:43:18,247 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 11 treesize of output 11 [2024-10-16 23:43:18,270 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-10-16 23:43:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:43:18,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:43:18,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-16 23:43:18,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:43:18,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:43:18,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:43:18,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-16 23:43:18,754 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 23:43:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:43:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138936688] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:43:18,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:43:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2024-10-16 23:43:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373351512] [2024-10-16 23:43:18,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:43:18,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-16 23:43:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:43:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-16 23:43:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=551, Unknown=6, NotChecked=0, Total=650 [2024-10-16 23:43:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:43:18,813 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:43:18,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:43:18,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:18,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:43:18,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:18,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 156 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-16 23:43:18,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-16 23:43:18,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:43:38,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-16 23:43:42,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-16 23:43:44,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-16 23:43:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:43:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-10-16 23:43:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-10-16 23:43:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-16 23:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-10-16 23:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-16 23:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-16 23:43:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-16 23:43:48,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-16 23:43:48,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:43:48,659 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:43:48,841 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 658 treesize of output 610 [2024-10-16 23:43:48,866 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 1086 treesize of output 990 [2024-10-16 23:43:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1074908327, now seen corresponding path program 1 times [2024-10-16 23:43:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:43:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:43:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:48,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:43:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:49,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 280 [2024-10-16 23:43:49,054 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 23:43:49,065 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 10 treesize of output 6 [2024-10-16 23:43:49,068 INFO L85 PathProgramCache]: Analyzing trace with hash -35101521, now seen corresponding path program 1 times [2024-10-16 23:43:49,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:43:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:43:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:49,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:43:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:49,193 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 23 treesize of output 19 [2024-10-16 23:43:49,200 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 23 treesize of output 19 [2024-10-16 23:43:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash 622217581, now seen corresponding path program 1 times [2024-10-16 23:43:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:43:51,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:43:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:51,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:43:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:51,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:43:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash 980489632, now seen corresponding path program 12 times [2024-10-16 23:43:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:43:51,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609217843] [2024-10-16 23:43:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:43:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:43:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:43:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-16 23:43:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:43:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609217843] [2024-10-16 23:43:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609217843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:43:51,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:43:51,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-16 23:43:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553255444] [2024-10-16 23:43:51,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:43:51,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-16 23:43:51,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:43:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-16 23:43:51,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-16 23:43:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:43:51,517 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:43:51,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:43:51,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:51,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:43:51,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:51,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-10-16 23:43:51,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:51,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2024-10-16 23:43:51,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-10-16 23:43:51,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:43:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-16 23:43:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:43:57,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46 [2024-10-16 23:43:57,805 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:43:57,962 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 570 treesize of output 522 [2024-10-16 23:43:57,987 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 1262 treesize of output 1166 [2024-10-16 23:43:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1074908100, now seen corresponding path program 1 times [2024-10-16 23:43:58,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:43:58,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:43:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:58,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:43:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:58,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 17 [2024-10-16 23:43:58,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 135 [2024-10-16 23:43:58,204 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 10 treesize of output 6 [2024-10-16 23:43:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash -35101294, now seen corresponding path program 1 times [2024-10-16 23:43:58,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:43:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:43:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:58,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:43:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:43:58,321 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 23 treesize of output 19 [2024-10-16 23:43:58,327 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 23 treesize of output 19 [2024-10-16 23:44:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash 622217808, now seen corresponding path program 1 times [2024-10-16 23:44:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:00,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:00,422 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-16 23:44:00,423 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 35 treesize of output 19 [2024-10-16 23:44:00,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2024-10-16 23:44:00,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2024-10-16 23:44:00,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2024-10-16 23:44:00,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 298 [2024-10-16 23:44:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash -750180056, now seen corresponding path program 1 times [2024-10-16 23:44:00,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:00,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:44:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:44:00,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 23:44:00,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 23:44:00,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-16 23:44:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:00,575 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:00,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:44:00,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:44:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-16 23:44:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-16 23:44:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-10-16 23:44:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:00,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:44:02,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-10-16 23:44:02,989 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:44:03,165 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 320 treesize of output 296 [2024-10-16 23:44:03,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 1086 treesize of output 990 [2024-10-16 23:44:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1074908076, now seen corresponding path program 1 times [2024-10-16 23:44:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:03,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:03,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 17 [2024-10-16 23:44:03,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 226 [2024-10-16 23:44:03,372 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 10 treesize of output 6 [2024-10-16 23:44:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash -35101270, now seen corresponding path program 1 times [2024-10-16 23:44:03,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:03,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:03,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:03,502 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 23 treesize of output 19 [2024-10-16 23:44:03,512 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 23 treesize of output 19 [2024-10-16 23:44:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash 622217832, now seen corresponding path program 1 times [2024-10-16 23:44:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:05,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:05,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 104142081, now seen corresponding path program 2 times [2024-10-16 23:44:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361535617] [2024-10-16 23:44:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-16 23:44:05,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:44:05,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361535617] [2024-10-16 23:44:05,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361535617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:44:05,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:44:05,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-16 23:44:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717977642] [2024-10-16 23:44:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:44:05,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-16 23:44:05,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:44:05,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-16 23:44:05,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-16 23:44:05,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:05,737 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:05,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:44:05,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-16 23:44:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-10-16 23:44:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2024-10-16 23:44:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-16 23:44:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-10-16 23:44:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:44:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:44:13,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-16 23:44:13,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55 [2024-10-16 23:44:13,271 INFO L414 BasicCegarLoop]: Path program histogram: [12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-16 23:44:13,272 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE (1/4) [2024-10-16 23:44:13,273 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:44:13,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:44:13,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:44:13,274 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:44:13,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-10-16 23:44:13,307 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:44:13,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:13,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-16 23:44:13,308 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6296d9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:44:13,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:44:15,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:44:15,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 293002407, now seen corresponding path program 1 times [2024-10-16 23:44:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:15,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367732390] [2024-10-16 23:44:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-16 23:44:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:44:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367732390] [2024-10-16 23:44:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367732390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:44:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:44:15,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:44:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612949193] [2024-10-16 23:44:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:44:15,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:44:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:44:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:44:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:44:15,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:15,427 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:15,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:15,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:16,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-16 23:44:16,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:44:16,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash -783856429, now seen corresponding path program 1 times [2024-10-16 23:44:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232203666] [2024-10-16 23:44:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:16,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-16 23:44:16,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:44:16,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232203666] [2024-10-16 23:44:16,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232203666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:44:16,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:44:16,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-16 23:44:16,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19723442] [2024-10-16 23:44:16,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:44:16,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-16 23:44:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:44:16,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-16 23:44:16,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-16 23:44:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:16,836 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:16,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:16,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:16,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:17,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-16 23:44:17,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:44:17,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -14040252, now seen corresponding path program 1 times [2024-10-16 23:44:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:17,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910626199] [2024-10-16 23:44:17,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:17,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:17,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-16 23:44:17,061 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-16 23:44:17,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-16 23:44:17,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-10-16 23:44:17,062 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-16 23:44:17,062 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-10-16 23:44:17,062 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-16 23:44:17,062 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-16 23:44:17,079 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-16 23:44:17,082 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:44:17,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:44:17,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:44:17,084 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:44:17,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-10-16 23:44:17,119 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:44:17,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:17,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-10-16 23:44:17,121 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6296d9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:44:17,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:44:19,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:44:19,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:19,881 INFO L85 PathProgramCache]: Analyzing trace with hash -280527570, now seen corresponding path program 1 times [2024-10-16 23:44:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005359568] [2024-10-16 23:44:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:19,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:44:19,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:44:19,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005359568] [2024-10-16 23:44:19,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005359568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:44:19,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:44:19,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:44:19,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775604344] [2024-10-16 23:44:19,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:44:19,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:44:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:44:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:44:19,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:44:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:19,916 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:19,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:19,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:21,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-10-16 23:44:21,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:44:21,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash -610232887, now seen corresponding path program 1 times [2024-10-16 23:44:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335788382] [2024-10-16 23:44:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-16 23:44:21,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:44:21,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335788382] [2024-10-16 23:44:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335788382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:44:21,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:44:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-16 23:44:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085454204] [2024-10-16 23:44:21,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:44:21,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-16 23:44:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:44:21,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-16 23:44:21,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-16 23:44:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:21,489 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:21,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:21,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:21,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:25,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-10-16 23:44:25,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:44:25,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2102811602, now seen corresponding path program 1 times [2024-10-16 23:44:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:25,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86579971] [2024-10-16 23:44:25,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:25,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-16 23:44:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:44:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86579971] [2024-10-16 23:44:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86579971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:44:25,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:44:25,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:44:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177053243] [2024-10-16 23:44:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:44:25,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:44:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:44:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:44:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:44:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:25,090 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:25,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:25,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:25,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:25,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:27,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:27,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:27,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:27,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-16 23:44:27,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:44:27,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:27,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1627418400, now seen corresponding path program 1 times [2024-10-16 23:44:27,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:27,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869083081] [2024-10-16 23:44:27,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:27,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-16 23:44:27,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:44:27,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869083081] [2024-10-16 23:44:27,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869083081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:44:27,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 23:44:27,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-16 23:44:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173317799] [2024-10-16 23:44:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:44:27,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:44:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:44:27,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:44:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 23:44:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:27,945 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:27,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:27,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:27,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:27,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:27,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:30,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-16 23:44:30,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:44:30,830 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 23 treesize of output 19 [2024-10-16 23:44:30,835 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 23 treesize of output 19 [2024-10-16 23:44:32,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1558278178, now seen corresponding path program 1 times [2024-10-16 23:44:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:32,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:32,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:32,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:32,893 INFO L85 PathProgramCache]: Analyzing trace with hash -237791405, now seen corresponding path program 1 times [2024-10-16 23:44:32,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:32,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906759827] [2024-10-16 23:44:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:44:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:44:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906759827] [2024-10-16 23:44:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906759827] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:44:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927636375] [2024-10-16 23:44:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:33,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:44:33,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:44:33,098 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:44:33,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-16 23:44:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:33,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-16 23:44:33,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:44:33,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:44:33,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:44:33,308 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-10-16 23:44:33,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:44:33,365 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:44:33,365 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 11 treesize of output 11 [2024-10-16 23:44:33,380 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-10-16 23:44:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:44:33,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:44:33,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:44:33,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-16 23:44:33,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:44:34,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:44:34,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-16 23:44:34,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 23:44:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:44:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927636375] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:44:34,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:44:34,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2024-10-16 23:44:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038379639] [2024-10-16 23:44:34,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:44:34,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-16 23:44:34,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:44:34,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-16 23:44:34,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=696, Unknown=4, NotChecked=0, Total=812 [2024-10-16 23:44:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:34,477 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:34,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.896551724137931) internal successors, (142), 28 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:34,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:34,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:34,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:34,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:34,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-10-16 23:44:49,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-16 23:44:49,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:44:49,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:44:49,347 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:44:49,347 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 1 case distinctions, treesize of input 426 treesize of output 392 [2024-10-16 23:44:49,366 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 10 treesize of output 6 [2024-10-16 23:44:49,369 INFO L85 PathProgramCache]: Analyzing trace with hash 636504294, now seen corresponding path program 1 times [2024-10-16 23:44:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:49,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:49,481 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 23 treesize of output 19 [2024-10-16 23:44:49,487 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 23 treesize of output 19 [2024-10-16 23:44:51,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1042481409, now seen corresponding path program 1 times [2024-10-16 23:44:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:51,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:51,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:44:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1253256626, now seen corresponding path program 2 times [2024-10-16 23:44:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:44:51,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208869148] [2024-10-16 23:44:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:51,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:44:51,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:44:51,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208869148] [2024-10-16 23:44:51,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208869148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:44:51,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294272952] [2024-10-16 23:44:51,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-16 23:44:51,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:44:51,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:44:51,864 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:44:51,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-16 23:44:52,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-16 23:44:52,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:44:52,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-16 23:44:52,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:44:52,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2024-10-16 23:44:52,050 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 16 treesize of output 5 [2024-10-16 23:44:52,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-16 23:44:52,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-16 23:44:52,123 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-10-16 23:44:52,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 96 [2024-10-16 23:44:52,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-16 23:44:52,186 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-16 23:44:52,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2024-10-16 23:44:52,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:44:52,203 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 49 treesize of output 49 [2024-10-16 23:44:52,611 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 23 treesize of output 11 [2024-10-16 23:44:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-16 23:44:52,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 23:44:52,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294272952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:44:52,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-16 23:44:52,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 23 [2024-10-16 23:44:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631589233] [2024-10-16 23:44:52,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:44:52,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-16 23:44:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:44:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-16 23:44:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-10-16 23:44:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:52,633 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:52,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:52,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:52,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:52,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:52,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:52,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-10-16 23:44:52,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-10-16 23:44:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-16 23:44:55,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-16 23:44:55,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:44:55,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:44:55,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:44:55,939 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 1 case distinctions, treesize of input 310 treesize of output 288 [2024-10-16 23:44:55,953 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 10 treesize of output 6 [2024-10-16 23:44:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 636504402, now seen corresponding path program 1 times [2024-10-16 23:44:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:55,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:56,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 23 treesize of output 19 [2024-10-16 23:44:56,062 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 23 treesize of output 19 [2024-10-16 23:44:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1042481517, now seen corresponding path program 1 times [2024-10-16 23:44:56,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:56,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:56,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:56,162 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-16 23:44:56,162 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 35 treesize of output 19 [2024-10-16 23:44:56,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2024-10-16 23:44:56,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2024-10-16 23:44:56,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 366 [2024-10-16 23:44:56,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1260 treesize of output 1212 [2024-10-16 23:44:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash -383874678, now seen corresponding path program 1 times [2024-10-16 23:44:56,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:44:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:44:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:44:56,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 23:44:56,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 23:44:56,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-16 23:44:56,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:56,314 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:44:56,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:44:56,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:56,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:56,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:56,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:56,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-10-16 23:44:56,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-16 23:44:56,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:44:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:44:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-10-16 23:44:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-16 23:44:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:44:57,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2024-10-16 23:44:57,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:44:57,303 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:44:57,303 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 1 case distinctions, treesize of input 153 treesize of output 143 [2024-10-16 23:44:57,316 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 10 treesize of output 6 [2024-10-16 23:44:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash 636504453, now seen corresponding path program 1 times [2024-10-16 23:44:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:44:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:44:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:57,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:44:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:44:57,447 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-10-16 23:44:57,454 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-10-16 23:45:01,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-16 23:45:05,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2042853797, now seen corresponding path program 1 times [2024-10-16 23:45:05,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:05,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:05,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:45:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:05,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:45:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash -591839154, now seen corresponding path program 3 times [2024-10-16 23:45:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:45:05,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275680869] [2024-10-16 23:45:05,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:45:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:45:05,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:45:05,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275680869] [2024-10-16 23:45:05,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275680869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:45:05,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805170895] [2024-10-16 23:45:05,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-16 23:45:05,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:45:05,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:45:05,884 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:45:05,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-16 23:45:06,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-16 23:45:06,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:45:06,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-16 23:45:06,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:45:06,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2024-10-16 23:45:06,045 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 12 treesize of output 1 [2024-10-16 23:45:06,058 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 16 treesize of output 5 [2024-10-16 23:45:06,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-16 23:45:06,135 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-10-16 23:45:06,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 89 [2024-10-16 23:45:06,172 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-16 23:45:06,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2024-10-16 23:45:06,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-16 23:45:06,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:45:06,188 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 15 treesize of output 19 [2024-10-16 23:45:06,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-16 23:45:06,389 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 23 treesize of output 11 [2024-10-16 23:45:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-16 23:45:06,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 23:45:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805170895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:45:06,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-16 23:45:06,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-10-16 23:45:06,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321859466] [2024-10-16 23:45:06,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:45:06,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-16 23:45:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:45:06,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-16 23:45:06,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-10-16 23:45:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:45:06,413 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:45:06,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:45:06,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:06,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:06,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:06,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:06,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2024-10-16 23:45:06,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-16 23:45:06,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:06,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:45:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:45:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:10,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-16 23:45:10,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74 [2024-10-16 23:45:10,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:45:10,886 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:45:10,886 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 1 case distinctions, treesize of input 252 treesize of output 234 [2024-10-16 23:45:10,900 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 10 treesize of output 6 [2024-10-16 23:45:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1738348752, now seen corresponding path program 1 times [2024-10-16 23:45:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:10,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:10,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:45:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:11,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 280 [2024-10-16 23:45:11,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 23:45:11,064 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 10 treesize of output 6 [2024-10-16 23:45:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1945811833, now seen corresponding path program 1 times [2024-10-16 23:45:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:11,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:45:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:11,201 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 23 treesize of output 19 [2024-10-16 23:45:11,208 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 23 treesize of output 19 [2024-10-16 23:45:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1446606961, now seen corresponding path program 1 times [2024-10-16 23:45:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:13,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:45:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:13,470 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-16 23:45:13,471 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 35 treesize of output 19 [2024-10-16 23:45:13,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 357 [2024-10-16 23:45:13,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 357 [2024-10-16 23:45:13,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 357 [2024-10-16 23:45:13,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1260 treesize of output 1212 [2024-10-16 23:45:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash 118057998, now seen corresponding path program 1 times [2024-10-16 23:45:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:45:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:45:13,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:13,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:45:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:45:13,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 23:45:13,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 23:45:13,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-16 23:45:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:45:13,666 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:45:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:45:13,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:13,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:13,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:13,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:13,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:45:13,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:13,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:13,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:13,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:45:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:45:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:17,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79 [2024-10-16 23:45:17,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:45:17,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:45:17,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1172182194, now seen corresponding path program 2 times [2024-10-16 23:45:17,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:45:17,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289057180] [2024-10-16 23:45:17,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:17,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:45:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:45:17,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:45:17,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289057180] [2024-10-16 23:45:17,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289057180] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:45:17,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440297614] [2024-10-16 23:45:17,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-16 23:45:17,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:45:17,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:45:17,661 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:45:17,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-16 23:45:17,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-16 23:45:17,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:45:17,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-16 23:45:17,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:45:17,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:45:17,857 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-10-16 23:45:17,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:45:17,911 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:45:17,911 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 11 treesize of output 11 [2024-10-16 23:45:17,928 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-10-16 23:45:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:45:17,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:45:17,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_37 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_37) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2024-10-16 23:45:18,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:45:18,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:45:18,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:45:18,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-16 23:45:18,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:45:18,236 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 1 case distinctions, treesize of input 21 treesize of output 22 [2024-10-16 23:45:18,238 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 23:45:18,238 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 19 treesize of output 11 [2024-10-16 23:45:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:45:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440297614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:45:18,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:45:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2024-10-16 23:45:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373489802] [2024-10-16 23:45:18,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:45:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-16 23:45:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:45:18,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-16 23:45:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=512, Unknown=2, NotChecked=46, Total=650 [2024-10-16 23:45:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:45:18,268 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:45:18,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:18,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:45:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-10-16 23:45:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:45:36,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-16 23:45:36,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:45:36,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:45:36,968 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 23 treesize of output 19 [2024-10-16 23:45:36,974 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 23 treesize of output 19 [2024-10-16 23:45:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1698594147, now seen corresponding path program 1 times [2024-10-16 23:45:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:39,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:45:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:45:39,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:45:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash -685848352, now seen corresponding path program 4 times [2024-10-16 23:45:39,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:45:39,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808020712] [2024-10-16 23:45:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:45:39,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:45:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:45:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:45:39,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:45:39,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808020712] [2024-10-16 23:45:39,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808020712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:45:39,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11648393] [2024-10-16 23:45:39,316 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-16 23:45:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:45:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:45:39,317 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:45:39,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-16 23:45:39,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-16 23:45:39,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:45:39,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-16 23:45:39,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:45:39,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:45:39,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:45:39,710 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-10-16 23:45:39,710 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 1 case distinctions, treesize of input 19 treesize of output 26 [2024-10-16 23:45:39,768 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-16 23:45:39,768 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 1 case distinctions, treesize of input 19 treesize of output 22 [2024-10-16 23:45:39,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:45:39,965 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 31 treesize of output 23 [2024-10-16 23:45:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:45:39,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:45:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:45:40,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11648393] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:45:40,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:45:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 12] total 38 [2024-10-16 23:45:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751384036] [2024-10-16 23:45:40,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:45:40,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-16 23:45:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:45:40,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-16 23:45:40,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1168, Unknown=1, NotChecked=0, Total=1406 [2024-10-16 23:45:40,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:45:40,614 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:45:40,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.9210526315789473) internal successors, (149), 38 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:45:40,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:40,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:40,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:40,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:45:40,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-10-16 23:45:40,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:45:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:45:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:45:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:46:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:46:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-10-16 23:46:28,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-16 23:46:28,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:46:28,523 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:46:28,611 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 23 treesize of output 19 [2024-10-16 23:46:28,616 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 23 treesize of output 19 [2024-10-16 23:46:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash -649575611, now seen corresponding path program 1 times [2024-10-16 23:46:28,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:46:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:46:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:46:28,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:46:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:46:28,709 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-16 23:46:28,709 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 35 treesize of output 19 [2024-10-16 23:46:28,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 772 treesize of output 724 [2024-10-16 23:46:28,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 772 treesize of output 724 [2024-10-16 23:46:28,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 772 treesize of output 724 [2024-10-16 23:46:28,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 621 treesize of output 597 [2024-10-16 23:46:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1518832676, now seen corresponding path program 1 times [2024-10-16 23:46:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:46:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:46:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:46:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:46:28,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:46:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:46:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:46:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:46:28,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 23:46:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 23:46:28,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-16 23:46:28,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:46:28,883 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:46:28,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2024-10-16 23:46:28,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:46:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2024-10-16 23:46:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:46:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:46:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:46:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-10-16 23:46:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:31,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85 [2024-10-16 23:46:31,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:46:31,479 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 23 treesize of output 19 [2024-10-16 23:46:31,485 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 23 treesize of output 19 [2024-10-16 23:46:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash -649575571, now seen corresponding path program 1 times [2024-10-16 23:46:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:46:33,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:46:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:46:33,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:46:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:46:33,591 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-16 23:46:33,591 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 39 treesize of output 31 [2024-10-16 23:46:33,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 884 treesize of output 836 [2024-10-16 23:46:33,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 884 treesize of output 836 [2024-10-16 23:46:33,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 884 treesize of output 836 [2024-10-16 23:46:33,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 322 [2024-10-16 23:46:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1518832716, now seen corresponding path program 1 times [2024-10-16 23:46:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:46:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:46:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:46:35,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:46:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:46:35,788 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-16 23:46:35,788 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 39 treesize of output 31 [2024-10-16 23:46:35,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 904 treesize of output 856 [2024-10-16 23:46:35,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 904 treesize of output 856 [2024-10-16 23:46:35,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 904 treesize of output 856 [2024-10-16 23:46:36,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1372 treesize of output 1324 [2024-10-16 23:46:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash -160924813, now seen corresponding path program 1 times [2024-10-16 23:46:38,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:46:38,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:46:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:46:38,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:46:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:46:38,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:46:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1207035414, now seen corresponding path program 5 times [2024-10-16 23:46:38,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:46:38,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144767562] [2024-10-16 23:46:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:46:38,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:46:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:46:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:46:38,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:46:38,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144767562] [2024-10-16 23:46:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144767562] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:46:38,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494276805] [2024-10-16 23:46:38,372 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-16 23:46:38,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:46:38,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:46:38,373 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:46:38,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-16 23:46:38,565 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-16 23:46:38,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 23:46:38,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-16 23:46:38,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:46:38,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:46:38,600 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-10-16 23:46:38,630 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-16 23:46:38,630 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-10-16 23:46:38,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:46:38,707 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-16 23:46:38,708 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-10-16 23:46:38,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-16 23:46:38,752 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-10-16 23:46:38,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-16 23:46:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:46:38,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:46:38,943 WARN L851 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_ArrVal_3433 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_3433 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_3433 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int))) (or (< v_ArrVal_3433 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-10-16 23:46:41,267 WARN L851 $PredicateComparison]: unable to prove that (and (or (and (or (< c_~next_alloc_idx~0 63) (forall ((v_prenex_249 Int) (v_prenex_251 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (v_prenex_250 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| 1) v_prenex_249) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) v_prenex_249 v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_251) v_prenex_249) v_prenex_250))))) (or (< 62 c_~next_alloc_idx~0) (let ((.cse0 (+ c_~next_alloc_idx~0 2))) (and (or (< 60 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_ArrVal_3433 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (or (< v_ArrVal_3433 .cse0) (not (= (select (store |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| 1) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((v_prenex_248 Int) (v_prenex_246 Int) (v_prenex_247 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (< v_prenex_247 .cse0) (not (= (select (store |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| 1) v_prenex_246) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) v_prenex_246 (store (select |c_#memory_int| v_prenex_246) v_prenex_248 v_prenex_247)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_246) v_prenex_248)))) (< c_~next_alloc_idx~0 61)))))) (< 64 c_~next_alloc_idx~0)) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| 1) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2024-10-16 23:46:41,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-16 23:46:41,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-16 23:46:41,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-16 23:46:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-16 23:46:41,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:46:41,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-16 23:46:41,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 23:46:41,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 23:46:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 9 not checked. [2024-10-16 23:46:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494276805] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:46:41,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:46:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 30 [2024-10-16 23:46:41,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792288671] [2024-10-16 23:46:41,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:46:41,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-16 23:46:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:46:41,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-16 23:46:41,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=693, Unknown=17, NotChecked=110, Total=930 [2024-10-16 23:46:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:46:41,997 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:46:41,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 30 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:41,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-10-16 23:46:41,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2024-10-16 23:46:41,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:46:41,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:46:42,431 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65)) (.cse5 (< 62 c_~next_alloc_idx~0)) (.cse3 (+ c_~next_alloc_idx~0 2)) (.cse4 (< c_~next_alloc_idx~0 63)) (.cse2 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (and (forall ((v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (v_ArrVal_3433 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< v_ArrVal_3433 .cse3) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or .cse4 (forall ((v_prenex_249 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (v_prenex_251 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (v_prenex_250 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_249) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) v_prenex_249 v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_251) v_prenex_249) v_prenex_250)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_prenex_249)))))) (or .cse0 (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (not (= c_~top~0 0)) (or (and (or .cse5 (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_ArrVal_3433 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_3433 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse4 (forall ((v_ArrVal_3433 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int))) (or (< v_ArrVal_3433 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse2) (or (forall ((|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or (and (or .cse5 (and (or (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_ArrVal_3433 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) 0)) (< v_ArrVal_3433 .cse3) (< 0 (select (select (store (let ((.cse6 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_46))) (store .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433))) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (< 60 c_~next_alloc_idx~0)) (or (forall ((v_prenex_248 Int) (v_prenex_246 Int) (v_prenex_247 Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (< 0 (select (select (store (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_46))) (store .cse7 v_prenex_246 (store (select .cse7 v_prenex_246) v_prenex_248 v_prenex_247))) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_246) v_prenex_248)) (not (= (select |c_#valid| v_prenex_246) 0)) (< v_prenex_247 .cse3))) (< c_~next_alloc_idx~0 61)))) (or .cse4 (forall ((v_prenex_249 Int) (v_prenex_251 (Array Int Int)) (v_prenex_250 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (not (= (select |c_#valid| v_prenex_249) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_46) v_prenex_249 v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_251) v_prenex_249) v_prenex_250)))))) .cse2))) is different from false [2024-10-16 23:46:44,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:46:48,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:46:50,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:46:52,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:46:56,645 WARN L851 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (v_ArrVal_3433 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< v_ArrVal_3433 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (< c_~next_alloc_idx~0 63) (forall ((v_prenex_249 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (v_prenex_251 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (v_prenex_250 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_249) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) v_prenex_249 v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_251) v_prenex_249) v_prenex_250)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_prenex_249)))))) (not (= c_~top~0 0)) (or (forall ((|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65))) is different from false [2024-10-16 23:46:57,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (forall ((v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (v_ArrVal_3433 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< v_ArrVal_3433 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or .cse1 (forall ((v_prenex_249 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (v_prenex_251 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (v_prenex_250 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_249) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) v_prenex_249 v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_251) v_prenex_249) v_prenex_250)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_prenex_249)))))) (or .cse0 (and (or .cse1 (forall ((v_ArrVal_3433 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) 0)) (< v_ArrVal_3433 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_ArrVal_3433 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) 0)) (< v_ArrVal_3433 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) (not (= c_~top~0 0)) (or (forall ((|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse2) (or .cse2 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-10-16 23:46:59,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65)) (.cse5 (< 62 c_~next_alloc_idx~0)) (.cse3 (+ c_~next_alloc_idx~0 2)) (.cse4 (< c_~next_alloc_idx~0 63)) (.cse2 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (and (forall ((v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (v_ArrVal_3433 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< v_ArrVal_3433 .cse3) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or .cse4 (forall ((v_prenex_249 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (v_prenex_251 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (v_prenex_250 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_249) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) v_prenex_249 v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_251) v_prenex_249) v_prenex_250)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_prenex_249)))))) (or .cse0 (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (and (or .cse5 (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_ArrVal_3433 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_3433 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse4 (forall ((v_ArrVal_3433 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int))) (or (< v_ArrVal_3433 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse2) (or (forall ((|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or (and (or .cse5 (and (or (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_ArrVal_3433 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) 0)) (< v_ArrVal_3433 .cse3) (< 0 (select (select (store (let ((.cse6 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_46))) (store .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433))) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (< 60 c_~next_alloc_idx~0)) (or (forall ((v_prenex_248 Int) (v_prenex_246 Int) (v_prenex_247 Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (< 0 (select (select (store (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_46))) (store .cse7 v_prenex_246 (store (select .cse7 v_prenex_246) v_prenex_248 v_prenex_247))) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_246) v_prenex_248)) (not (= (select |c_#valid| v_prenex_246) 0)) (< v_prenex_247 .cse3))) (< c_~next_alloc_idx~0 61)))) (or .cse4 (forall ((v_prenex_249 Int) (v_prenex_251 (Array Int Int)) (v_prenex_250 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (not (= (select |c_#valid| v_prenex_249) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_46) v_prenex_249 v_DerPreprocessor_45) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_251) v_prenex_249) v_prenex_250)))))) .cse2))) is different from false [2024-10-16 23:47:08,783 WARN L851 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (v_ArrVal_3433 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< v_ArrVal_3433 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3433)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (< c_~next_alloc_idx~0 63) (forall ((v_prenex_249 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (v_prenex_251 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (v_prenex_250 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_249) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_46) v_prenex_249 v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_prenex_251) v_prenex_249) v_prenex_250)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_prenex_249)))))) (or (not (= (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) (and (= |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) (= |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) (= |c_thr1Thread2of4ForFork0_push_#t~mem1#1| 0))) (not (= c_~top~0 0)) (or (forall ((|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_47| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45| v_DerPreprocessor_45) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_55| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_45|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65))) is different from false [2024-10-16 23:47:11,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:13,425 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-10-16 23:47:15,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:17,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:19,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:21,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:23,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:25,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:31,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:33,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:35,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:37,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:40,084 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-10-16 23:47:42,132 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-10-16 23:47:44,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:46,212 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-10-16 23:47:48,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:50,289 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-10-16 23:47:52,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:54,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:56,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:47:58,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:00,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:02,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:04,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:06,625 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-10-16 23:48:08,659 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-10-16 23:48:10,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:15,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:17,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:19,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:21,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:23,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:25,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:27,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:29,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:31,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:35,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:37,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:41,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:48:44,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-16 23:49:12,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:49:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2024-10-16 23:49:12,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-10-16 23:49:12,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:49:12,980 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:49:13,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 17 [2024-10-16 23:49:13,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 384 [2024-10-16 23:49:13,129 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 10 treesize of output 6 [2024-10-16 23:49:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1094003999, now seen corresponding path program 1 times [2024-10-16 23:49:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:49:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:49:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:49:13,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:49:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:49:13,249 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 23 treesize of output 19 [2024-10-16 23:49:13,260 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 23 treesize of output 19 [2024-10-16 23:49:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash -335662040, now seen corresponding path program 1 times [2024-10-16 23:49:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:49:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:49:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:49:15,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:49:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:49:15,379 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-16 23:49:15,380 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 39 treesize of output 31 [2024-10-16 23:49:15,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 409 [2024-10-16 23:49:15,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 409 [2024-10-16 23:49:15,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 409 [2024-10-16 23:49:15,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 689 treesize of output 665 [2024-10-16 23:49:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash 716220327, now seen corresponding path program 1 times [2024-10-16 23:49:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:49:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:49:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:49:17,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:49:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:49:17,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:49:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash 851963735, now seen corresponding path program 1 times [2024-10-16 23:49:17,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:49:17,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938130841] [2024-10-16 23:49:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:49:17,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:49:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:49:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:49:17,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:49:17,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938130841] [2024-10-16 23:49:17,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938130841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:49:17,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836588936] [2024-10-16 23:49:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:49:17,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:49:17,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:49:17,834 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:49:17,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-16 23:49:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:49:18,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-16 23:49:18,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:49:18,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:49:18,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:49:18,088 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-10-16 23:49:18,120 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:49:18,120 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 11 treesize of output 11 [2024-10-16 23:49:18,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-16 23:49:18,163 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-10-16 23:49:18,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-16 23:49:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:49:18,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:49:18,342 WARN L851 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_3636 Int) (v_DerPreprocessor_50 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_3636 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3636)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_50) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((v_ArrVal_3636 Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3636)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_3636 c_~next_alloc_idx~0))) (< c_~next_alloc_idx~0 63))))) (or (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_51) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65))) is different from false [2024-10-16 23:49:18,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:49:18,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-16 23:49:18,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-16 23:49:19,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:49:19,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-16 23:49:19,279 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 23:49:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 6 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:49:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836588936] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:49:19,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:49:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2024-10-16 23:49:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133925382] [2024-10-16 23:49:19,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:49:19,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-16 23:49:19,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:49:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-16 23:49:19,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=641, Unknown=14, NotChecked=52, Total=812 [2024-10-16 23:49:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:49:19,323 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:49:19,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.689655172413793) internal successors, (136), 28 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 152 states. [2024-10-16 23:49:19,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.