./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:51:33,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:51:33,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:51:33,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:51:33,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:51:33,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:51:33,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:51:33,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:51:33,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:51:33,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:51:33,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:51:33,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:51:33,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:51:33,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:51:33,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:51:33,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:51:33,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:51:33,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:51:33,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:51:33,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:51:33,770 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:51:33,771 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:51:33,771 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:51:33,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:51:33,771 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:51:33,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:51:33,772 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:51:33,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:51:33,772 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:51:33,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:51:33,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:51:33,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:51:33,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:51:33,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:51:33,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:51:33,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:51:33,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:51:33,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:51:33,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:51:33,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:51:33,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:51:33,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:51:33,776 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-20 14:51:33,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:51:33,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:51:33,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:51:33,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:51:33,989 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:51:33,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-20 14:51:35,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:51:35,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:51:35,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-20 14:51:35,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27e60323/6ef21aa8a3584e38b81c6b9e7b62c00c/FLAGf7673f6b0 [2024-11-20 14:51:35,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27e60323/6ef21aa8a3584e38b81c6b9e7b62c00c [2024-11-20 14:51:35,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:51:35,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:51:35,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:51:35,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:51:35,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:51:35,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:35,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78931ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35, skipping insertion in model container [2024-11-20 14:51:35,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:35,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:51:35,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:51:35,847 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:51:35,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:51:35,942 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:51:35,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35 WrapperNode [2024-11-20 14:51:35,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:51:35,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:51:35,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:51:35,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:51:35,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:35,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:35,994 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2024-11-20 14:51:35,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:51:35,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:51:35,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:51:35,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:51:36,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,039 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-11-20 14:51:36,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:51:36,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:51:36,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:51:36,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:51:36,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (1/1) ... [2024-11-20 14:51:36,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:51:36,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:51:36,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:51:36,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:51:36,143 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 14:51:36,144 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 14:51:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 14:51:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 14:51:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:51:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:51:36,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:51:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:51:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:51:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:51:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:51:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:51:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:51:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:51:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:51:36,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:51:36,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:51:36,237 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:51:36,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:51:36,538 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-20 14:51:36,539 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:51:36,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:51:36,557 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-20 14:51:36,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:51:36 BoogieIcfgContainer [2024-11-20 14:51:36,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:51:36,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:51:36,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:51:36,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:51:36,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:51:35" (1/3) ... [2024-11-20 14:51:36,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e4c4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:51:36, skipping insertion in model container [2024-11-20 14:51:36,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:51:35" (2/3) ... [2024-11-20 14:51:36,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e4c4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:51:36, skipping insertion in model container [2024-11-20 14:51:36,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:51:36" (3/3) ... [2024-11-20 14:51:36,568 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-20 14:51:36,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:51:36,582 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-11-20 14:51:36,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:51:36,633 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=PETRI_NET, 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;@2385460d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:51:36,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-20 14:51:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 161 states, 87 states have (on average 2.103448275862069) internal successors, (183), 152 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 14:51:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 14:51:36,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:36,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 14:51:36,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:36,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-20 14:51:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:36,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889873340] [2024-11-20 14:51:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:36,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:36,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889873340] [2024-11-20 14:51:36,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889873340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:36,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:36,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:51:36,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656195146] [2024-11-20 14:51:36,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:36,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:51:36,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:51:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:51:36,872 INFO L87 Difference]: Start difference. First operand has 161 states, 87 states have (on average 2.103448275862069) internal successors, (183), 152 states have internal predecessors, (183), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:36,989 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2024-11-20 14:51:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:51:36,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 14:51:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:37,001 INFO L225 Difference]: With dead ends: 147 [2024-11-20 14:51:37,002 INFO L226 Difference]: Without dead ends: 145 [2024-11-20 14:51:37,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:51:37,027 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 117 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:37,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-20 14:51:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-20 14:51:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 80 states have (on average 1.8875) internal successors, (151), 143 states have internal predecessors, (151), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2024-11-20 14:51:37,109 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 3 [2024-11-20 14:51:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:37,110 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2024-11-20 14:51:37,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2024-11-20 14:51:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 14:51:37,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:37,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 14:51:37,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:51:37,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:37,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:37,113 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-20 14:51:37,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:37,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762098104] [2024-11-20 14:51:37,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:37,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:37,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:37,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762098104] [2024-11-20 14:51:37,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762098104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:37,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:37,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:51:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058999178] [2024-11-20 14:51:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:37,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:51:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:51:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:51:37,190 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:37,338 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-11-20 14:51:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:51:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 14:51:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:37,339 INFO L225 Difference]: With dead ends: 149 [2024-11-20 14:51:37,341 INFO L226 Difference]: Without dead ends: 149 [2024-11-20 14:51:37,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:51:37,343 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:37,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 112 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-20 14:51:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-20 14:51:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 87 states have (on average 1.7816091954022988) internal successors, (155), 147 states have internal predecessors, (155), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2024-11-20 14:51:37,362 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 3 [2024-11-20 14:51:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:37,362 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2024-11-20 14:51:37,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2024-11-20 14:51:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:51:37,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:37,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:37,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:51:37,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:37,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash 919164531, now seen corresponding path program 1 times [2024-11-20 14:51:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578288885] [2024-11-20 14:51:37,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:37,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578288885] [2024-11-20 14:51:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578288885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:37,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:37,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:51:37,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117877028] [2024-11-20 14:51:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:37,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:51:37,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:37,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:51:37,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:51:37,546 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:37,711 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2024-11-20 14:51:37,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:51:37,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:51:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:37,713 INFO L225 Difference]: With dead ends: 136 [2024-11-20 14:51:37,715 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 14:51:37,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:37,716 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 154 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:37,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 83 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 14:51:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-20 14:51:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.6179775280898876) internal successors, (144), 134 states have internal predecessors, (144), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2024-11-20 14:51:37,728 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 9 [2024-11-20 14:51:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:37,729 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2024-11-20 14:51:37,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-20 14:51:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:51:37,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:37,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:37,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:51:37,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:37,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash 919164532, now seen corresponding path program 1 times [2024-11-20 14:51:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:37,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210060446] [2024-11-20 14:51:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:37,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:37,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:37,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210060446] [2024-11-20 14:51:37,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210060446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:37,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:37,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:51:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124557586] [2024-11-20 14:51:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:37,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:51:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:37,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:51:37,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:51:37,960 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:38,219 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2024-11-20 14:51:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:51:38,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:51:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:38,220 INFO L225 Difference]: With dead ends: 149 [2024-11-20 14:51:38,220 INFO L226 Difference]: Without dead ends: 149 [2024-11-20 14:51:38,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:51:38,221 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 241 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:38,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 157 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:51:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-20 14:51:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-20 14:51:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.57) internal successors, (157), 144 states have internal predecessors, (157), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2024-11-20 14:51:38,235 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 9 [2024-11-20 14:51:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:38,235 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2024-11-20 14:51:38,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2024-11-20 14:51:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:51:38,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:38,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:38,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:51:38,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:38,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1871491110, now seen corresponding path program 1 times [2024-11-20 14:51:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:38,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047212981] [2024-11-20 14:51:38,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:38,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047212981] [2024-11-20 14:51:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047212981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:38,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:51:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278656989] [2024-11-20 14:51:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:51:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:38,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:51:38,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:51:38,295 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:38,401 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2024-11-20 14:51:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:51:38,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:51:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:38,402 INFO L225 Difference]: With dead ends: 152 [2024-11-20 14:51:38,402 INFO L226 Difference]: Without dead ends: 152 [2024-11-20 14:51:38,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:38,403 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 131 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:38,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 188 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-20 14:51:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2024-11-20 14:51:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.54) internal successors, (154), 143 states have internal predecessors, (154), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 160 transitions. [2024-11-20 14:51:38,408 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 160 transitions. Word has length 13 [2024-11-20 14:51:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:38,409 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 160 transitions. [2024-11-20 14:51:38,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 160 transitions. [2024-11-20 14:51:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:51:38,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:38,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:38,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:51:38,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:38,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931275, now seen corresponding path program 1 times [2024-11-20 14:51:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:38,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377164927] [2024-11-20 14:51:38,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:38,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:38,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377164927] [2024-11-20 14:51:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377164927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:38,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:51:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587851251] [2024-11-20 14:51:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:38,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:51:38,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:38,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:51:38,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:38,510 INFO L87 Difference]: Start difference. First operand 145 states and 160 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-20 14:51:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:38,618 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2024-11-20 14:51:38,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:51:38,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2024-11-20 14:51:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:38,619 INFO L225 Difference]: With dead ends: 144 [2024-11-20 14:51:38,620 INFO L226 Difference]: Without dead ends: 144 [2024-11-20 14:51:38,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:51:38,621 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:38,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 346 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-20 14:51:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-20 14:51:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.52) internal successors, (152), 142 states have internal predecessors, (152), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2024-11-20 14:51:38,625 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 12 [2024-11-20 14:51:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:38,625 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2024-11-20 14:51:38,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-20 14:51:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2024-11-20 14:51:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:51:38,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:38,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:38,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:51:38,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:38,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931274, now seen corresponding path program 1 times [2024-11-20 14:51:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898600516] [2024-11-20 14:51:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:38,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:38,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898600516] [2024-11-20 14:51:38,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898600516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:38,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:38,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:51:38,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482167274] [2024-11-20 14:51:38,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:38,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:51:38,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:38,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:51:38,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:38,750 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-20 14:51:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:38,872 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-11-20 14:51:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:51:38,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2024-11-20 14:51:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:38,873 INFO L225 Difference]: With dead ends: 143 [2024-11-20 14:51:38,873 INFO L226 Difference]: Without dead ends: 143 [2024-11-20 14:51:38,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:51:38,874 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:38,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 331 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-20 14:51:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-20 14:51:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.5) internal successors, (150), 141 states have internal predecessors, (150), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2024-11-20 14:51:38,878 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 12 [2024-11-20 14:51:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:38,879 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2024-11-20 14:51:38,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-11-20 14:51:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2024-11-20 14:51:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:51:38,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:38,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:38,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:51:38,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:38,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:38,880 INFO L85 PathProgramCache]: Analyzing trace with hash -25570964, now seen corresponding path program 1 times [2024-11-20 14:51:38,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:38,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916090843] [2024-11-20 14:51:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:38,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:38,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:38,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916090843] [2024-11-20 14:51:38,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916090843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:38,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:38,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:51:38,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465993285] [2024-11-20 14:51:38,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:38,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:51:38,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:51:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:51:38,953 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:39,092 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2024-11-20 14:51:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:51:39,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-20 14:51:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:39,093 INFO L225 Difference]: With dead ends: 183 [2024-11-20 14:51:39,093 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 14:51:39,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:51:39,094 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 204 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:39,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 334 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 14:51:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 148. [2024-11-20 14:51:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 146 states have internal predecessors, (155), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2024-11-20 14:51:39,098 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 16 [2024-11-20 14:51:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:39,098 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2024-11-20 14:51:39,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2024-11-20 14:51:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:51:39,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:39,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:51:39,099 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618057, now seen corresponding path program 1 times [2024-11-20 14:51:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295775449] [2024-11-20 14:51:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295775449] [2024-11-20 14:51:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295775449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:51:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397927653] [2024-11-20 14:51:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:39,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:51:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:51:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:51:39,259 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-11-20 14:51:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:39,585 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2024-11-20 14:51:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:51:39,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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) Word has length 16 [2024-11-20 14:51:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:39,585 INFO L225 Difference]: With dead ends: 147 [2024-11-20 14:51:39,585 INFO L226 Difference]: Without dead ends: 147 [2024-11-20 14:51:39,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:51:39,586 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 147 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:39,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 288 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:51:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-20 14:51:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-20 14:51:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 105 states have (on average 1.4666666666666666) internal successors, (154), 145 states have internal predecessors, (154), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2024-11-20 14:51:39,595 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 16 [2024-11-20 14:51:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:39,595 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2024-11-20 14:51:39,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-11-20 14:51:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2024-11-20 14:51:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:51:39,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:39,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:39,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:51:39,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:39,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:39,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618056, now seen corresponding path program 1 times [2024-11-20 14:51:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:39,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541680210] [2024-11-20 14:51:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:39,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:39,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541680210] [2024-11-20 14:51:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541680210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:39,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 14:51:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176350679] [2024-11-20 14:51:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:39,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:51:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:51:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:51:39,799 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-11-20 14:51:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:40,159 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2024-11-20 14:51:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:51:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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) Word has length 16 [2024-11-20 14:51:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:40,160 INFO L225 Difference]: With dead ends: 161 [2024-11-20 14:51:40,160 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 14:51:40,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-20 14:51:40,161 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 193 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:40,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 270 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:51:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 14:51:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2024-11-20 14:51:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 149 states have internal predecessors, (162), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2024-11-20 14:51:40,164 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 16 [2024-11-20 14:51:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:40,164 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2024-11-20 14:51:40,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-11-20 14:51:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2024-11-20 14:51:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 14:51:40,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:40,165 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:40,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:51:40,165 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:40,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1685995508, now seen corresponding path program 1 times [2024-11-20 14:51:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:40,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504228982] [2024-11-20 14:51:40,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:40,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504228982] [2024-11-20 14:51:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504228982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:51:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754109247] [2024-11-20 14:51:40,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:40,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:40,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:51:40,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:51:40,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 14:51:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:40,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 14:51:40,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:51:40,397 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-11-20 14:51:40,401 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-11-20 14:51:40,422 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-11-20 14:51:40,427 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 19 treesize of output 18 [2024-11-20 14:51:40,449 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-11-20 14:51:40,457 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-11-20 14:51:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:40,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:51:40,904 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 10 treesize of output 8 [2024-11-20 14:51:40,909 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 14 treesize of output 12 [2024-11-20 14:51:40,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 10 treesize of output 8 [2024-11-20 14:51:40,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:51:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:40,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754109247] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:51:40,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:51:40,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-20 14:51:40,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250369847] [2024-11-20 14:51:40,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:51:40,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:51:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:51:40,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:51:40,930 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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-11-20 14:51:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:41,273 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2024-11-20 14:51:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:51:41,273 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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) Word has length 21 [2024-11-20 14:51:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:41,274 INFO L225 Difference]: With dead ends: 189 [2024-11-20 14:51:41,274 INFO L226 Difference]: Without dead ends: 189 [2024-11-20 14:51:41,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-20 14:51:41,275 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 331 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:41,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 539 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:51:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-20 14:51:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 158. [2024-11-20 14:51:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 156 states have internal predecessors, (170), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2024-11-20 14:51:41,277 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 21 [2024-11-20 14:51:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:41,278 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2024-11-20 14:51:41,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 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-11-20 14:51:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2024-11-20 14:51:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:51:41,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:41,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:41,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 14:51:41,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 14:51:41,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:41,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash -576308362, now seen corresponding path program 1 times [2024-11-20 14:51:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:41,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518778886] [2024-11-20 14:51:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:41,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:41,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518778886] [2024-11-20 14:51:41,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518778886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:41,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:41,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:51:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120289492] [2024-11-20 14:51:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:41,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:51:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:51:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:41,537 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-20 14:51:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:41,641 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2024-11-20 14:51:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:51:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2024-11-20 14:51:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:41,642 INFO L225 Difference]: With dead ends: 161 [2024-11-20 14:51:41,642 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 14:51:41,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:51:41,642 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 18 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:41,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 335 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 14:51:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2024-11-20 14:51:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 121 states have (on average 1.3801652892561984) internal successors, (167), 155 states have internal predecessors, (167), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2024-11-20 14:51:41,645 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 22 [2024-11-20 14:51:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:41,645 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2024-11-20 14:51:41,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-20 14:51:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2024-11-20 14:51:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:51:41,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:41,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:41,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:51:41,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:41,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:41,647 INFO L85 PathProgramCache]: Analyzing trace with hash 365917424, now seen corresponding path program 1 times [2024-11-20 14:51:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:41,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86745577] [2024-11-20 14:51:41,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:41,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:41,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86745577] [2024-11-20 14:51:41,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86745577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:41,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:41,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:51:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686152912] [2024-11-20 14:51:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:41,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:51:41,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:41,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:51:41,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:51:41,697 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:41,768 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2024-11-20 14:51:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:51:41,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-20 14:51:41,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:41,769 INFO L225 Difference]: With dead ends: 160 [2024-11-20 14:51:41,769 INFO L226 Difference]: Without dead ends: 160 [2024-11-20 14:51:41,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:41,770 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 15 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:41,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-20 14:51:41,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2024-11-20 14:51:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 154 states have internal predecessors, (165), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-20 14:51:41,773 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 24 [2024-11-20 14:51:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:41,773 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-20 14:51:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-20 14:51:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:51:41,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:41,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:51:41,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:41,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash 627434664, now seen corresponding path program 1 times [2024-11-20 14:51:41,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:41,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544767779] [2024-11-20 14:51:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:41,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:41,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544767779] [2024-11-20 14:51:41,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544767779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:41,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:41,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:51:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196993366] [2024-11-20 14:51:41,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:41,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:51:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:51:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:41,863 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:41,981 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2024-11-20 14:51:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:51:41,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-20 14:51:41,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:41,982 INFO L225 Difference]: With dead ends: 155 [2024-11-20 14:51:41,982 INFO L226 Difference]: Without dead ends: 155 [2024-11-20 14:51:41,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:51:41,983 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:41,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 321 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-20 14:51:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-20 14:51:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 153 states have internal predecessors, (164), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-20 14:51:41,986 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 24 [2024-11-20 14:51:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:41,986 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-20 14:51:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-20 14:51:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:51:41,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:41,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:41,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:51:41,987 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:41,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash 627434665, now seen corresponding path program 1 times [2024-11-20 14:51:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:41,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441951276] [2024-11-20 14:51:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:42,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441951276] [2024-11-20 14:51:42,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441951276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:42,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:42,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:51:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143930629] [2024-11-20 14:51:42,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:42,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:51:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:42,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:51:42,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:42,117 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:42,228 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2024-11-20 14:51:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:51:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-20 14:51:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:42,229 INFO L225 Difference]: With dead ends: 154 [2024-11-20 14:51:42,229 INFO L226 Difference]: Without dead ends: 154 [2024-11-20 14:51:42,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:51:42,229 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:42,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-20 14:51:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-20 14:51:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 152 states have internal predecessors, (163), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2024-11-20 14:51:42,233 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 24 [2024-11-20 14:51:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:42,233 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2024-11-20 14:51:42,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2024-11-20 14:51:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:51:42,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:42,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:42,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 14:51:42,235 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:42,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1801374639, now seen corresponding path program 1 times [2024-11-20 14:51:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:42,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290109973] [2024-11-20 14:51:42,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:42,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:42,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290109973] [2024-11-20 14:51:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290109973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:42,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:42,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:51:42,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416759046] [2024-11-20 14:51:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:42,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:51:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:42,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:51:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:51:42,344 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:42,418 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-11-20 14:51:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:51:42,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-20 14:51:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:42,419 INFO L225 Difference]: With dead ends: 154 [2024-11-20 14:51:42,419 INFO L226 Difference]: Without dead ends: 154 [2024-11-20 14:51:42,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:42,420 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:42,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-20 14:51:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2024-11-20 14:51:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 151 states have internal predecessors, (161), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2024-11-20 14:51:42,424 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 27 [2024-11-20 14:51:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:42,424 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2024-11-20 14:51:42,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2024-11-20 14:51:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:51:42,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:42,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:42,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:51:42,425 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:42,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:42,425 INFO L85 PathProgramCache]: Analyzing trace with hash -754420961, now seen corresponding path program 1 times [2024-11-20 14:51:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576111911] [2024-11-20 14:51:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:42,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:51:42,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:42,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576111911] [2024-11-20 14:51:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576111911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:42,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:42,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:51:42,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472220953] [2024-11-20 14:51:42,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:42,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:51:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:51:42,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:51:42,458 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-11-20 14:51:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:42,505 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2024-11-20 14:51:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:51:42,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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) Word has length 27 [2024-11-20 14:51:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:42,506 INFO L225 Difference]: With dead ends: 155 [2024-11-20 14:51:42,507 INFO L226 Difference]: Without dead ends: 155 [2024-11-20 14:51:42,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:51:42,508 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 64 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:42,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 121 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:51:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-20 14:51:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-20 14:51:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 153 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2024-11-20 14:51:42,510 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 27 [2024-11-20 14:51:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:42,511 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2024-11-20 14:51:42,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-11-20 14:51:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2024-11-20 14:51:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:51:42,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:42,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:42,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:51:42,512 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:42,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -303373466, now seen corresponding path program 1 times [2024-11-20 14:51:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:42,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290055161] [2024-11-20 14:51:42,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:42,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:42,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:42,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290055161] [2024-11-20 14:51:42,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290055161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:42,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:42,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:51:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019993067] [2024-11-20 14:51:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:42,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:51:42,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:42,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:51:42,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:51:42,601 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:42,717 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2024-11-20 14:51:42,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:51:42,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-20 14:51:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:42,718 INFO L225 Difference]: With dead ends: 155 [2024-11-20 14:51:42,718 INFO L226 Difference]: Without dead ends: 155 [2024-11-20 14:51:42,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:51:42,718 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 176 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:42,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 157 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-20 14:51:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-20 14:51:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 152 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2024-11-20 14:51:42,721 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 29 [2024-11-20 14:51:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:42,721 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2024-11-20 14:51:42,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2024-11-20 14:51:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:51:42,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:42,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:42,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 14:51:42,723 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:42,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:42,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2128115797, now seen corresponding path program 1 times [2024-11-20 14:51:42,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:42,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974466568] [2024-11-20 14:51:42,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:42,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974466568] [2024-11-20 14:51:42,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974466568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:42,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:42,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:51:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885149756] [2024-11-20 14:51:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:42,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:51:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:51:42,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:51:42,970 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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-11-20 14:51:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:43,257 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2024-11-20 14:51:43,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:51:43,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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) Word has length 28 [2024-11-20 14:51:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:43,258 INFO L225 Difference]: With dead ends: 149 [2024-11-20 14:51:43,258 INFO L226 Difference]: Without dead ends: 149 [2024-11-20 14:51:43,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:51:43,259 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 55 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:43,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 467 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:51:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-20 14:51:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2024-11-20 14:51:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 107 states have (on average 1.280373831775701) internal successors, (137), 129 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-20 14:51:43,261 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 28 [2024-11-20 14:51:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:43,261 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-20 14:51:43,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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-11-20 14:51:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-20 14:51:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:51:43,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:43,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:43,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 14:51:43,262 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:43,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2128115798, now seen corresponding path program 1 times [2024-11-20 14:51:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:43,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675928608] [2024-11-20 14:51:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675928608] [2024-11-20 14:51:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675928608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:43,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:51:43,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:51:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843302132] [2024-11-20 14:51:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:43,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:51:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:51:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:51:43,440 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-11-20 14:51:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:43,585 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-20 14:51:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:51:43,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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) Word has length 28 [2024-11-20 14:51:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:43,586 INFO L225 Difference]: With dead ends: 131 [2024-11-20 14:51:43,586 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 14:51:43,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:51:43,587 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 39 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:43,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 264 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 14:51:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-20 14:51:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.2710280373831775) internal successors, (136), 128 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2024-11-20 14:51:43,589 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 28 [2024-11-20 14:51:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:43,589 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2024-11-20 14:51:43,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-11-20 14:51:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2024-11-20 14:51:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:51:43,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:43,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:43,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 14:51:43,590 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:43,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash 850939202, now seen corresponding path program 1 times [2024-11-20 14:51:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:43,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134589852] [2024-11-20 14:51:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:43,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:43,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134589852] [2024-11-20 14:51:43,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134589852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:51:43,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274185300] [2024-11-20 14:51:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:43,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:51:43,658 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:51:43,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:51:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:43,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:51:43,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:51:43,730 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 13 treesize of output 9 [2024-11-20 14:51:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:51:43,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:51:43,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274185300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:51:43,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:51:43,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-20 14:51:43,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342081299] [2024-11-20 14:51:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:51:43,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:51:43,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:51:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:51:43,758 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-20 14:51:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:43,840 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2024-11-20 14:51:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:51:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) Word has length 29 [2024-11-20 14:51:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:43,841 INFO L225 Difference]: With dead ends: 137 [2024-11-20 14:51:43,842 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 14:51:43,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:51:43,842 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:43,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 263 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 14:51:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-20 14:51:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 131 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-11-20 14:51:43,847 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 29 [2024-11-20 14:51:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:43,847 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-11-20 14:51:43,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-20 14:51:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-11-20 14:51:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:51:43,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:43,848 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:43,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 14:51:44,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-20 14:51:44,049 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:44,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1002487277, now seen corresponding path program 1 times [2024-11-20 14:51:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:44,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306738358] [2024-11-20 14:51:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:44,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:44,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306738358] [2024-11-20 14:51:44,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306738358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:51:44,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244900076] [2024-11-20 14:51:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:51:44,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:51:44,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 14:51:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:44,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 14:51:44,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:51:44,342 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-11-20 14:51:44,347 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-11-20 14:51:44,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-20 14:51:44,361 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 21 treesize of output 20 [2024-11-20 14:51:44,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:44,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-20 14:51:44,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 27 treesize of output 11 [2024-11-20 14:51:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:51:44,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:51:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:51:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244900076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:51:44,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:51:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-11-20 14:51:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208470849] [2024-11-20 14:51:44,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:51:44,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:51:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:44,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:51:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:51:44,574 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-11-20 14:51:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:44,858 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2024-11-20 14:51:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:51:44,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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) Word has length 30 [2024-11-20 14:51:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:44,859 INFO L225 Difference]: With dead ends: 155 [2024-11-20 14:51:44,859 INFO L226 Difference]: Without dead ends: 155 [2024-11-20 14:51:44,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:51:44,860 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 19 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:44,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 464 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:51:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-20 14:51:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2024-11-20 14:51:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.256198347107438) internal successors, (152), 142 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2024-11-20 14:51:44,863 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 30 [2024-11-20 14:51:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:44,863 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2024-11-20 14:51:44,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-11-20 14:51:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2024-11-20 14:51:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:51:44,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:44,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:44,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 14:51:45,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:45,068 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1012334864, now seen corresponding path program 1 times [2024-11-20 14:51:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425171887] [2024-11-20 14:51:45,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:51:45,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:45,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425171887] [2024-11-20 14:51:45,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425171887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:51:45,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277139601] [2024-11-20 14:51:45,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:45,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:45,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:51:45,113 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:51:45,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 14:51:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:45,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 14:51:45,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:51:45,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 14:51:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:51:45,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:51:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:51:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277139601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:51:45,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:51:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-20 14:51:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891765945] [2024-11-20 14:51:45,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:51:45,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:51:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:51:45,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:45,284 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:45,382 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2024-11-20 14:51:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:51:45,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-20 14:51:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:45,383 INFO L225 Difference]: With dead ends: 152 [2024-11-20 14:51:45,383 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 14:51:45,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:51:45,384 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:45,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:51:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 14:51:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-20 14:51:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 127 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2024-11-20 14:51:45,407 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 31 [2024-11-20 14:51:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:45,407 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2024-11-20 14:51:45,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2024-11-20 14:51:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 14:51:45,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:45,408 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:45,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 14:51:45,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:45,609 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash 372056056, now seen corresponding path program 1 times [2024-11-20 14:51:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466206009] [2024-11-20 14:51:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:45,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466206009] [2024-11-20 14:51:45,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466206009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:51:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524348976] [2024-11-20 14:51:45,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:45,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:51:45,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:51:45,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 14:51:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:46,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-20 14:51:46,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:51:46,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:51:46,052 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-11-20 14:51:46,085 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:51:46,085 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-11-20 14:51:46,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:51:46,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-11-20 14:51:46,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:51:46,188 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:51:46,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-20 14:51:46,192 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 24 treesize of output 11 [2024-11-20 14:51:46,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-20 14:51:46,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 16 treesize of output 11 [2024-11-20 14:51:46,237 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-11-20 14:51:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:46,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:51:46,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_906 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-20 14:51:46,376 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_903) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_904) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-20 14:51:46,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_903) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_904) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_906)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-20 14:51:46,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:46,394 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 33 treesize of output 34 [2024-11-20 14:51:46,397 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 60 treesize of output 52 [2024-11-20 14:51:46,402 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 24 treesize of output 22 [2024-11-20 14:51:46,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_901 (Array Int Int))) (or (forall ((v_ArrVal_906 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_901))) (or (forall ((v_ArrVal_903 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_903) v_arrayElimCell_23 v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= v_ArrVal_901 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_901 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or .cse3 (forall ((v_ArrVal_901 (Array Int Int)) (v_ArrVal_906 (Array Int Int))) (or (not (= v_ArrVal_901 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_901 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_901) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (or (not .cse3) (forall ((v_ArrVal_901 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (v_arrayElimCell_23 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_901) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_903) v_arrayElimCell_23 v_ArrVal_906) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= v_ArrVal_901 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_901 |c_ULTIMATE.start_main_~end~0#1.offset|))))))))) is different from false [2024-11-20 14:51:49,099 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 12 treesize of output 8 [2024-11-20 14:51:49,102 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 11 treesize of output 7 [2024-11-20 14:51:49,105 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:51:49,106 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 47 treesize of output 45 [2024-11-20 14:51:49,110 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 7 treesize of output 3 [2024-11-20 14:51:49,113 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:51:49,114 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:51:49,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-20 14:51:49,117 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:51:49,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-20 14:51:49,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:51:49,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:51:49,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-20 14:51:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:49,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524348976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:51:49,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:51:49,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 25 [2024-11-20 14:51:49,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152023581] [2024-11-20 14:51:49,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:51:49,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 14:51:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:49,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 14:51:49,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=337, Unknown=14, NotChecked=164, Total=600 [2024-11-20 14:51:49,148 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:50,421 INFO L93 Difference]: Finished difference Result 209 states and 228 transitions. [2024-11-20 14:51:50,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 14:51:50,422 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-20 14:51:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:50,422 INFO L225 Difference]: With dead ends: 209 [2024-11-20 14:51:50,422 INFO L226 Difference]: Without dead ends: 209 [2024-11-20 14:51:50,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=290, Invalid=898, Unknown=18, NotChecked=276, Total=1482 [2024-11-20 14:51:50,423 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 385 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 56 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 750 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:50,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 694 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 982 Invalid, 4 Unknown, 750 Unchecked, 0.7s Time] [2024-11-20 14:51:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-20 14:51:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 155. [2024-11-20 14:51:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.2424242424242424) internal successors, (164), 153 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2024-11-20 14:51:50,426 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 37 [2024-11-20 14:51:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:50,426 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2024-11-20 14:51:50,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2024-11-20 14:51:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:51:50,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:50,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:50,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 14:51:50,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-20 14:51:50,628 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:50,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash 764553448, now seen corresponding path program 1 times [2024-11-20 14:51:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:50,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333738733] [2024-11-20 14:51:50,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:50,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333738733] [2024-11-20 14:51:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333738733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:51:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009767081] [2024-11-20 14:51:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:50,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:50,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:51:50,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:51:50,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 14:51:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:51,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-20 14:51:51,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:51:51,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:51:51,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:51:51,148 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-11-20 14:51:51,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:51:51,243 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:51:51,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-20 14:51:51,309 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-20 14:51:51,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-20 14:51:51,351 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:51:51,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-20 14:51:51,466 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 25 treesize of output 13 [2024-11-20 14:51:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:51,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:51:51,661 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-20 14:51:51,662 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 19 treesize of output 18 [2024-11-20 14:51:51,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:51,907 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 51 treesize of output 36 [2024-11-20 14:51:51,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:51,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 408 treesize of output 343 [2024-11-20 14:51:51,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:51,936 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 287 treesize of output 263 [2024-11-20 14:51:51,942 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 255 treesize of output 239 [2024-11-20 14:51:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009767081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:51:52,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:51:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2024-11-20 14:51:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395232906] [2024-11-20 14:51:52,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:51:52,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-20 14:51:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:52,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-20 14:51:52,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1113, Unknown=31, NotChecked=0, Total=1260 [2024-11-20 14:51:52,325 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 36 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:53,318 INFO L93 Difference]: Finished difference Result 242 states and 264 transitions. [2024-11-20 14:51:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 14:51:53,318 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-20 14:51:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:53,319 INFO L225 Difference]: With dead ends: 242 [2024-11-20 14:51:53,319 INFO L226 Difference]: Without dead ends: 242 [2024-11-20 14:51:53,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=276, Invalid=1855, Unknown=31, NotChecked=0, Total=2162 [2024-11-20 14:51:53,320 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 444 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:53,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 750 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 14:51:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-20 14:51:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 189. [2024-11-20 14:51:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.216867469879518) internal successors, (202), 187 states have internal predecessors, (202), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2024-11-20 14:51:53,323 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 42 [2024-11-20 14:51:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:53,323 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2024-11-20 14:51:53,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2024-11-20 14:51:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:51:53,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:53,324 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:53,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-20 14:51:53,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:53,528 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 764553449, now seen corresponding path program 1 times [2024-11-20 14:51:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366490768] [2024-11-20 14:51:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:53,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366490768] [2024-11-20 14:51:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366490768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:51:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364129676] [2024-11-20 14:51:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:53,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:51:53,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:51:53,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 14:51:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:54,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-20 14:51:54,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:51:54,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:51:54,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 14:51:54,115 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:51:54,115 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-11-20 14:51:54,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:51:54,145 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 15 treesize of output 1 [2024-11-20 14:51:54,234 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:51:54,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-20 14:51:54,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 24 treesize of output 11 [2024-11-20 14:51:54,335 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:51:54,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-20 14:51:54,350 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-20 14:51:54,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-20 14:51:54,405 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:51:54,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-20 14:51:54,409 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 24 treesize of output 11 [2024-11-20 14:51:54,564 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 25 treesize of output 13 [2024-11-20 14:51:54,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-20 14:51:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:54,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:51:55,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:55,543 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 162 treesize of output 139 [2024-11-20 14:51:55,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:55,550 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 130 treesize of output 107 [2024-11-20 14:51:55,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:55,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 712 treesize of output 643 [2024-11-20 14:51:55,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:55,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1990 treesize of output 1904 [2024-11-20 14:51:55,639 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 698 treesize of output 674 [2024-11-20 14:51:55,658 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 674 treesize of output 650 [2024-11-20 14:51:55,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:55,707 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 650 treesize of output 607 [2024-11-20 14:51:55,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:55,730 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 598 treesize of output 597 [2024-11-20 14:51:55,744 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 588 treesize of output 580 [2024-11-20 14:51:55,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:51:55,766 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 580 treesize of output 585 [2024-11-20 14:51:55,777 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 576 treesize of output 570 [2024-11-20 14:51:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:56,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364129676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:51:56,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:51:56,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2024-11-20 14:51:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010966254] [2024-11-20 14:51:56,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:51:56,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-20 14:51:56,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:51:56,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-20 14:51:56,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1412, Unknown=24, NotChecked=0, Total=1560 [2024-11-20 14:51:56,840 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 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-11-20 14:51:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:51:58,502 INFO L93 Difference]: Finished difference Result 245 states and 267 transitions. [2024-11-20 14:51:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 14:51:58,506 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 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) Word has length 42 [2024-11-20 14:51:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:51:58,507 INFO L225 Difference]: With dead ends: 245 [2024-11-20 14:51:58,507 INFO L226 Difference]: Without dead ends: 245 [2024-11-20 14:51:58,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=345, Invalid=2601, Unknown=24, NotChecked=0, Total=2970 [2024-11-20 14:51:58,508 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 484 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:51:58,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1043 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 14:51:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-20 14:51:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 192. [2024-11-20 14:51:58,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 169 states have (on average 1.21301775147929) internal successors, (205), 190 states have internal predecessors, (205), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:51:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2024-11-20 14:51:58,520 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 42 [2024-11-20 14:51:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:51:58,521 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2024-11-20 14:51:58,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 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-11-20 14:51:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2024-11-20 14:51:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 14:51:58,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:51:58,521 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:51:58,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 14:51:58,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:58,721 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-20 14:51:58,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:51:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash -87872669, now seen corresponding path program 1 times [2024-11-20 14:51:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:51:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858086923] [2024-11-20 14:51:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:51:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:51:59,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:51:59,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858086923] [2024-11-20 14:51:59,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858086923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:51:59,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123031596] [2024-11-20 14:51:59,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:51:59,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:51:59,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:51:59,474 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:51:59,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 14:51:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:51:59,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-20 14:51:59,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:51:59,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:51:59,614 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-11-20 14:51:59,680 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:51:59,681 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-11-20 14:51:59,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:51:59,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 14:51:59,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:51:59,807 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:51:59,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-20 14:51:59,810 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 24 treesize of output 11 [2024-11-20 14:51:59,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-20 14:51:59,859 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-11-20 14:51:59,901 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-11-20 14:51:59,914 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:51:59,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:51:59,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:51:59,953 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-11-20 14:51:59,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:52:00,052 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-20 14:52:00,052 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-20 14:52:00,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-20 14:52:00,070 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-20 14:52:00,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-20 14:52:00,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-20 14:52:00,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-20 14:52:00,179 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:52:00,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-20 14:52:00,216 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-20 14:52:00,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-20 14:52:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:00,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:52:00,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:00,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 14:52:00,516 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1265 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_101| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_1266) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1265) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1) (< |v_ULTIMATE.start_main_~end~0#1.offset_101| 0) (not (= (select v_arrayElimArr_5 (+ |v_ULTIMATE.start_main_~end~0#1.offset_101| 8)) 1)) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1267) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_101|)))) is different from false [2024-11-20 14:52:00,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:00,535 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 33 treesize of output 34 [2024-11-20 14:52:00,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-20 14:52:00,544 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 24 treesize of output 22 [2024-11-20 14:52:00,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:00,549 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 18 treesize of output 19 [2024-11-20 14:52:00,554 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 30 treesize of output 22 [2024-11-20 14:52:00,559 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 11 treesize of output 9 [2024-11-20 14:52:01,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:01,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 103 [2024-11-20 14:52:01,245 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= v_prenex_21 |c_ULTIMATE.start_main_~end~0#1.base|) (not (= (select v_prenex_20 8) 1)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1264))) (or (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_~end~0#1.base|)))))) is different from false [2024-11-20 14:52:01,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= v_prenex_21 |c_ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select v_prenex_20 8) 1)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1264))) (or (= (select (select (store (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~mem5#1.base|) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))) is different from false [2024-11-20 14:52:01,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| .cse0 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= .cse0 v_prenex_21) (not (= (select v_prenex_20 8) 1)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse2 (store |c_#memory_int#1| .cse0 v_ArrVal_1264))) (or (not (= (select v_arrayElimArr_5 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| .cse0) (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) is different from false [2024-11-20 14:52:01,323 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1259) .cse2 v_ArrVal_1264))) (or (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| .cse2) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select v_prenex_20 8) 1)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1259) .cse3 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= .cse3 v_prenex_21)))))) is different from false [2024-11-20 14:52:01,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1258) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= .cse0 v_prenex_21) (= (select (select (store (store (store |c_#memory_int#1| .cse1 v_ArrVal_1259) .cse0 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_20 8) 1))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1258) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_int#1| .cse1 v_ArrVal_1259) .cse3 v_ArrVal_1264))) (or (= .cse3 |v_ULTIMATE.start_main_#t~malloc7#1.base_13|) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse4 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) is different from false [2024-11-20 14:52:01,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:01,379 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 162 treesize of output 131 [2024-11-20 14:52:01,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 219 [2024-11-20 14:52:01,395 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 205 treesize of output 199 [2024-11-20 14:52:01,400 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 199 treesize of output 195 [2024-11-20 14:52:02,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse4 (not .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (or .cse0 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_20 8) 1))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_prenex_21 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (forall ((v_arrayElimCell_94 Int)) (or (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (not (= (select v_prenex_20 8) 1)))) (= v_prenex_21 v_arrayElimCell_94))))))) (or .cse4 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= (select v_arrayElimArr_5 8) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimCell_93 Int) (v_ArrVal_1259 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse9 (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))))))) (or .cse0 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_prenex_21 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_20 8) 1)))))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_prenex_21 Int)) (or (forall ((v_arrayElimCell_94 Int) (v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (not (= (select v_prenex_20 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21))))))) (or .cse4 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= (select v_arrayElimArr_5 8) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))))) (or .cse4 (forall ((v_arrayElimCell_94 Int) (v_prenex_20 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int))) (or (= v_prenex_21 v_arrayElimCell_94) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (not (= (select v_prenex_20 8) 1))))) (or .cse0 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_93 Int) (v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))))) (or (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_arrayElimCell_94 Int) (v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int))) (or (= v_prenex_21 v_arrayElimCell_94) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_20 8) 1)))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((v_arrayElimCell_94 Int) (v_prenex_21 Int)) (or (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (not (= (select v_prenex_20 8) 1)))) (= v_prenex_21 v_arrayElimCell_94))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256))))) .cse4) (or .cse4 (forall ((v_arrayElimCell_93 Int) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1259 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse19 (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (= (select (select (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93)))))) (or .cse0 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (= (select (select (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store .cse21 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256))))))) is different from false [2024-11-20 14:52:16,364 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 163 [2024-11-20 14:52:16,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,385 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:52:16,385 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 14 treesize of output 11 [2024-11-20 14:52:16,387 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 7 treesize of output 3 [2024-11-20 14:52:16,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,394 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 11 treesize of output 7 [2024-11-20 14:52:16,396 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 12 treesize of output 8 [2024-11-20 14:52:16,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-20 14:52:16,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,411 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:52:16,411 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 14 treesize of output 11 [2024-11-20 14:52:16,417 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 163 [2024-11-20 14:52:16,426 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 29 treesize of output 25 [2024-11-20 14:52:16,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,439 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:52:16,439 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 14 treesize of output 11 [2024-11-20 14:52:16,446 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,449 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 165 treesize of output 163 [2024-11-20 14:52:16,459 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 29 treesize of output 25 [2024-11-20 14:52:16,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,476 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:52:16,476 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 14 treesize of output 11 [2024-11-20 14:52:16,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 288 [2024-11-20 14:52:16,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,504 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:52:16,504 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 14 treesize of output 11 [2024-11-20 14:52:16,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-20 14:52:16,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-20 14:52:16,515 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:52:16,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-20 14:52:16,526 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:52:16,526 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 14 treesize of output 11 [2024-11-20 14:52:16,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-20 14:52:16,534 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 163 [2024-11-20 14:52:16,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,553 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:52:16,553 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 14 treesize of output 11 [2024-11-20 14:52:16,558 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 7 treesize of output 3 [2024-11-20 14:52:16,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,566 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 290 treesize of output 288 [2024-11-20 14:52:16,576 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:52:16,584 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:52:16,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2024-11-20 14:52:16,587 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 7 treesize of output 3 [2024-11-20 14:52:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:52:21,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123031596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:52:21,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:52:21,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 53 [2024-11-20 14:52:21,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598280478] [2024-11-20 14:52:21,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:52:21,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-20 14:52:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:52:21,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-20 14:52:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1772, Unknown=17, NotChecked=658, Total=2756 [2024-11-20 14:52:21,302 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand has 53 states, 53 states have (on average 2.169811320754717) internal successors, (115), 53 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:52:22,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse4 (not .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) 8) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) 1) (or .cse0 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_20 8) 1))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_prenex_21 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (forall ((v_arrayElimCell_94 Int)) (or (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (not (= (select v_prenex_20 8) 1)))) (= v_prenex_21 v_arrayElimCell_94))))))) (or .cse4 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= (select v_arrayElimArr_5 8) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimCell_93 Int) (v_ArrVal_1259 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse9 (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse9 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))))))) (or .cse0 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_prenex_21 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_20 8) 1)))))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_prenex_21 Int)) (or (forall ((v_arrayElimCell_94 Int) (v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (not (= (select v_prenex_20 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21))))))) (or .cse4 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= (select v_arrayElimArr_5 8) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (or .cse4 (forall ((v_arrayElimCell_94 Int) (v_prenex_20 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int))) (or (= v_prenex_21 v_arrayElimCell_94) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (not (= (select v_prenex_20 8) 1))))) (or .cse0 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_93 Int) (v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store .cse15 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))))) (or (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_arrayElimCell_94 Int) (v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int))) (or (= v_prenex_21 v_arrayElimCell_94) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_prenex_20 8) 1)))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((v_arrayElimCell_94 Int) (v_prenex_21 Int)) (or (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (not (= (select v_prenex_20 8) 1)))) (= v_prenex_21 v_arrayElimCell_94))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256))))) .cse4) (or .cse4 (forall ((v_arrayElimCell_93 Int) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1259 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse19 (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (= (select (select (store .cse19 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_101| Int)) (or (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_101|) (< |v_ULTIMATE.start_main_~end~0#1.offset_101| 0) (not (= (select v_arrayElimArr_5 (+ |v_ULTIMATE.start_main_~end~0#1.offset_101| 8)) 1)))) (or .cse0 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (= (select (select (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse20 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store .cse21 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (= (select .cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) 1)))) is different from false [2024-11-20 14:52:23,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse0 (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) 8) 1)) (.cse15 (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse5 (not .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) 1) (or .cse1 (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_prenex_20 8) 1))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_prenex_21 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (forall ((v_arrayElimCell_94 Int)) (or (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (= (select (select (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))) (not (= (select v_prenex_20 8) 1)))) (= v_prenex_21 v_arrayElimCell_94))))))) (or .cse5 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))) (not (= (select v_arrayElimArr_5 8) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)) (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimCell_93 Int) (v_ArrVal_1259 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse10 (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_arrayElimCell_93 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))))))) (or .cse1 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_prenex_21 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_prenex_20 8) 1)))))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_prenex_21 Int)) (or (forall ((v_arrayElimCell_94 Int) (v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))) (not (= (select v_prenex_20 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21))))))) (or .cse5 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))) (not (= (select v_arrayElimArr_5 8) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))))) (not .cse15) (or .cse5 (forall ((v_arrayElimCell_94 Int) (v_prenex_20 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int))) (or (= v_prenex_21 v_arrayElimCell_94) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (not (= (select v_prenex_20 8) 1))))) (= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (or .cse0 .cse15) (or .cse1 (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (= (select (select (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= (select (select (store (store .cse16 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_93 Int) (v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)) (= (select (select (store .cse17 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))))) (or (and (forall ((v_ArrVal_1256 (Array Int Int))) (or (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (forall ((v_arrayElimCell_94 Int) (v_prenex_20 (Array Int Int)) (v_prenex_21 Int) (v_prenex_22 (Array Int Int)) (v_prenex_29 (Array Int Int))) (or (= v_prenex_21 v_arrayElimCell_94) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_prenex_20 8) 1)))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((v_arrayElimCell_94 Int) (v_prenex_21 Int)) (or (forall ((v_prenex_20 (Array Int Int))) (or (forall ((v_prenex_22 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (or (= (select (select (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse19 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_94 v_prenex_22) v_prenex_21 v_prenex_20) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1))))) (not (= (select v_prenex_20 8) 1)))) (= v_prenex_21 v_arrayElimCell_94))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256))))) .cse5) (or .cse5 (forall ((v_arrayElimCell_93 Int) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1259 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse21 (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264))) (or (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)) (= (select (select (store .cse21 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93)))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_101| Int)) (or (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_101|) (< |v_ULTIMATE.start_main_~end~0#1.offset_101| 0) (not (= (select v_arrayElimArr_5 (+ |v_ULTIMATE.start_main_~end~0#1.offset_101| 8)) 1)))) (= (select .cse2 8) 1) (or .cse1 (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int) (v_ArrVal_1266 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_arrayElimCell_86 Int)) (let ((.cse22 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (= (select (select (store .cse22 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (select v_arrayElimArr_5 8) 1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse22 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256)))))) (forall ((v_ArrVal_1256 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_13| Int)) (or (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 8) 1)) (forall ((v_ArrVal_1264 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1256))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1264))) (or (forall ((v_ArrVal_1266 (Array Int Int)) (v_arrayElimCell_86 Int)) (= (select (select (store (store .cse23 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_ArrVal_1266) v_arrayElimCell_86 v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)) (= (select (select (store .cse23 |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1) (forall ((v_ArrVal_1259 (Array Int Int))) (= (select (select (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1259) v_arrayElimCell_93 v_ArrVal_1264) |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|) .cse3) 1)))))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| v_arrayElimCell_93))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) (not (= (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1256 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1256))))))) is different from false [2024-11-20 14:52:33,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-20 14:52:37,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-20 14:52:42,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-20 14:52:46,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-20 14:52:48,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-20 14:52:54,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-20 14:52:58,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-20 14:53:04,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-20 14:53:11,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]