./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9a849f68 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/GemCutterMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 11:01:02,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 11:01:02,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-10-26 11:01:02,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 11:01:02,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 11:01:02,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 11:01:02,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 11:01:02,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 11:01:02,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 11:01:02,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 11:01:02,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 11:01:02,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 11:01:02,869 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 11:01:02,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 11:01:02,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 11:01:02,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 11:01:02,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 11:01:02,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 11:01:02,873 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-26 11:01:02,874 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-26 11:01:02,874 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-26 11:01:02,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 11:01:02,875 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-26 11:01:02,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 11:01:02,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 11:01:02,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 11:01:02,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 11:01:02,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 11:01:02,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 11:01:02,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-26 11:01:02,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 11:01:02,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 11:01:02,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 11:01:02,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 11:01:02,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 11:01:02,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 11:01:02,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 11:01:02,880 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 11:01:02,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 11:01:02,880 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 11:01:02,880 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 11:01:02,881 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2024-10-26 11:01:03,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 11:01:03,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 11:01:03,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 11:01:03,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 11:01:03,152 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 11:01:03,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2024-10-26 11:01:04,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 11:01:04,765 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 11:01:04,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2024-10-26 11:01:04,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8c8db71c1/a2cda960422d4395beeed42db6a7f22b/FLAG73980db0b [2024-10-26 11:01:05,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8c8db71c1/a2cda960422d4395beeed42db6a7f22b [2024-10-26 11:01:05,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 11:01:05,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 11:01:05,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 11:01:05,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 11:01:05,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 11:01:05,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4a8556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05, skipping insertion in model container [2024-10-26 11:01:05,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 11:01:05,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 11:01:05,675 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 11:01:05,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 11:01:05,813 INFO L204 MainTranslator]: Completed translation [2024-10-26 11:01:05,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05 WrapperNode [2024-10-26 11:01:05,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 11:01:05,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 11:01:05,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 11:01:05,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 11:01:05,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,898 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 350 [2024-10-26 11:01:05,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 11:01:05,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 11:01:05,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 11:01:05,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 11:01:05,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 11:01:05,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 11:01:05,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 11:01:05,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 11:01:05,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (1/1) ... [2024-10-26 11:01:05,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 11:01:05,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:06,015 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-26 11:01:06,022 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-26 11:01:06,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-26 11:01:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 11:01:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 11:01:06,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 11:01:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 11:01:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 11:01:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 11:01:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-26 11:01:06,070 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-26 11:01:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 11:01:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 11:01:06,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 11:01:06,072 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 11:01:06,239 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 11:01:06,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 11:01:06,751 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 11:01:06,752 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 11:01:07,254 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 11:01:07,254 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-26 11:01:07,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:01:07 BoogieIcfgContainer [2024-10-26 11:01:07,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 11:01:07,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 11:01:07,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 11:01:07,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 11:01:07,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:01:05" (1/3) ... [2024-10-26 11:01:07,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a3279d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:01:07, skipping insertion in model container [2024-10-26 11:01:07,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:01:05" (2/3) ... [2024-10-26 11:01:07,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a3279d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:01:07, skipping insertion in model container [2024-10-26 11:01:07,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:01:07" (3/3) ... [2024-10-26 11:01:07,263 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2024-10-26 11:01:07,282 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 11:01:07,282 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2024-10-26 11:01:07,282 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 11:01:07,342 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-26 11:01:07,392 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:01:07,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 11:01:07,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:07,397 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-26 11:01:07,398 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-26 11:01:07,440 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 11:01:07,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-26 11:01:07,460 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=None, 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;@4d465650, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:01:07,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-26 11:01:07,798 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 9 treesize of output 3 [2024-10-26 11:01:07,802 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 9 treesize of output 3 [2024-10-26 11:01:07,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:07,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash -435966666, now seen corresponding path program 1 times [2024-10-26 11:01:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:07,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692449126] [2024-10-26 11:01:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:07,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:08,228 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-26 11:01:08,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:08,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692449126] [2024-10-26 11:01:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692449126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:01:08,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:01:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 11:01:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526416263] [2024-10-26 11:01:08,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:01:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:01:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:08,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:01:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:01:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:08,268 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:08,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-26 11:01:08,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:08,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-26 11:01:08,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:08,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash -69258264, now seen corresponding path program 1 times [2024-10-26 11:01:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145829948] [2024-10-26 11:01:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:01:08,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:08,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145829948] [2024-10-26 11:01:08,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145829948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:08,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912026887] [2024-10-26 11:01:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:08,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:08,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:08,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:01:08,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-26 11:01:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:08,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:01:08,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:01:08,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:01:08,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912026887] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:08,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:08,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 11:01:08,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956838716] [2024-10-26 11:01:08,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:08,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:01:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:08,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:01:08,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:01:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:08,693 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:08,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) 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-26 11:01:08,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:08,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:08,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-26 11:01:08,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-26 11:01:08,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:08,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1646045562, now seen corresponding path program 2 times [2024-10-26 11:01:08,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:08,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247881539] [2024-10-26 11:01:08,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:08,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:01:09,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247881539] [2024-10-26 11:01:09,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247881539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122491208] [2024-10-26 11:01:09,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:01:09,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:09,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:09,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:01:09,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-26 11:01:09,231 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-26 11:01:09,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:09,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 11:01:09,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:09,308 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 11:01:09,309 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 19 treesize of output 16 [2024-10-26 11:01:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-26 11:01:09,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:01:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122491208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:01:09,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:01:09,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-10-26 11:01:09,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626764343] [2024-10-26 11:01:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:01:09,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-26 11:01:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:09,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-26 11:01:09,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-26 11:01:09,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:09,384 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:09,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-26 11:01:09,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:09,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:09,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:09,526 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 9 treesize of output 3 [2024-10-26 11:01:09,530 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 9 treesize of output 3 [2024-10-26 11:01:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:09,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-26 11:01:09,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:09,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:09,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:09,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1646045563, now seen corresponding path program 1 times [2024-10-26 11:01:09,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:09,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313998343] [2024-10-26 11:01:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:09,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:01:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313998343] [2024-10-26 11:01:09,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313998343] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384588110] [2024-10-26 11:01:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:09,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:09,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:09,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:01:09,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-26 11:01:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:10,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 11:01:10,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:01:10,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:01:10,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384588110] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:10,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:10,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 11:01:10,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850793381] [2024-10-26 11:01:10,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:10,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 11:01:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:10,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 11:01:10,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 11:01:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:10,151 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:10,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-26 11:01:10,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:10,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:10,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:10,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:10,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-26 11:01:10,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:10,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:10,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1794051397, now seen corresponding path program 2 times [2024-10-26 11:01:10,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:10,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794568186] [2024-10-26 11:01:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:10,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794568186] [2024-10-26 11:01:10,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794568186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:01:10,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:01:10,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 11:01:10,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604163667] [2024-10-26 11:01:10,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:01:10,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:01:10,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:10,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:01:10,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:01:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:10,837 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:10,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-26 11:01:10,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:10,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:10,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:10,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:10,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:10,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 9 treesize of output 3 [2024-10-26 11:01:10,982 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 9 treesize of output 3 [2024-10-26 11:01:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:11,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 11:01:11,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:11,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:11,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1366948472, now seen corresponding path program 1 times [2024-10-26 11:01:11,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:11,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329086859] [2024-10-26 11:01:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:11,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:11,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329086859] [2024-10-26 11:01:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329086859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128688958] [2024-10-26 11:01:11,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:11,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:11,692 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-26 11:01:11,694 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-26 11:01:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:11,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:01:11,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:11,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:11,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-26 11:01:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:12,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128688958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:12,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:12,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2024-10-26 11:01:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004432726] [2024-10-26 11:01:12,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:12,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 11:01:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 11:01:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-10-26 11:01:12,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:12,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:12,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 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-26 11:01:12,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:12,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:12,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:12,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:12,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:12,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:01:13,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-26 11:01:13,395 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,SelfDestructingSolverStorable5 [2024-10-26 11:01:13,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:13,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1587533905, now seen corresponding path program 2 times [2024-10-26 11:01:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:13,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110260884] [2024-10-26 11:01:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:14,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110260884] [2024-10-26 11:01:14,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110260884] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305039576] [2024-10-26 11:01:14,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:01:14,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:14,452 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-26 11:01:14,454 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-26 11:01:14,650 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:01:14,650 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:14,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-26 11:01:14,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:14,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:14,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-26 11:01:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:15,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305039576] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:16,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:16,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2024-10-26 11:01:16,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214303520] [2024-10-26 11:01:16,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:16,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-26 11:01:16,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:16,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-26 11:01:16,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2024-10-26 11:01:16,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:16,470 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:16,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 11.2) internal successors, (336), 30 states have internal predecessors, (336), 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-26 11:01:16,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:16,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:16,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:16,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:16,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:16,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:01:16,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:01:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:01:17,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-26 11:01:18,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:18,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:18,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:18,164 INFO L85 PathProgramCache]: Analyzing trace with hash -336567011, now seen corresponding path program 3 times [2024-10-26 11:01:18,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:18,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748810724] [2024-10-26 11:01:18,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:18,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 953 proven. 217 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:18,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748810724] [2024-10-26 11:01:18,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748810724] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:18,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177578525] [2024-10-26 11:01:18,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:01:18,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:18,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:18,804 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-26 11:01:18,805 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-26 11:01:19,026 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 11:01:19,026 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:19,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:01:19,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:19,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:19,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-26 11:01:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 217 proven. 80 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-26 11:01:20,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-26 11:01:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177578525] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:21,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 25 [2024-10-26 11:01:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726248863] [2024-10-26 11:01:21,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:21,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-26 11:01:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:21,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-26 11:01:21,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-10-26 11:01:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:21,650 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:21,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.36) internal successors, (384), 25 states have internal predecessors, (384), 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-26 11:01:21,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:21,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:21,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:21,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:21,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:21,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:01:21,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:01:21,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:24,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-26 11:01:24,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-26 11:01:24,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:24,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash 490056177, now seen corresponding path program 1 times [2024-10-26 11:01:24,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:24,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15010071] [2024-10-26 11:01:24,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2024-10-26 11:01:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:24,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15010071] [2024-10-26 11:01:24,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15010071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:01:24,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:01:24,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 11:01:24,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897201589] [2024-10-26 11:01:24,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:01:24,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:01:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:01:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:01:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:24,490 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:24,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-26 11:01:24,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:24,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:24,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:24,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:24,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:24,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:24,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:24,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:24,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:24,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-26 11:01:24,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:24,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:24,645 INFO L85 PathProgramCache]: Analyzing trace with hash -944669885, now seen corresponding path program 1 times [2024-10-26 11:01:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:24,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944162271] [2024-10-26 11:01:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2024-10-26 11:01:24,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944162271] [2024-10-26 11:01:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944162271] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596594725] [2024-10-26 11:01:24,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:24,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:24,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:24,885 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-26 11:01:24,886 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-26 11:01:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:25,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-26 11:01:25,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1065 trivial. 0 not checked. [2024-10-26 11:01:25,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:01:25,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596594725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:01:25,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:01:25,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-26 11:01:25,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165821130] [2024-10-26 11:01:25,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:01:25,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:01:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:25,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:01:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-26 11:01:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:25,238 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:25,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-26 11:01:25,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:25,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:25,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:25,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:25,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:25,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:25,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:25,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:25,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:25,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:26,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:26,054 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-26 11:01:26,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:26,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:26,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1139599449, now seen corresponding path program 1 times [2024-10-26 11:01:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:26,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047717696] [2024-10-26 11:01:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:32,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047717696] [2024-10-26 11:01:32,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047717696] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:32,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676339136] [2024-10-26 11:01:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:32,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:32,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:32,392 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-26 11:01:32,393 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-26 11:01:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:32,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-26 11:01:32,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:32,841 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:32,841 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-26 11:01:32,875 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-26 11:01:33,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:33,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:33,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:33,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:33,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:33,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:33,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01: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 23 treesize of output 11 [2024-10-26 11:01:33,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:33,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:33,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:33,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:33,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:33,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:33,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:33,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:34,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:34,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:34,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:34,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:34,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:34,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:34,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:34,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:34,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:34,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:34,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:34,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:34,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:34,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:35,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:35,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:35,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:35,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:35,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:35,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:35,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:37,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676339136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:37,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:37,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 70 [2024-10-26 11:01:37,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290423232] [2024-10-26 11:01:37,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:37,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-26 11:01:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-26 11:01:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=4626, Unknown=22, NotChecked=0, Total=4970 [2024-10-26 11:01:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:37,169 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:37,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 9.704225352112676) internal successors, (689), 70 states have internal predecessors, (689), 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-26 11:01:37,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:37,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:37,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:37,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:37,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:37,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:37,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:37,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:37,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:37,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:37,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:37,435 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 9 treesize of output 3 [2024-10-26 11:01:37,436 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 9 treesize of output 3 [2024-10-26 11:01:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:43,644 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-26 11:01:43,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:43,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:43,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1745932176, now seen corresponding path program 1 times [2024-10-26 11:01:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:43,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187484145] [2024-10-26 11:01:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2024-10-26 11:01:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187484145] [2024-10-26 11:01:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187484145] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760973257] [2024-10-26 11:01:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:44,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:44,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:44,085 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-26 11:01:44,087 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-26 11:01:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:44,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:01:44,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2024-10-26 11:01:44,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2024-10-26 11:01:44,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760973257] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:44,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:44,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-26 11:01:44,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598436041] [2024-10-26 11:01:44,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:44,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:01:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:44,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:01:44,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:01:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:44,874 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:44,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 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-26 11:01:44,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:44,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:44,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:44,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:44,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:44,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:44,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:44,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:44,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:44,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:44,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:01:44,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:45,343 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 9 treesize of output 3 [2024-10-26 11:01:45,345 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 9 treesize of output 3 [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:01:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:45,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-26 11:01:45,683 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,SelfDestructingSolverStorable11 [2024-10-26 11:01:45,683 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:45,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:45,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1605649194, now seen corresponding path program 2 times [2024-10-26 11:01:45,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:45,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225726829] [2024-10-26 11:01:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 712 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:49,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225726829] [2024-10-26 11:01:49,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225726829] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:49,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582696564] [2024-10-26 11:01:49,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:01:49,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:49,854 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-26 11:01:49,855 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-26 11:01:50,144 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:01:50,144 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:01:50,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-10-26 11:01:50,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:01:50,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:01:50,235 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-26 11:01:50,267 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-26 11:01:50,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:50,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:50,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:50,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:50,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:50,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:50,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:50,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:50,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:50,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:50,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:50,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:51,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:51,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:51,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:51,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 23 treesize of output 11 [2024-10-26 11:01:51,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:51,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:51,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:51,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:51,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:51,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:51,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:51,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:51,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:51,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:51,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:51,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:52,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:52,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:52,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:01:52,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:01:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 712 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:52,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:01:53,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2439 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2439) |c_~#cache~0.base|) (+ 224 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:01:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 712 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:53,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582696564] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:01:53,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:01:53,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 64 [2024-10-26 11:01:53,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132987371] [2024-10-26 11:01:53,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:01:53,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-26 11:01:53,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:01:53,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-26 11:01:53,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=3745, Unknown=1, NotChecked=124, Total=4160 [2024-10-26 11:01:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:53,637 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:01:53,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 9.507692307692308) internal successors, (618), 64 states have internal predecessors, (618), 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-26 11:01:53,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:53,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:53,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:53,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:53,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:53,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:53,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:53,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:53,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:53,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:53,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:01:53,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:53,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:01:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:01:56,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:01:56,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:01:56,672 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-26 11:01:56,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:56,856 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:01:56,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:01:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1297479763, now seen corresponding path program 3 times [2024-10-26 11:01:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:01:56,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55191815] [2024-10-26 11:01:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:01:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:01:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:01:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:01:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:01:59,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55191815] [2024-10-26 11:01:59,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55191815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:01:59,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597012582] [2024-10-26 11:01:59,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:01:59,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:01:59,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:01:59,593 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:01:59,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-26 11:02:02,877 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-26 11:02:02,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:02,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-26 11:02:02,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:02,984 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:02,984 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-26 11:02:03,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-26 11:02:03,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:03,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:03,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:03,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:03,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:03,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:03,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:03,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:03,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:03,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:03,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:03,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:03,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:03,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:04,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:04,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:04,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:04,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-26 11:02:04,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-26 11:02:04,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-26 11:02:04,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:04,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:05,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:05,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:05,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597012582] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:06,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:06,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 21] total 61 [2024-10-26 11:02:06,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902202451] [2024-10-26 11:02:06,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:06,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-26 11:02:06,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:06,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-26 11:02:06,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=3465, Unknown=12, NotChecked=0, Total=3782 [2024-10-26 11:02:06,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:06,424 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:06,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 8.790322580645162) internal successors, (545), 61 states have internal predecessors, (545), 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-26 11:02:06,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:06,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:06,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:06,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:06,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:06,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:06,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:06,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:02:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:06,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:06,635 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 9 treesize of output 3 [2024-10-26 11:02:06,637 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 9 treesize of output 3 [2024-10-26 11:02:08,555 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 9 treesize of output 3 [2024-10-26 11:02:08,557 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 9 treesize of output 3 [2024-10-26 11:02:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:02:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:02:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:02:09,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-26 11:02:09,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-26 11:02:09,550 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:09,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 334456112, now seen corresponding path program 4 times [2024-10-26 11:02:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839467463] [2024-10-26 11:02:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:11,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839467463] [2024-10-26 11:02:11,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839467463] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:11,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831274465] [2024-10-26 11:02:11,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 11:02:11,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:11,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:11,390 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:11,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-26 11:02:12,536 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 11:02:12,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:12,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-26 11:02:12,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:12,646 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:12,646 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-26 11:02:12,673 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-26 11:02:12,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:12,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:12,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:12,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:13,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:13,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:13,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:13,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,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 23 treesize of output 11 [2024-10-26 11:02:13,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:13,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:13,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:13,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:13,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:13,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:13,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:14,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:14,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3029) |c_~#cache~0.base|) (+ 168 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:02:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:14,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831274465] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:14,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2024-10-26 11:02:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316357856] [2024-10-26 11:02:14,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:14,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-26 11:02:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:14,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-26 11:02:14,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2425, Unknown=1, NotChecked=100, Total=2756 [2024-10-26 11:02:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:14,906 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:14,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 8.924528301886792) internal successors, (473), 52 states have internal predecessors, (473), 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-26 11:02:14,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:14,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:14,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:14,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:14,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:14,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:14,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:14,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:14,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:14,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:14,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:02:14,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:14,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:02:14,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:02:14,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:02:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:02:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 11:02:18,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-26 11:02:18,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-26 11:02:18,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:18,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 39119670, now seen corresponding path program 5 times [2024-10-26 11:02:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:18,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135642331] [2024-10-26 11:02:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:18,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:19,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135642331] [2024-10-26 11:02:19,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135642331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568550696] [2024-10-26 11:02:19,732 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-26 11:02:19,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:19,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:19,733 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-26 11:02:19,734 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-26 11:02:20,830 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-26 11:02:20,830 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:20,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-10-26 11:02:20,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:20,909 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:20,910 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-26 11:02:20,934 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-26 11:02:21,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:21,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:21,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:21,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:21,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:21,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:21,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:21,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:21,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:21,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:21,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:21,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:21,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:21,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:21,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:21,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:21,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:22,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568550696] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:22,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:22,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2024-10-26 11:02:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185441366] [2024-10-26 11:02:22,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:22,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-26 11:02:22,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:22,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-26 11:02:22,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1455, Unknown=13, NotChecked=0, Total=1640 [2024-10-26 11:02:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:22,407 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:22,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.024390243902438) internal successors, (329), 40 states have internal predecessors, (329), 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-26 11:02:22,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:22,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:22,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:22,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:22,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:22,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:22,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:02:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-26 11:02:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:02:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 11:02:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:02:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:02:24,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:24,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-26 11:02:24,810 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:24,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash -764734535, now seen corresponding path program 6 times [2024-10-26 11:02:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333904747] [2024-10-26 11:02:24,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:24,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:25,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:25,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333904747] [2024-10-26 11:02:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333904747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94317762] [2024-10-26 11:02:25,657 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-26 11:02:25,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:25,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:25,658 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-26 11:02:25,659 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-26 11:02:26,102 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-10-26 11:02:26,102 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:26,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-26 11:02:26,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:26,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:26,180 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-26 11:02:26,208 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-26 11:02:26,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:26,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:26,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:26,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:26,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:26,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:26,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:26,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:26,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:26,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:26,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:26,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:26,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:27,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94317762] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:27,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:27,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-10-26 11:02:27,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447593988] [2024-10-26 11:02:27,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:27,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-26 11:02:27,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:27,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-26 11:02:27,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1046, Unknown=2, NotChecked=0, Total=1190 [2024-10-26 11:02:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:27,349 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:27,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.3428571428571425) internal successors, (257), 34 states have internal predecessors, (257), 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-26 11:02:27,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:02:27,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:29,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 11:02:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 11:02:29,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:29,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-26 11:02:29,238 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:29,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 918345020, now seen corresponding path program 7 times [2024-10-26 11:02:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:29,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357374876] [2024-10-26 11:02:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:29,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:29,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357374876] [2024-10-26 11:02:29,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357374876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:29,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658169191] [2024-10-26 11:02:29,656 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-26 11:02:29,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:29,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:29,657 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-26 11:02:29,658 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-26 11:02:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:29,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-26 11:02:29,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:29,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:29,963 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-26 11:02:29,985 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-26 11:02:30,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:30,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:30,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:30,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:30,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:30,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:30,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:30,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:30,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:30,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3540 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3540) |c_~#cache~0.base|) (+ 56 |c_~#cache~0.offset|)))) is different from false [2024-10-26 11:02:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658169191] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:30,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:30,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-26 11:02:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349339683] [2024-10-26 11:02:30,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:30,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-26 11:02:30,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:30,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-26 11:02:30,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=649, Unknown=1, NotChecked=52, Total=812 [2024-10-26 11:02:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:30,782 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:30,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.413793103448276) internal successors, (186), 28 states have internal predecessors, (186), 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-26 11:02:30,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:30,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:30,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 11:02:30,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 11:02:32,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 11:02:32,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:32,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-26 11:02:32,402 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,SelfDestructingSolverStorable17 [2024-10-26 11:02:32,402 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:32,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:32,403 INFO L85 PathProgramCache]: Analyzing trace with hash 323301311, now seen corresponding path program 8 times [2024-10-26 11:02:32,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:32,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202929844] [2024-10-26 11:02:32,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:32,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:32,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202929844] [2024-10-26 11:02:32,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202929844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:32,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378093505] [2024-10-26 11:02:32,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:02:32,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:32,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:32,954 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-26 11:02:32,955 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-26 11:02:33,181 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:02:33,182 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:33,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-26 11:02:33,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:33,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:33,257 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-26 11:02:33,284 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-26 11:02:33,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:33,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:33,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:33,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:33,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:33,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378093505] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:33,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:33,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-10-26 11:02:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210146927] [2024-10-26 11:02:33,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:33,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-26 11:02:33,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:33,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-26 11:02:33,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=553, Unknown=7, NotChecked=0, Total=650 [2024-10-26 11:02:33,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:33,809 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:33,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.346153846153846) internal successors, (113), 25 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-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:33,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 11:02:33,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 11:02:33,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:33,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:33,916 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 9 treesize of output 3 [2024-10-26 11:02:33,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 9 treesize of output 3 [2024-10-26 11:02:34,360 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 9 treesize of output 3 [2024-10-26 11:02:34,362 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 9 treesize of output 3 [2024-10-26 11:02:35,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:35,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:35,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:02:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:02:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:35,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:35,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:35,660 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:35,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -855694526, now seen corresponding path program 1 times [2024-10-26 11:02:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321535853] [2024-10-26 11:02:35,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:35,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:35,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:35,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321535853] [2024-10-26 11:02:35,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321535853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:35,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:02:35,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-26 11:02:35,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970333647] [2024-10-26 11:02:35,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:35,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-26 11:02:35,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:35,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-26 11:02:35,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-26 11:02:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:35,868 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:35,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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-26 11:02:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:35,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:02:36,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-26 11:02:36,341 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:36,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2043368256, now seen corresponding path program 1 times [2024-10-26 11:02:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:36,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970524579] [2024-10-26 11:02:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:36,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:36,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970524579] [2024-10-26 11:02:36,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970524579] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:36,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031911358] [2024-10-26 11:02:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:36,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:36,578 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-26 11:02:36,582 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-26 11:02:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:36,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-26 11:02:36,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:37,033 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:37,033 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-26 11:02:37,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-26 11:02:37,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-26 11:02:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:37,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:37,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3731 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3731) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-26 11:02:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-26 11:02:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031911358] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:37,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-26 11:02:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703109185] [2024-10-26 11:02:37,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:37,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-26 11:02:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:37,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-26 11:02:37,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=245, Unknown=8, NotChecked=32, Total=342 [2024-10-26 11:02:37,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:37,322 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:37,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:02:37,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:02:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:02:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:02:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:02:37,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-26 11:02:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:02:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-26 11:02:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-26 11:02:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 11:02:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:02:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 11:02:37,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2024-10-26 11:02:37,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2024-10-26 11:02:37,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-26 11:02:38,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-26 11:02:38,175 INFO L407 BasicCegarLoop]: Path program histogram: [8, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-26 11:02:38,176 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2024-10-26 11:02:38,180 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:02:38,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 11:02:38,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:38,182 INFO L229 MonitoredProcess]: Starting monitored process 20 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-26 11:02:38,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-10-26 11:02:38,188 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 11:02:38,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 11:02:38,189 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=None, 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;@4d465650, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:02:38,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-26 11:02:38,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:02:38,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash 4521519, now seen corresponding path program 1 times [2024-10-26 11:02:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:38,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069220998] [2024-10-26 11:02:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:02:38,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069220998] [2024-10-26 11:02:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069220998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:02:38,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 11:02:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720564725] [2024-10-26 11:02:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:02:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:38,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:02:38,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:02:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:38,295 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:38,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-26 11:02:38,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:38,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-26 11:02:38,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:02:38,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash 492773021, now seen corresponding path program 1 times [2024-10-26 11:02:38,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:38,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621355331] [2024-10-26 11:02:38,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:38,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:02:38,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:38,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621355331] [2024-10-26 11:02:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621355331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:38,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052879217] [2024-10-26 11:02:38,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:38,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:38,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:38,350 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-26 11:02:38,351 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-26 11:02:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:38,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:02:38,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:02:38,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:02:38,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052879217] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:38,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:38,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 11:02:38,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078537301] [2024-10-26 11:02:38,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:38,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:02:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:38,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:02:38,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:02:38,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:38,597 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:38,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-26 11:02:38,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:38,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:38,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-26 11:02:38,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-26 11:02:38,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:02:38,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2046776913, now seen corresponding path program 2 times [2024-10-26 11:02:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650093359] [2024-10-26 11:02:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:38,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:02:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650093359] [2024-10-26 11:02:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650093359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136313122] [2024-10-26 11:02:38,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:02:38,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:38,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:38,876 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:38,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-26 11:02:39,118 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:02:39,118 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:39,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 11:02:39,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:02:39,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-26 11:02:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136313122] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:39,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:39,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 11:02:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240946957] [2024-10-26 11:02:39,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:39,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 11:02:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:39,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 11:02:39,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 11:02:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:39,174 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-26 11:02:39,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:39,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:39,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:39,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:39,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:39,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:39,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:39,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-26 11:02:39,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:39,415 INFO L85 PathProgramCache]: Analyzing trace with hash -214637841, now seen corresponding path program 3 times [2024-10-26 11:02:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:39,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326160059] [2024-10-26 11:02:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 11:02:39,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 11:02:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 11:02:39,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 11:02:39,461 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 11:02:39,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 28 remaining) [2024-10-26 11:02:39,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 28 remaining) [2024-10-26 11:02:39,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 28 remaining) [2024-10-26 11:02:39,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 28 remaining) [2024-10-26 11:02:39,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 28 remaining) [2024-10-26 11:02:39,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 28 remaining) [2024-10-26 11:02:39,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 28 remaining) [2024-10-26 11:02:39,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (20 of 28 remaining) [2024-10-26 11:02:39,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2024-10-26 11:02:39,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2024-10-26 11:02:39,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2024-10-26 11:02:39,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2024-10-26 11:02:39,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2024-10-26 11:02:39,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2024-10-26 11:02:39,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 28 remaining) [2024-10-26 11:02:39,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 28 remaining) [2024-10-26 11:02:39,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 28 remaining) [2024-10-26 11:02:39,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 28 remaining) [2024-10-26 11:02:39,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 28 remaining) [2024-10-26 11:02:39,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 28 remaining) [2024-10-26 11:02:39,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 28 remaining) [2024-10-26 11:02:39,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 28 remaining) [2024-10-26 11:02:39,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 28 remaining) [2024-10-26 11:02:39,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 28 remaining) [2024-10-26 11:02:39,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (3 of 28 remaining) [2024-10-26 11:02:39,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2024-10-26 11:02:39,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2024-10-26 11:02:39,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (0 of 28 remaining) [2024-10-26 11:02:39,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-26 11:02:39,468 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-26 11:02:39,471 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-10-26 11:02:39,472 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 11:02:39,472 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-26 11:02:39,505 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-26 11:02:39,508 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:02:39,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 11:02:39,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:39,510 INFO L229 MonitoredProcess]: Starting monitored process 23 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-26 11:02:39,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-10-26 11:02:39,514 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 11:02:39,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-26 11:02:39,514 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=None, 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;@4d465650, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 11:02:39,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-26 11:02:39,603 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 9 treesize of output 3 [2024-10-26 11:02:39,605 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 9 treesize of output 3 [2024-10-26 11:02:39,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:39,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash -962778151, now seen corresponding path program 1 times [2024-10-26 11:02:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:39,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932194538] [2024-10-26 11:02:39,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:39,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:39,647 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-26 11:02:39,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:39,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932194538] [2024-10-26 11:02:39,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932194538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:39,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:02:39,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 11:02:39,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725143684] [2024-10-26 11:02:39,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:39,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:02:39,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:39,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:02:39,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:02:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:39,649 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:39,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-26 11:02:39,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:39,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-26 11:02:39,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:39,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2120031515, now seen corresponding path program 1 times [2024-10-26 11:02:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159943151] [2024-10-26 11:02:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:02:39,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159943151] [2024-10-26 11:02:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159943151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900998464] [2024-10-26 11:02:39,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:39,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:39,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:39,738 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:39,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-10-26 11:02:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:39,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 11:02:39,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:02:40,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:02:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900998464] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:40,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:40,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-26 11:02:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610310900] [2024-10-26 11:02:40,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:40,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:02:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:40,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:02:40,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:02:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:40,017 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:40,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) 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-26 11:02:40,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:40,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:40,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:40,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-26 11:02:40,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:40,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1505182414, now seen corresponding path program 2 times [2024-10-26 11:02:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:40,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194444580] [2024-10-26 11:02:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:40,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:02:40,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:40,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194444580] [2024-10-26 11:02:40,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194444580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:40,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586285335] [2024-10-26 11:02:40,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:02:40,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:40,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:40,322 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:40,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-26 11:02:40,552 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-26 11:02:40,552 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:40,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-26 11:02:40,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:40,581 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 11:02:40,581 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 19 treesize of output 16 [2024-10-26 11:02:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-26 11:02:40,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:02:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586285335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:40,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:02:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-10-26 11:02:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407726263] [2024-10-26 11:02:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:40,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-26 11:02:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-26 11:02:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-26 11:02:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:40,612 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-26 11:02:40,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:40,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:40,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:40,669 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 9 treesize of output 3 [2024-10-26 11:02:40,670 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 9 treesize of output 3 [2024-10-26 11:02:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:40,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-10-26 11:02:40,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:40,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:40,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1505182415, now seen corresponding path program 1 times [2024-10-26 11:02:40,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:40,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067507510] [2024-10-26 11:02:40,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:02:40,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:40,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067507510] [2024-10-26 11:02:40,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067507510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:40,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133725984] [2024-10-26 11:02:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:40,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:40,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:40,958 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:40,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-26 11:02:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:41,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 11:02:41,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:02:41,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 11:02:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133725984] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:41,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:41,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-26 11:02:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965044291] [2024-10-26 11:02:41,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:41,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-26 11:02:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:41,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-26 11:02:41,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-26 11:02:41,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:41,251 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:41,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 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-26 11:02:41,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:41,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:41,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:41,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:41,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-26 11:02:41,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-26 11:02:41,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:41,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash -749110417, now seen corresponding path program 2 times [2024-10-26 11:02:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:41,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504349181] [2024-10-26 11:02:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:41,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504349181] [2024-10-26 11:02:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504349181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:41,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:02:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 11:02:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129290892] [2024-10-26 11:02:41,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:41,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-26 11:02:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:41,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-26 11:02:41,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-26 11:02:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:41,698 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:41,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-26 11:02:41,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:41,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:41,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:41,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:41,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:41,806 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 9 treesize of output 3 [2024-10-26 11:02:41,808 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 9 treesize of output 3 [2024-10-26 11:02:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:41,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-26 11:02:41,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:41,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1625093716, now seen corresponding path program 1 times [2024-10-26 11:02:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:41,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843898966] [2024-10-26 11:02:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:42,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843898966] [2024-10-26 11:02:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843898966] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011266308] [2024-10-26 11:02:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:42,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:42,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:42,200 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:42,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-26 11:02:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:42,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:02:42,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:42,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:42,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-26 11:02:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:42,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:43,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011266308] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:43,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:43,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2024-10-26 11:02:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947494677] [2024-10-26 11:02:43,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:43,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-26 11:02:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:43,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-26 11:02:43,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-10-26 11:02:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:43,124 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:43,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 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-26 11:02:43,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:43,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:43,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:43,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:43,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:43,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:02:43,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-10-26 11:02:43,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:43,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:43,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1239796323, now seen corresponding path program 2 times [2024-10-26 11:02:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742268241] [2024-10-26 11:02:43,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:43,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742268241] [2024-10-26 11:02:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742268241] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548586305] [2024-10-26 11:02:44,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:02:44,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:44,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:44,166 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:44,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-26 11:02:44,458 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:02:44,458 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:44,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-26 11:02:44,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:44,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:44,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-26 11:02:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:45,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548586305] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:45,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:45,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2024-10-26 11:02:45,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708732288] [2024-10-26 11:02:45,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:45,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-26 11:02:45,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:45,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-26 11:02:45,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2024-10-26 11:02:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:45,734 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:45,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 11.2) internal successors, (336), 30 states have internal predecessors, (336), 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-26 11:02:45,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:45,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:45,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:45,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:45,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:45,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:02:45,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:02:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:02:46,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-10-26 11:02:47,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:47,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:47,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash 75017937, now seen corresponding path program 3 times [2024-10-26 11:02:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:47,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642275212] [2024-10-26 11:02:47,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 953 proven. 217 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642275212] [2024-10-26 11:02:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642275212] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:47,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443769745] [2024-10-26 11:02:47,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:02:47,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:47,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:47,489 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:47,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-26 11:02:47,822 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 11:02:47,822 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:02:47,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-26 11:02:47,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:47,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:47,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-26 11:02:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 217 proven. 80 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-26 11:02:48,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:02:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-26 11:02:49,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443769745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:02:49,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:02:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 25 [2024-10-26 11:02:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950818621] [2024-10-26 11:02:49,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:02:49,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-26 11:02:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:49,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-26 11:02:49,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-10-26 11:02:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:49,757 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:49,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.36) internal successors, (384), 25 states have internal predecessors, (384), 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-26 11:02:49,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:49,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:49,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:49,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:49,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:49,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-26 11:02:49,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 11:02:49,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:50,661 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 9 treesize of output 3 [2024-10-26 11:02:50,663 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 9 treesize of output 3 [2024-10-26 11:02:50,667 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 9 treesize of output 3 [2024-10-26 11:02:50,668 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 9 treesize of output 3 [2024-10-26 11:02:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:52,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-10-26 11:02:52,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:52,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:52,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash -959679783, now seen corresponding path program 1 times [2024-10-26 11:02:52,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:52,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203815889] [2024-10-26 11:02:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1069 trivial. 0 not checked. [2024-10-26 11:02:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:53,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203815889] [2024-10-26 11:02:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203815889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 11:02:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 11:02:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080993897] [2024-10-26 11:02:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:53,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:02:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:02:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 11:02:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:53,039 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:53,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-26 11:02:53,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:53,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:53,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:53,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:53,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:53,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:53,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:53,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:53,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:53,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:53,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-26 11:02:53,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:53,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash -474452309, now seen corresponding path program 1 times [2024-10-26 11:02:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:53,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674151412] [2024-10-26 11:02:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1069 trivial. 0 not checked. [2024-10-26 11:02:53,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:53,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674151412] [2024-10-26 11:02:53,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674151412] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184611221] [2024-10-26 11:02:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:53,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:53,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:53,453 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:53,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-10-26 11:02:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:53,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-26 11:02:53,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2024-10-26 11:02:53,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:02:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184611221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:02:53,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:02:53,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-26 11:02:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333203995] [2024-10-26 11:02:53,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:02:53,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 11:02:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:02:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 11:02:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-26 11:02:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:53,931 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:02:53,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-26 11:02:53,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:53,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:53,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:53,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:53,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:53,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:53,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:53,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:53,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:53,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:02:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:02:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:02:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:02:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:02:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:02:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:02:55,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-10-26 11:02:55,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:55,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:02:55,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:02:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2141272901, now seen corresponding path program 1 times [2024-10-26 11:02:55,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:02:55,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205088996] [2024-10-26 11:02:55,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:55,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:02:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:02:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:02:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205088996] [2024-10-26 11:02:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205088996] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:02:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829506325] [2024-10-26 11:02:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:02:58,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:02:58,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:02:58,904 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:02:58,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-10-26 11:02:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:02:59,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-26 11:02:59,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:02:59,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:02:59,410 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-26 11:02:59,443 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-26 11:02:59,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:59,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:59,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:59,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:59,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:59,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:02:59,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:02:59,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:00,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:00,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:00,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:00,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:00,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:00,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:00,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:00,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:00,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:00,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:00,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:00,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:00,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:00,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:00,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:00,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:00,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:00,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:01,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:01,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:01,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:01,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:01,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:01,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:01,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:01,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:01,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:01,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:03:01,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:03:03,177 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5547 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_5547) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0)) is different from false [2024-10-26 11:03:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-26 11:03:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829506325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:03:03,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:03:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 70 [2024-10-26 11:03:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854482235] [2024-10-26 11:03:03,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:03:03,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-26 11:03:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:03:03,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-26 11:03:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4513, Unknown=1, NotChecked=136, Total=4970 [2024-10-26 11:03:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:03,275 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:03:03,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 9.704225352112676) internal successors, (689), 70 states have internal predecessors, (689), 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-26 11:03:03,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:03,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:03,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:03,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:03,504 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 9 treesize of output 3 [2024-10-26 11:03:03,506 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 9 treesize of output 3 [2024-10-26 11:03:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:03:10,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-10-26 11:03:10,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-26 11:03:10,193 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:03:10,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:03:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1451677776, now seen corresponding path program 1 times [2024-10-26 11:03:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:03:10,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716451289] [2024-10-26 11:03:10,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:03:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:03:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:03:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2024-10-26 11:03:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:03:10,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716451289] [2024-10-26 11:03:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716451289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:03:10,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163357394] [2024-10-26 11:03:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:03:10,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:03:10,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:03:10,561 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:03:10,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-10-26 11:03:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:03:10,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-26 11:03:10,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:03:11,425 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-26 11:03:11,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:11,480 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-26 11:03:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-10-26 11:03:11,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 11:03:11,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163357394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 11:03:11,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 11:03:11,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-26 11:03:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052788536] [2024-10-26 11:03:11,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 11:03:11,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 11:03:11,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:03:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 11:03:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-26 11:03:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:11,499 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:03:11,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 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-26 11:03:11,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:11,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:11,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:11,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:11,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:11,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:11,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:11,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:11,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:11,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:11,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:03:11,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:03:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:03:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:03:21,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-10-26 11:03:22,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-26 11:03:22,119 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:03:22,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:03:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1372589789, now seen corresponding path program 1 times [2024-10-26 11:03:22,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:03:22,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396053527] [2024-10-26 11:03:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:03:22,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:03:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:03:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:03:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:03:27,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396053527] [2024-10-26 11:03:27,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396053527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:03:27,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124402994] [2024-10-26 11:03:27,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:03:27,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:03:27,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:03:27,268 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:03:27,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-10-26 11:03:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:03:27,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 148 conjuncts are in the unsatisfiable core [2024-10-26 11:03:27,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:03:27,945 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:03:27,946 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-26 11:03:27,997 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-26 11:03:28,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:28,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:28,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:28,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:28,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:28,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:28,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:28,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:28,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:28,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:28,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:28,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:29,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:29,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 23 treesize of output 11 [2024-10-26 11:03:29,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:29,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:29,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:29,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:29,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:29,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:29,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:29,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:29,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:29,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:29,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:29,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:30,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:30,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:30,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:30,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:30,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:30,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:30,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 11:03:30,820 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-26 11:03:31,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:31,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:03:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 5 proven. 911 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:03:31,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:03:31,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (or (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))))) is different from false [2024-10-26 11:03:31,823 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 28 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:03:31,833 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:03:31,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6350)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:03:32,028 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|)))) is different from false [2024-10-26 11:03:32,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|)))) is different from false [2024-10-26 11:03:32,156 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6347)))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:03:32,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:03:32,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|)))) is different from false [2024-10-26 11:03:32,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse1 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6342)))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse1 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse1 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|)))) is different from false [2024-10-26 11:03:32,869 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|)))) is different from false [2024-10-26 11:03:32,897 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (v_ArrVal_6355 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:03:33,026 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6339)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:03:33,347 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:03:33,373 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:03:33,541 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6334)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:03:34,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:03:34,032 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:03:34,227 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6331)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|)))) is different from false [2024-10-26 11:03:34,710 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|)))) is different from false [2024-10-26 11:03:34,748 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|)))) is different from false [2024-10-26 11:03:35,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6326)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|)))) is different from false [2024-10-26 11:03:35,851 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|)))) is different from false [2024-10-26 11:03:35,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:03:36,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= 0 (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_6322)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 252 |c_~#cache~0.offset|))) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|)))) is different from false [2024-10-26 11:03:37,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_6322) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109|)))) is different from false [2024-10-26 11:03:37,187 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (or (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< |c_~#cache~0.offset| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_31|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_6322) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|))) is different from false [2024-10-26 11:03:37,225 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (or (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_6322) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|))) is different from false [2024-10-26 11:03:37,282 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| Int) (v_ArrVal_6339 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_6326 Int) (v_ArrVal_6347 Int) (v_ArrVal_6334 Int) (v_ArrVal_6322 Int) (v_ArrVal_6355 Int) (v_ArrVal_6331 Int) (v_ArrVal_6342 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| Int) (v_ArrVal_6350 Int) (v_ArrVal_6357 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| Int) (v_ArrVal_6319 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| Int)) (or (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103|) (< |c_~#cache~0.offset| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6319) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_109| v_ArrVal_6322) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_6326) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105| v_ArrVal_6331) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_103| v_ArrVal_6334) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101| v_ArrVal_6339) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_99| v_ArrVal_6342) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97| v_ArrVal_6347) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_6350) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_93| v_ArrVal_6355)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6357) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_97|) (< (+ 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_107|) (< (+ 56 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_105|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_101|))) is different from false [2024-10-26 11:03:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 911 not checked. [2024-10-26 11:03:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124402994] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:03:38,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:03:38,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 39] total 93 [2024-10-26 11:03:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008317693] [2024-10-26 11:03:38,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:03:38,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-10-26 11:03:38,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:03:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-10-26 11:03:38,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3875, Unknown=62, NotChecked=4466, Total=8742 [2024-10-26 11:03:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:38,156 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:03:38,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 7.946808510638298) internal successors, (747), 93 states have internal predecessors, (747), 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-26 11:03:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:38,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:38,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:38,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:03:38,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:38,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:38,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:03:38,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:03:38,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:03:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:03:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:03:56,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-10-26 11:03:56,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-26 11:03:56,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:03:56,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:03:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1320610048, now seen corresponding path program 1 times [2024-10-26 11:03:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:03:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824302418] [2024-10-26 11:03:56,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:03:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:03:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:03:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 35 proven. 186 refuted. 0 times theorem prover too weak. 797 trivial. 0 not checked. [2024-10-26 11:03:57,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:03:57,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824302418] [2024-10-26 11:03:57,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824302418] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:03:57,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421513196] [2024-10-26 11:03:57,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:03:57,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:03:57,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:03:57,112 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:03:57,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-10-26 11:03:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:03:57,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 1489 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-26 11:03:57,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:03:58,219 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-26 11:03:58,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:58,262 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-26 11:03:58,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:03:58,289 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-26 11:03:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2024-10-26 11:03:58,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:03:58,319 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6790 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| v_ArrVal_6790) |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset|) 0))) is different from false [2024-10-26 11:03:58,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| Int) (v_ArrVal_6790 (Array Int Int))) (or (not (= 0 (select (select (store |c_#pthreadsMutex| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| v_ArrVal_6790) |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset|))) (< |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| |c_~#cache~0.base|))) is different from false [2024-10-26 11:03:58,332 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| Int) (v_ArrVal_6789 (Array Int Int)) (v_ArrVal_6790 (Array Int Int))) (or (not (= 0 (select (select (store (store |c_#pthreadsMutex| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| v_ArrVal_6789) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| v_ArrVal_6790) |c_~#__global_lock~0.base|) |c_~#__global_lock~0.offset|))) (< |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_45| |c_~#cache~0.base|))) is different from false [2024-10-26 11:03:58,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 11:03:58,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-26 11:03:58,356 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 65 treesize of output 57 [2024-10-26 11:03:58,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 42 treesize of output 38 [2024-10-26 11:03:58,360 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-26 11:03:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 34 proven. 5 refuted. 0 times theorem prover too weak. 977 trivial. 2 not checked. [2024-10-26 11:03:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421513196] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:03:58,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:03:58,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-10-26 11:03:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108462975] [2024-10-26 11:03:58,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:03:58,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-26 11:03:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:03:58,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-26 11:03:58,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=224, Unknown=3, NotChecked=102, Total=420 [2024-10-26 11:03:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:03:58,637 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:03:58,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.285714285714286) internal successors, (258), 20 states have internal predecessors, (258), 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-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-26 11:03:58,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:04:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:04:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:04:07,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-10-26 11:04:07,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:04:07,932 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:04:07,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:04:07,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1546152617, now seen corresponding path program 2 times [2024-10-26 11:04:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:04:07,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206740612] [2024-10-26 11:04:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:04:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:04:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:04:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 962 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:04:14,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:04:14,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206740612] [2024-10-26 11:04:14,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206740612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:04:14,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543219872] [2024-10-26 11:04:14,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 11:04:14,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:04:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:04:14,757 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:04:14,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-26 11:04:15,271 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 11:04:15,271 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:04:15,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 182 conjuncts are in the unsatisfiable core [2024-10-26 11:04:15,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:04:15,363 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:04:15,363 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-26 11:04:15,397 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-26 11:04:15,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:15,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:15,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:15,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:16,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:16,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:16,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:16,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:16,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:16,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:16,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:16,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:16,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:16,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:17,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:17,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:17,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:17,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:17,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:17,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:17,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:17,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:17,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:17,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:17,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:17,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:18,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:18,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:18,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:04:18,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:18,429 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-26 11:04:18,466 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-26 11:04:18,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 23 treesize of output 11 [2024-10-26 11:04:18,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:19,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:19,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:19,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-26 11:04:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 5 proven. 957 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:04:19,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 11:04:20,501 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)))) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-26 11:04:20,925 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 28 |c_~#cache~0.offset|)) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:20,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:04:21,129 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse1 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7254)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse1 |c_~#cache~0.offset|)) 0) (< (+ .cse1 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:21,219 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 56 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:04:21,230 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= 0 (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)))))) is different from false [2024-10-26 11:04:21,286 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7251)))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:04:21,448 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 84 .cse0 |c_~#cache~0.offset|)) 0) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|)))) is different from false [2024-10-26 11:04:21,462 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (v_ArrVal_7259 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:04:21,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_7261 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7246)))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:04:21,745 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 112 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|)))) is different from false [2024-10-26 11:04:21,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:21,868 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7243)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:22,133 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 140 .cse0 |c_~#cache~0.offset|)) 0)))) is different from false [2024-10-26 11:04:22,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|)))) is different from false [2024-10-26 11:04:22,296 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7239)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|)))) is different from false [2024-10-26 11:04:22,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 168 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|)))) is different from false [2024-10-26 11:04:22,666 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:22,838 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ .cse0 28 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7234)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ 196 .cse0 |c_~#cache~0.offset|)) 0) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:33,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (= (select (store (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7231)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:35,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 56 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_7231) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 224 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:37,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse0 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (< (+ 140 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 196 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (= (select (store (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ .cse0 28 |c_~#cache~0.offset|) v_ArrVal_7231) (+ 56 .cse0 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse0 252 |c_~#cache~0.offset|)) 0) (< (+ 112 .cse0 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ .cse0 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse0 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:39,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7226 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7266 Int) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (|t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7263 Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (let ((.cse1 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (or (= (select (store (store (store (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_7226)))) (store .cse0 |c_~#cache~0.base| (store (store (store (store (store (store (store (store (select .cse0 |c_~#cache~0.base|) (+ .cse1 28 |c_~#cache~0.offset|) v_ArrVal_7231) (+ 56 .cse1 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7263) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7266) (+ 56 |c_~#cache~0.offset|) (+ |t_funThread2of2ForFork0_cache_entry_addref_#t~post35#1| 1)) (+ .cse1 252 |c_~#cache~0.offset|)) 0) (< (+ 140 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 196 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 84 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 112 .cse1 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ .cse1 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ .cse1 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|)))) is different from false [2024-10-26 11:04:51,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7226 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7251 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (or (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7226) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7231) (+ 56 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|))) is different from false [2024-10-26 11:04:51,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7239 Int) (v_ArrVal_7226 Int) (v_ArrVal_7259 Int) (v_ArrVal_7246 Int) (v_ArrVal_7234 Int) (v_ArrVal_7261 (Array Int Int)) (v_ArrVal_7243 Int) (v_ArrVal_7254 Int) (v_ArrVal_7231 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_7251 Int) (v_ArrVal_7223 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (or (< (+ 168 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137|) (< (+ 196 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135|) (< (+ 112 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141|) (< (+ 140 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (store (store (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7223) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_7226) (+ 28 |c_~#cache~0.offset|) v_ArrVal_7231) (+ 56 |c_~#cache~0.offset|) v_ArrVal_7234) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143| v_ArrVal_7239) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_141| v_ArrVal_7243) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_139| v_ArrVal_7246) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_137| v_ArrVal_7251) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_135| v_ArrVal_7254) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133| v_ArrVal_7259)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_7261) |c_~#cache~0.base|) (+ 252 |c_~#cache~0.offset|)) 0) (< (+ 84 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_143|) (< (+ 224 |c_~#cache~0.offset|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_133|))) is different from false [2024-10-26 11:04:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 58 trivial. 906 not checked. [2024-10-26 11:04:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543219872] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 11:04:52,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 11:04:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 44] total 106 [2024-10-26 11:04:52,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130342680] [2024-10-26 11:04:52,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 11:04:52,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2024-10-26 11:04:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 11:04:52,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2024-10-26 11:04:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=6105, Unknown=122, NotChecked=4600, Total=11342 [2024-10-26 11:04:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:04:52,232 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 11:04:52,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 8.336448598130842) internal successors, (892), 106 states have internal predecessors, (892), 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-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:04:52,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 11:05:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-26 11:05:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-26 11:05:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-26 11:05:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-26 11:05:32,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-10-26 11:05:32,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-26 11:05:32,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONMEMORY_LEAK === [t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-10-26 11:05:32,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 11:05:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1520225867, now seen corresponding path program 3 times [2024-10-26 11:05:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 11:05:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658849178] [2024-10-26 11:05:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 11:05:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 11:05:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 11:05:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 5 proven. 1337 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:05:47,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 11:05:47,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658849178] [2024-10-26 11:05:47,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658849178] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 11:05:47,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156732296] [2024-10-26 11:05:47,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 11:05:47,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 11:05:47,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 11:05:47,184 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-26 11:05:47,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-10-26 11:08:50,008 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-26 11:08:50,009 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 11:08:50,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 267 conjuncts are in the unsatisfiable core [2024-10-26 11:08:50,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 11:08:50,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 11:08:50,240 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-26 11:08:50,297 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 30 treesize of output 21 [2024-10-26 11:08:50,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:50,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:50,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:51,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:51,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:51,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:51,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:51,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:51,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:51,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:51,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:51,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:51,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:51,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:51,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:51,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:52,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:52,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:52,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:52,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:52,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:52,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-26 11:08:53,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-26 11:08:53,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-26 11:08:53,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-26 11:08:54,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-10-26 11:08:54,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:54,547 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-10-26 11:08:54,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2024-10-26 11:08:54,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:54,789 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-10-26 11:08:54,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2024-10-26 11:08:55,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-26 11:08:55,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-26 11:08:55,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:55,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:56,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:56,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:56,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:56,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:56,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:56,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:56,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:56,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:56,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:56,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:57,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:57,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:57,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:57,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:57,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:58,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:58,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:58,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:58,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:58,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:58,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:58,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 11:08:58,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2024-10-26 11:08:58,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-10-26 11:08:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 0 proven. 1342 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-26 11:08:58,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... Killed by 15