./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 4a390ef5 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-dev-4a390ef-m [2024-10-24 16:30:03,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:30:03,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:30:03,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:30:03,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:30:03,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:30:03,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:30:03,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:30:03,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:30:03,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:30:03,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:30:03,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:30:03,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:30:03,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:30:03,905 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:30:03,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:30:03,906 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:30:03,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:30:03,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:30:03,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:30:03,911 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:30:03,911 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:30:03,912 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:30:03,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:30:03,912 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:30:03,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:30:03,916 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:30:03,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:30:03,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:30:03,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:30:03,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:30:03,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:30:03,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:30:03,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:30:03,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:30:03,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:30:03,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:30:03,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:30:03,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:30:03,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:30:03,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:30:03,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:30:03,919 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-10-24 16:30:04,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:30:04,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:30:04,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:30:04,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:30:04,205 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:30:04,206 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-10-24 16:30:05,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:30:05,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:30:05,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-10-24 16:30:05,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726e2d23a/8fc023dbe5ff49de83e465d880549329/FLAG4363cecb0 [2024-10-24 16:30:05,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726e2d23a/8fc023dbe5ff49de83e465d880549329 [2024-10-24 16:30:05,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:30:05,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:30:05,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:30:05,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:30:05,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:30:05,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:30:05" (1/1) ... [2024-10-24 16:30:05,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d891f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:05, skipping insertion in model container [2024-10-24 16:30:05,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:30:05" (1/1) ... [2024-10-24 16:30:05,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:30:06,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:30:06,039 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:30:06,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:30:06,113 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:30:06,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06 WrapperNode [2024-10-24 16:30:06,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:30:06,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:30:06,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:30:06,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:30:06,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,158 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2024-10-24 16:30:06,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:30:06,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:30:06,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:30:06,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:30:06,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,187 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-10-24 16:30:06,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:30:06,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:30:06,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:30:06,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:30:06,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (1/1) ... [2024-10-24 16:30:06,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:30:06,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:06,241 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-10-24 16:30:06,243 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-10-24 16:30:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 16:30:06,287 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 16:30:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:30:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:30:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:30:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:30:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:30:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:30:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:30:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:30:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:30:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:30:06,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:30:06,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:30:06,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:30:06,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:30:06,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:30:06,427 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:30:06,429 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:30:06,778 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-24 16:30:06,778 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:30:06,826 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:30:06,827 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-24 16:30:06,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:30:06 BoogieIcfgContainer [2024-10-24 16:30:06,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:30:06,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:30:06,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:30:06,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:30:06,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:30:05" (1/3) ... [2024-10-24 16:30:06,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c527d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:30:06, skipping insertion in model container [2024-10-24 16:30:06,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:30:06" (2/3) ... [2024-10-24 16:30:06,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c527d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:30:06, skipping insertion in model container [2024-10-24 16:30:06,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:30:06" (3/3) ... [2024-10-24 16:30:06,834 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-10-24 16:30:06,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:30:06,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-10-24 16:30:06,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:30:06,900 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;@42906e0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:30:06,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-10-24 16:30:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 71 states have (on average 2.352112676056338) internal successors, (167), 136 states have internal predecessors, (167), 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-10-24 16:30:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:30:06,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:06,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:30:06,914 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-10-24 16:30:06,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:06,920 INFO L85 PathProgramCache]: Analyzing trace with hash 11297, now seen corresponding path program 1 times [2024-10-24 16:30:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:06,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791058127] [2024-10-24 16:30:06,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:07,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:07,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791058127] [2024-10-24 16:30:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791058127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:07,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:07,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:30:07,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371354928] [2024-10-24 16:30:07,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:07,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:30:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:07,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:30:07,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:30:07,119 INFO L87 Difference]: Start difference. First operand has 145 states, 71 states have (on average 2.352112676056338) internal successors, (167), 136 states have internal predecessors, (167), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:07,260 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2024-10-24 16:30:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:30:07,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-24 16:30:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:07,270 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:30:07,270 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:30:07,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-24 16:30:07,276 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 104 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:07,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 83 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:30:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 16:30:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 128 states have internal predecessors, (136), 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-10-24 16:30:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2024-10-24 16:30:07,317 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 2 [2024-10-24 16:30:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:07,318 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2024-10-24 16:30:07,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2024-10-24 16:30:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:30:07,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:07,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:30:07,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:30:07,320 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-10-24 16:30:07,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash 11298, now seen corresponding path program 1 times [2024-10-24 16:30:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:07,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351180083] [2024-10-24 16:30:07,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:07,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:07,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351180083] [2024-10-24 16:30:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351180083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:07,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:07,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:30:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976012514] [2024-10-24 16:30:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:07,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:30:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:30:07,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:30:07,421 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:07,530 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2024-10-24 16:30:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:30:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-24 16:30:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:07,531 INFO L225 Difference]: With dead ends: 132 [2024-10-24 16:30:07,532 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 16:30:07,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-24 16:30:07,533 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:07,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 95 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 16:30:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-24 16:30:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 130 states have internal predecessors, (138), 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-10-24 16:30:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2024-10-24 16:30:07,544 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 2 [2024-10-24 16:30:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:07,544 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2024-10-24 16:30:07,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2024-10-24 16:30:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:30:07,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:07,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:07,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:30:07,546 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-10-24 16:30:07,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1296171485, now seen corresponding path program 1 times [2024-10-24 16:30:07,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:07,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215948386] [2024-10-24 16:30:07,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:07,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:07,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:07,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215948386] [2024-10-24 16:30:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215948386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:07,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:07,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:30:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799658003] [2024-10-24 16:30:07,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:07,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:30:07,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:07,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:30:07,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:30:07,782 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:07,927 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2024-10-24 16:30:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:30:07,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 16:30:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:07,928 INFO L225 Difference]: With dead ends: 119 [2024-10-24 16:30:07,929 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 16:30:07,929 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-10-24 16:30:07,930 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 135 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:07,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 68 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 16:30:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-24 16:30:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.7638888888888888) internal successors, (127), 117 states have internal predecessors, (127), 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-10-24 16:30:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2024-10-24 16:30:07,935 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 7 [2024-10-24 16:30:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:07,935 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2024-10-24 16:30:07,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2024-10-24 16:30:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:30:07,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:07,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:07,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:30:07,936 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-10-24 16:30:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1296171486, now seen corresponding path program 1 times [2024-10-24 16:30:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359145309] [2024-10-24 16:30:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:08,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:08,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359145309] [2024-10-24 16:30:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359145309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:08,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:08,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:08,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099156987] [2024-10-24 16:30:08,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:08,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:30:08,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:08,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:30:08,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:30:08,070 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:08,229 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2024-10-24 16:30:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:30:08,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 16:30:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:08,233 INFO L225 Difference]: With dead ends: 130 [2024-10-24 16:30:08,233 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:30:08,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:08,235 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 228 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:08,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 100 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:30:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-10-24 16:30:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 125 states have internal predecessors, (138), 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-10-24 16:30:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2024-10-24 16:30:08,244 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 7 [2024-10-24 16:30:08,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:08,245 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2024-10-24 16:30:08,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2024-10-24 16:30:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:30:08,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:08,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:08,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:30:08,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:08,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:08,246 INFO L85 PathProgramCache]: Analyzing trace with hash 80563974, now seen corresponding path program 1 times [2024-10-24 16:30:08,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:08,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341357083] [2024-10-24 16:30:08,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:08,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:08,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:08,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341357083] [2024-10-24 16:30:08,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341357083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:08,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:08,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:08,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713391958] [2024-10-24 16:30:08,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:08,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:30:08,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:08,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:30:08,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:30:08,322 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:08,488 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2024-10-24 16:30:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:30:08,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-10-24 16:30:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:08,489 INFO L225 Difference]: With dead ends: 126 [2024-10-24 16:30:08,489 INFO L226 Difference]: Without dead ends: 126 [2024-10-24 16:30:08,489 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-10-24 16:30:08,490 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:08,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 298 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-24 16:30:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-24 16:30:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.6790123456790123) internal successors, (136), 124 states have internal predecessors, (136), 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-10-24 16:30:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2024-10-24 16:30:08,495 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 9 [2024-10-24 16:30:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:08,495 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2024-10-24 16:30:08,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2024-10-24 16:30:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 16:30:08,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:08,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:08,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:30:08,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:08,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 80563975, now seen corresponding path program 1 times [2024-10-24 16:30:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:08,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672075143] [2024-10-24 16:30:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:08,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:08,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672075143] [2024-10-24 16:30:08,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672075143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:08,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:08,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:08,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274830754] [2024-10-24 16:30:08,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:08,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:30:08,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:08,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:30:08,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:30:08,643 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:08,768 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2024-10-24 16:30:08,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:30:08,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-10-24 16:30:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:08,769 INFO L225 Difference]: With dead ends: 125 [2024-10-24 16:30:08,769 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 16:30:08,770 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-10-24 16:30:08,770 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:08,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 281 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 16:30:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-10-24 16:30:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.654320987654321) internal successors, (134), 123 states have internal predecessors, (134), 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-10-24 16:30:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2024-10-24 16:30:08,774 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 9 [2024-10-24 16:30:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:08,775 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2024-10-24 16:30:08,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2024-10-24 16:30:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:30:08,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:08,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:08,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:30:08,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:08,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash -108161392, now seen corresponding path program 1 times [2024-10-24 16:30:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719699077] [2024-10-24 16:30:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719699077] [2024-10-24 16:30:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719699077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:08,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:08,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:30:08,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113508250] [2024-10-24 16:30:08,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:08,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:30:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:08,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:30:08,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:30:08,812 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-24 16:30:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:08,895 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2024-10-24 16:30:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:30:08,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-10-24 16:30:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:08,896 INFO L225 Difference]: With dead ends: 129 [2024-10-24 16:30:08,896 INFO L226 Difference]: Without dead ends: 129 [2024-10-24 16:30:08,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-24 16:30:08,896 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 109 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:08,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 151 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-24 16:30:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2024-10-24 16:30:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.617283950617284) internal successors, (131), 122 states have internal predecessors, (131), 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-10-24 16:30:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2024-10-24 16:30:08,900 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 11 [2024-10-24 16:30:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:08,901 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2024-10-24 16:30:08,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-24 16:30:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2024-10-24 16:30:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:30:08,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:08,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:08,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:30:08,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:08,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:08,902 INFO L85 PathProgramCache]: Analyzing trace with hash 112853709, now seen corresponding path program 1 times [2024-10-24 16:30:08,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:08,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377373136] [2024-10-24 16:30:08,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:08,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:09,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:09,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377373136] [2024-10-24 16:30:09,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377373136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:09,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:09,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:30:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664872317] [2024-10-24 16:30:09,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:09,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:30:09,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:09,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:30:09,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:30:09,056 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:09,329 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2024-10-24 16:30:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:09,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 11 [2024-10-24 16:30:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:09,330 INFO L225 Difference]: With dead ends: 123 [2024-10-24 16:30:09,330 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 16:30:09,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:30:09,331 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 127 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:09,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 203 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:30:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 16:30:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-24 16:30:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 121 states have internal predecessors, (130), 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-10-24 16:30:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2024-10-24 16:30:09,335 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 11 [2024-10-24 16:30:09,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:09,335 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2024-10-24 16:30:09,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2024-10-24 16:30:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:30:09,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:09,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:09,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 16:30:09,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:09,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash 112853710, now seen corresponding path program 1 times [2024-10-24 16:30:09,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:09,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975852233] [2024-10-24 16:30:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:09,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975852233] [2024-10-24 16:30:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975852233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:09,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:30:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589194859] [2024-10-24 16:30:09,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:09,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:30:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:30:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:30:09,537 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:10,050 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2024-10-24 16:30:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:30:10,050 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 11 [2024-10-24 16:30:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:10,051 INFO L225 Difference]: With dead ends: 135 [2024-10-24 16:30:10,051 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 16:30:10,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:30:10,052 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 167 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:10,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 258 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:30:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 16:30:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2024-10-24 16:30:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 123 states have internal predecessors, (135), 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-10-24 16:30:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2024-10-24 16:30:10,061 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 11 [2024-10-24 16:30:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:10,061 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2024-10-24 16:30:10,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2024-10-24 16:30:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:30:10,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:10,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:10,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 16:30:10,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:10,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1657316670, now seen corresponding path program 1 times [2024-10-24 16:30:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963077840] [2024-10-24 16:30:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:10,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963077840] [2024-10-24 16:30:10,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963077840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:10,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:10,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:30:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140619233] [2024-10-24 16:30:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:10,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:30:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:30:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:30:10,165 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-10-24 16:30:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:10,413 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2024-10-24 16:30:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:30:10,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2024-10-24 16:30:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:10,416 INFO L225 Difference]: With dead ends: 164 [2024-10-24 16:30:10,416 INFO L226 Difference]: Without dead ends: 164 [2024-10-24 16:30:10,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-10-24 16:30:10,417 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 176 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:10,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 243 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:30:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-24 16:30:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2024-10-24 16:30:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 130 states have internal predecessors, (143), 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-10-24 16:30:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2024-10-24 16:30:10,425 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 14 [2024-10-24 16:30:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:10,425 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2024-10-24 16:30:10,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-10-24 16:30:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2024-10-24 16:30:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:30:10,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:10,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:10,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:30:10,426 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:10,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -905550920, now seen corresponding path program 1 times [2024-10-24 16:30:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:10,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860396240] [2024-10-24 16:30:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860396240] [2024-10-24 16:30:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860396240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:10,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:10,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:10,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954184656] [2024-10-24 16:30:10,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:10,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:30:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:10,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:30:10,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:30:10,548 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:10,638 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2024-10-24 16:30:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:30:10,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-10-24 16:30:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:10,639 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:30:10,639 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:30:10,639 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-10-24 16:30:10,639 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:10,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 274 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:30:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-24 16:30:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 129 states have internal predecessors, (142), 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-10-24 16:30:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2024-10-24 16:30:10,643 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 16 [2024-10-24 16:30:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:10,643 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2024-10-24 16:30:10,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2024-10-24 16:30:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:30:10,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:10,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:10,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:30:10,644 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:10,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash -905550919, now seen corresponding path program 1 times [2024-10-24 16:30:10,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:10,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182440654] [2024-10-24 16:30:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:10,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:10,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182440654] [2024-10-24 16:30:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182440654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:10,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:10,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035265156] [2024-10-24 16:30:10,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:10,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:30:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:30:10,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:30:10,805 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:10,916 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2024-10-24 16:30:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:30:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-10-24 16:30:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:10,917 INFO L225 Difference]: With dead ends: 130 [2024-10-24 16:30:10,917 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:30:10,917 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-10-24 16:30:10,918 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:10,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 262 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:30:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 16:30:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.46875) internal successors, (141), 128 states have internal predecessors, (141), 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-10-24 16:30:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2024-10-24 16:30:10,920 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 16 [2024-10-24 16:30:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:10,921 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2024-10-24 16:30:10,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2024-10-24 16:30:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:30:10,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:10,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:10,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 16:30:10,922 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-10-24 16:30:10,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2004592475, now seen corresponding path program 1 times [2024-10-24 16:30:10,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:10,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409048444] [2024-10-24 16:30:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:10,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409048444] [2024-10-24 16:30:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409048444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:10,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792812292] [2024-10-24 16:30:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:10,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:30:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:10,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:30:10,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:30:10,973 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10-24 16:30:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:11,043 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2024-10-24 16:30:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:30:11,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 18 [2024-10-24 16:30:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:11,044 INFO L225 Difference]: With dead ends: 129 [2024-10-24 16:30:11,044 INFO L226 Difference]: Without dead ends: 129 [2024-10-24 16:30:11,044 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-10-24 16:30:11,045 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:11,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 196 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-24 16:30:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-24 16:30:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 127 states have internal predecessors, (139), 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-10-24 16:30:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2024-10-24 16:30:11,047 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 18 [2024-10-24 16:30:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:11,048 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2024-10-24 16:30:11,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10-24 16:30:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2024-10-24 16:30:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:30:11,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:11,048 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:11,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 16:30:11,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:11,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1635894325, now seen corresponding path program 1 times [2024-10-24 16:30:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952263152] [2024-10-24 16:30:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952263152] [2024-10-24 16:30:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952263152] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183831929] [2024-10-24 16:30:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:11,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:11,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:11,165 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-10-24 16:30:11,166 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-10-24 16:30:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:11,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 16:30:11,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:11,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:30:11,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:30:11,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 16:30:11,366 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-10-24 16:30:11,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 16:30:11,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-24 16:30:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:11,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:11,803 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-10-24 16:30:11,808 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-10-24 16:30:11,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-24 16:30:11,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:11,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183831929] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:11,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:11,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2024-10-24 16:30:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699152822] [2024-10-24 16:30:11,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:11,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:30:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:11,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:30:11,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:30:11,830 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:12,101 INFO L93 Difference]: Finished difference Result 162 states and 186 transitions. [2024-10-24 16:30:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:30:12,102 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-24 16:30:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:12,102 INFO L225 Difference]: With dead ends: 162 [2024-10-24 16:30:12,102 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 16:30:12,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:30:12,103 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 164 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:12,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 331 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:30:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 16:30:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2024-10-24 16:30:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.4508196721311475) internal successors, (177), 153 states have internal predecessors, (177), 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-10-24 16:30:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2024-10-24 16:30:12,106 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 18 [2024-10-24 16:30:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:12,106 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2024-10-24 16:30:12,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:12,106 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2024-10-24 16:30:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:30:12,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:12,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:12,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:30:12,310 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,SelfDestructingSolverStorable13 [2024-10-24 16:30:12,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:12,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1644178272, now seen corresponding path program 1 times [2024-10-24 16:30:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:12,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299546452] [2024-10-24 16:30:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:12,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299546452] [2024-10-24 16:30:12,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299546452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:12,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:12,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 16:30:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919714501] [2024-10-24 16:30:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:12,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:30:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:12,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:30:12,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:30:12,644 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:13,036 INFO L93 Difference]: Finished difference Result 151 states and 178 transitions. [2024-10-24 16:30:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:30:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-24 16:30:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:13,037 INFO L225 Difference]: With dead ends: 151 [2024-10-24 16:30:13,037 INFO L226 Difference]: Without dead ends: 151 [2024-10-24 16:30:13,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-10-24 16:30:13,038 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 124 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:13,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 323 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:30:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-24 16:30:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2024-10-24 16:30:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 132 states have internal predecessors, (153), 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-10-24 16:30:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2024-10-24 16:30:13,041 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 18 [2024-10-24 16:30:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:13,041 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2024-10-24 16:30:13,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2024-10-24 16:30:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:30:13,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:13,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:30:13,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 16:30:13,042 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:13,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1644178271, now seen corresponding path program 1 times [2024-10-24 16:30:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644235041] [2024-10-24 16:30:13,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:13,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644235041] [2024-10-24 16:30:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644235041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:13,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:30:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247642984] [2024-10-24 16:30:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:13,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:30:13,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:30:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:30:13,180 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:13,312 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2024-10-24 16:30:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:30:13,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-24 16:30:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:13,312 INFO L225 Difference]: With dead ends: 133 [2024-10-24 16:30:13,312 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 16:30:13,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:30:13,313 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:13,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 205 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 16:30:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-24 16:30:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 131 states have internal predecessors, (152), 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-10-24 16:30:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2024-10-24 16:30:13,315 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 18 [2024-10-24 16:30:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:13,316 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2024-10-24 16:30:13,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2024-10-24 16:30:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:30:13,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:13,316 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] [2024-10-24 16:30:13,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 16:30:13,317 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:13,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1129137275, now seen corresponding path program 1 times [2024-10-24 16:30:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:13,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116874259] [2024-10-24 16:30:13,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:13,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116874259] [2024-10-24 16:30:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116874259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:13,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:30:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779130753] [2024-10-24 16:30:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:13,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:30:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:30:13,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:30:13,350 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-10-24 16:30:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:13,436 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2024-10-24 16:30:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:30:13,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 20 [2024-10-24 16:30:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:13,437 INFO L225 Difference]: With dead ends: 130 [2024-10-24 16:30:13,437 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:30:13,438 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-10-24 16:30:13,438 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:13,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 218 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:30:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 16:30:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.4) internal successors, (147), 128 states have internal predecessors, (147), 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-10-24 16:30:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2024-10-24 16:30:13,440 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 20 [2024-10-24 16:30:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:13,441 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2024-10-24 16:30:13,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-10-24 16:30:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2024-10-24 16:30:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:30:13,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:13,441 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] [2024-10-24 16:30:13,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 16:30:13,441 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-10-24 16:30:13,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash 485472380, now seen corresponding path program 1 times [2024-10-24 16:30:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:13,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406275020] [2024-10-24 16:30:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:13,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406275020] [2024-10-24 16:30:13,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406275020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:13,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:13,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:30:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483152372] [2024-10-24 16:30:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:13,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:30:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:13,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:30:13,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:30:13,530 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-10-24 16:30:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:13,601 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2024-10-24 16:30:13,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:30:13,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 21 [2024-10-24 16:30:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:13,602 INFO L225 Difference]: With dead ends: 130 [2024-10-24 16:30:13,602 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:30:13,602 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-10-24 16:30:13,602 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:13,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 192 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:30:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-10-24 16:30:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 127 states have internal predecessors, (146), 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-10-24 16:30:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2024-10-24 16:30:13,605 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 21 [2024-10-24 16:30:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:13,605 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2024-10-24 16:30:13,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-10-24 16:30:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2024-10-24 16:30:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:30:13,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:13,605 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] [2024-10-24 16:30:13,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 16:30:13,606 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:13,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1666643759, now seen corresponding path program 1 times [2024-10-24 16:30:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:13,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134481070] [2024-10-24 16:30:13,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:13,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134481070] [2024-10-24 16:30:13,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134481070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:13,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:13,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:30:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064291316] [2024-10-24 16:30:13,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:13,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:30:13,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:13,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:30:13,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:30:13,736 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-10-24 16:30:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:13,949 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2024-10-24 16:30:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:30:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 23 [2024-10-24 16:30:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:13,950 INFO L225 Difference]: With dead ends: 144 [2024-10-24 16:30:13,950 INFO L226 Difference]: Without dead ends: 144 [2024-10-24 16:30:13,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:30:13,951 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 133 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:13,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 179 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-24 16:30:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2024-10-24 16:30:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 134 states have internal predecessors, (153), 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-10-24 16:30:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2024-10-24 16:30:13,953 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 23 [2024-10-24 16:30:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:13,953 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2024-10-24 16:30:13,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-10-24 16:30:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2024-10-24 16:30:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:30:13,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:13,954 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] [2024-10-24 16:30:13,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 16:30:13,954 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:13,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1233345126, now seen corresponding path program 1 times [2024-10-24 16:30:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:13,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121720480] [2024-10-24 16:30:13,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:13,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:30:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121720480] [2024-10-24 16:30:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121720480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:13,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:30:13,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580547174] [2024-10-24 16:30:13,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:13,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:30:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:30:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:30:13,976 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:14,016 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2024-10-24 16:30:14,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:30:14,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 23 [2024-10-24 16:30:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:14,017 INFO L225 Difference]: With dead ends: 140 [2024-10-24 16:30:14,017 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 16:30:14,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-24 16:30:14,017 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 46 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:14,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 85 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:30:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 16:30:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-24 16:30:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 138 states have internal predecessors, (155), 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-10-24 16:30:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2024-10-24 16:30:14,019 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 23 [2024-10-24 16:30:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2024-10-24 16:30:14,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2024-10-24 16:30:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:30:14,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:14,020 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] [2024-10-24 16:30:14,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 16:30:14,021 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-10-24 16:30:14,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash -166297911, now seen corresponding path program 1 times [2024-10-24 16:30:14,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:14,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598818419] [2024-10-24 16:30:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:14,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598818419] [2024-10-24 16:30:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598818419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300732799] [2024-10-24 16:30:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:14,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:14,090 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-10-24 16:30:14,091 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-10-24 16:30:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:14,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:30:14,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:14,212 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-10-24 16:30:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:30:14,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:30:14,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300732799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:14,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:30:14,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-10-24 16:30:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456881394] [2024-10-24 16:30:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:14,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:30:14,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:14,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:30:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:30:14,237 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:14,298 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2024-10-24 16:30:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:30:14,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-10-24 16:30:14,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:14,299 INFO L225 Difference]: With dead ends: 135 [2024-10-24 16:30:14,299 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 16:30:14,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 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-10-24 16:30:14,300 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:14,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 198 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 16:30:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-10-24 16:30:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 132 states have internal predecessors, (146), 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-10-24 16:30:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2024-10-24 16:30:14,302 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 25 [2024-10-24 16:30:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:14,303 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2024-10-24 16:30:14,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2024-10-24 16:30:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:30:14,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:14,303 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] [2024-10-24 16:30:14,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 16:30:14,503 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-10-24 16:30:14,504 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-10-24 16:30:14,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1792229070, now seen corresponding path program 1 times [2024-10-24 16:30:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:14,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792762646] [2024-10-24 16:30:14,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:14,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:14,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792762646] [2024-10-24 16:30:14,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792762646] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:14,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103612695] [2024-10-24 16:30:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:14,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:14,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:14,611 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-10-24 16:30:14,612 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-10-24 16:30:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:14,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:30:14,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:14,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:30:14,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:30:14,700 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 21 treesize of output 20 [2024-10-24 16:30:14,704 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-10-24 16:30:14,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:14,724 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-10-24 16:30:14,730 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-10-24 16:30:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:30:14,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:30:14,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103612695] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:14,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:14,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 8 [2024-10-24 16:30:14,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114905327] [2024-10-24 16:30:14,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:14,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:30:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:30:14,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:30:14,875 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:15,082 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-10-24 16:30:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:30:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 26 [2024-10-24 16:30:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:15,083 INFO L225 Difference]: With dead ends: 148 [2024-10-24 16:30:15,083 INFO L226 Difference]: Without dead ends: 148 [2024-10-24 16:30:15,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:30:15,083 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:15,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 248 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:30:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-24 16:30:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2024-10-24 16:30:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 136 states have internal predecessors, (148), 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-10-24 16:30:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2024-10-24 16:30:15,086 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 26 [2024-10-24 16:30:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:15,086 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2024-10-24 16:30:15,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2024-10-24 16:30:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:30:15,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:15,087 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-10-24 16:30:15,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 16:30:15,287 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-10-24 16:30:15,288 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-10-24 16:30:15,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash -275474027, now seen corresponding path program 1 times [2024-10-24 16:30:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718457021] [2024-10-24 16:30:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:30:15,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:15,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718457021] [2024-10-24 16:30:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718457021] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:15,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701542577] [2024-10-24 16:30:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:15,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:15,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:15,336 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-10-24 16:30:15,338 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-10-24 16:30:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:15,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:30:15,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:15,440 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-10-24 16:30:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:30:15,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:30:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701542577] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:15,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:15,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2024-10-24 16:30:15,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554833466] [2024-10-24 16:30:15,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:15,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:30:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:15,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:30:15,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:30:15,479 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:15,546 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2024-10-24 16:30:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:30:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-10-24 16:30:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:15,547 INFO L225 Difference]: With dead ends: 145 [2024-10-24 16:30:15,547 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 16:30:15,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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-10-24 16:30:15,548 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:15,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 16:30:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-24 16:30:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.33) internal successors, (133), 122 states have internal predecessors, (133), 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-10-24 16:30:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2024-10-24 16:30:15,550 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 27 [2024-10-24 16:30:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:15,550 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2024-10-24 16:30:15,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2024-10-24 16:30:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:30:15,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:15,551 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-10-24 16:30:15,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 16:30:15,751 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-10-24 16:30:15,752 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-10-24 16:30:15,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1073345276, now seen corresponding path program 1 times [2024-10-24 16:30:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987084098] [2024-10-24 16:30:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:15,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:15,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987084098] [2024-10-24 16:30:15,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987084098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:30:15,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:30:15,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:30:15,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048286988] [2024-10-24 16:30:15,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:30:15,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:30:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:15,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:30:15,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:30:15,901 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-10-24 16:30:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:16,080 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2024-10-24 16:30:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:30:16,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-10-24 16:30:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:16,081 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:30:16,081 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:30:16,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:30:16,081 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 41 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:16,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 347 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:30:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:30:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2024-10-24 16:30:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 114 states have internal predecessors, (125), 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-10-24 16:30:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2024-10-24 16:30:16,084 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 29 [2024-10-24 16:30:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:16,084 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2024-10-24 16:30:16,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-10-24 16:30:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2024-10-24 16:30:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 16:30:16,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:16,085 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] [2024-10-24 16:30:16,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 16:30:16,085 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:16,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash 59812451, now seen corresponding path program 1 times [2024-10-24 16:30:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397102568] [2024-10-24 16:30:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:16,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397102568] [2024-10-24 16:30:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397102568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594748513] [2024-10-24 16:30:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:16,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:16,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:16,388 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-10-24 16:30:16,389 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-10-24 16:30:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:16,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 16:30:16,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:16,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:30:16,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:30:16,525 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:30: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 11 treesize of output 11 [2024-10-24 16:30:16,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:16,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 16:30:16,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:30:16,580 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:16,580 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-10-24 16:30:16,583 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-10-24 16:30:16,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-24 16:30:16,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:30:16,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:30:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:16,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:16,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:16,785 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 38 treesize of output 39 [2024-10-24 16:30:16,788 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 70 treesize of output 62 [2024-10-24 16:30:16,791 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 27 [2024-10-24 16:30:16,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:16,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:16,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 133 [2024-10-24 16:30:16,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 220 [2024-10-24 16:30:16,971 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-10-24 16:30:16,973 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-10-24 16:30:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:19,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594748513] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:19,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:19,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2024-10-24 16:30:19,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320549453] [2024-10-24 16:30:19,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:19,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:30:19,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:19,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:30:19,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=312, Unknown=38, NotChecked=0, Total=420 [2024-10-24 16:30:19,319 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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-10-24 16:30:29,336 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_977 (Array Int Int))) (= (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_ArrVal_977) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1))) is different from false [2024-10-24 16:30:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:35,583 INFO L93 Difference]: Finished difference Result 315 states and 355 transitions. [2024-10-24 16:30:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 16:30:35,584 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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 31 [2024-10-24 16:30:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:35,585 INFO L225 Difference]: With dead ends: 315 [2024-10-24 16:30:35,585 INFO L226 Difference]: Without dead ends: 315 [2024-10-24 16:30:35,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=318, Invalid=1104, Unknown=64, NotChecked=74, Total=1560 [2024-10-24 16:30:35,586 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 603 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 55 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:35,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 493 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 907 Invalid, 13 Unknown, 19 Unchecked, 2.5s Time] [2024-10-24 16:30:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-24 16:30:35,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 155. [2024-10-24 16:30:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.2727272727272727) internal successors, (168), 153 states have internal predecessors, (168), 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-10-24 16:30:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2024-10-24 16:30:35,594 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 31 [2024-10-24 16:30:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:35,594 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2024-10-24 16:30:35,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 20 states have internal predecessors, (59), 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-10-24 16:30:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2024-10-24 16:30:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:30:35,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:35,594 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] [2024-10-24 16:30:35,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 16:30:35,795 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,SelfDestructingSolverStorable24 [2024-10-24 16:30:35,796 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:35,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1433951062, now seen corresponding path program 1 times [2024-10-24 16:30:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498001873] [2024-10-24 16:30:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:36,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:36,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498001873] [2024-10-24 16:30:36,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498001873] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:36,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176842863] [2024-10-24 16:30:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:36,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:36,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:36,460 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-10-24 16:30:36,463 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-10-24 16:30:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:36,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:30:36,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:36,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:30:36,771 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:30:36,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:30:36,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:30:37,026 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:37,026 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-10-24 16:30:37,187 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-24 16:30:37,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-24 16:30:37,244 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:37,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 34 treesize of output 33 [2024-10-24 16:30:37,598 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-10-24 16:30:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:37,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:38,329 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-10-24 16:30:38,329 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 29 treesize of output 28 [2024-10-24 16:30:38,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:38,688 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 36 treesize of output 29 [2024-10-24 16:30:38,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:38,708 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 236 treesize of output 211 [2024-10-24 16:30:38,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:38,733 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 155 treesize of output 151 [2024-10-24 16:30:38,742 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 143 treesize of output 135 [2024-10-24 16:30:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176842863] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:39,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2024-10-24 16:30:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18163519] [2024-10-24 16:30:39,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:39,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-24 16:30:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:39,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-24 16:30:39,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=797, Unknown=22, NotChecked=0, Total=930 [2024-10-24 16:30:39,377 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 31 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:42,829 INFO L93 Difference]: Finished difference Result 216 states and 243 transitions. [2024-10-24 16:30:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:30:42,830 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 31 states have internal predecessors, (101), 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 35 [2024-10-24 16:30:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:42,834 INFO L225 Difference]: With dead ends: 216 [2024-10-24 16:30:42,834 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 16:30:42,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=261, Invalid=1356, Unknown=23, NotChecked=0, Total=1640 [2024-10-24 16:30:42,838 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 632 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:42,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 486 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 16:30:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 16:30:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 167. [2024-10-24 16:30:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 165 states have internal predecessors, (182), 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-10-24 16:30:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2024-10-24 16:30:42,846 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 35 [2024-10-24 16:30:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:42,846 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2024-10-24 16:30:42,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 31 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2024-10-24 16:30:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:30:42,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:42,847 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] [2024-10-24 16:30:42,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 16:30:43,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-24 16:30:43,047 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:43,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1433951063, now seen corresponding path program 1 times [2024-10-24 16:30:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428376730] [2024-10-24 16:30:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428376730] [2024-10-24 16:30:43,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428376730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663121431] [2024-10-24 16:30:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:43,914 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-10-24 16:30:43,915 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-10-24 16:30:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:44,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 16:30:44,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:44,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:30:44,218 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:30:44,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:30:44,244 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 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 16:30:44,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:30:44,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:30:44,616 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:44,616 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-10-24 16:30:44,636 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-10-24 16:30:44,749 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-24 16:30:44,750 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-10-24 16:30:44,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:44,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:30:44,852 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:44,853 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-10-24 16:30:44,864 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-10-24 16:30:45,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 16:30:45,411 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-10-24 16:30:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:45,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:46,455 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int)) (or (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int)) (or (< (+ 11 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1178) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|)))) is different from false [2024-10-24 16:30:46,800 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1174) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|) 9)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1173))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1174) .cse0 v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1178) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|)))) is different from false [2024-10-24 16:30:46,858 WARN L851 $PredicateComparison]: unable to prove that (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|))) (and (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1173))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ 11 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1174) .cse1 v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1178) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (forall ((v_ArrVal_1177 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1174) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1173) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1177) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))))) is different from false [2024-10-24 16:30:46,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:46,878 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 73 treesize of output 74 [2024-10-24 16:30:46,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:46,894 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 65 treesize of output 50 [2024-10-24 16:30:46,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:46,928 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 632 treesize of output 567 [2024-10-24 16:30:46,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:46,977 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 1127 treesize of output 1070 [2024-10-24 16:30:47,020 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 547 treesize of output 523 [2024-10-24 16:30:47,032 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 523 treesize of output 499 [2024-10-24 16:30:47,046 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 499 treesize of output 491 [2024-10-24 16:30:47,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:47,074 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 491 treesize of output 447 [2024-10-24 16:30:47,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:47,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 38 treesize of output 39 [2024-10-24 16:30:47,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:47,556 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 30 treesize of output 31 [2024-10-24 16:30:47,564 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:47,567 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 28 treesize of output 20 [2024-10-24 16:30:47,571 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:30:47,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:47,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:47,581 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-24 16:30:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663121431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:30:48,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:30:48,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 31 [2024-10-24 16:30:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622891504] [2024-10-24 16:30:48,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:30:48,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-24 16:30:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:30:48,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-24 16:30:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=712, Unknown=8, NotChecked=168, Total=992 [2024-10-24 16:30:48,125 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:30:52,239 INFO L93 Difference]: Finished difference Result 220 states and 246 transitions. [2024-10-24 16:30:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:30:52,240 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 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 35 [2024-10-24 16:30:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:30:52,241 INFO L225 Difference]: With dead ends: 220 [2024-10-24 16:30:52,241 INFO L226 Difference]: Without dead ends: 220 [2024-10-24 16:30:52,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=283, Invalid=1361, Unknown=8, NotChecked=240, Total=1892 [2024-10-24 16:30:52,242 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 510 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:30:52,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 585 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1343 Invalid, 0 Unknown, 551 Unchecked, 3.1s Time] [2024-10-24 16:30:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-24 16:30:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 191. [2024-10-24 16:30:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.3035714285714286) internal successors, (219), 189 states have internal predecessors, (219), 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-10-24 16:30:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 222 transitions. [2024-10-24 16:30:52,245 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 222 transitions. Word has length 35 [2024-10-24 16:30:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:30:52,245 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 222 transitions. [2024-10-24 16:30:52,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:30:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 222 transitions. [2024-10-24 16:30:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 16:30:52,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:30:52,246 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-10-24 16:30:52,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 16:30:52,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:52,447 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-10-24 16:30:52,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:30:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash -875153010, now seen corresponding path program 1 times [2024-10-24 16:30:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:30:52,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507841443] [2024-10-24 16:30:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:52,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:30:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:30:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507841443] [2024-10-24 16:30:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507841443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:30:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186093225] [2024-10-24 16:30:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:30:53,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:30:53,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:30:53,880 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-10-24 16:30:53,881 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-10-24 16:30:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:30:53,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-24 16:30:54,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:30:54,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:30:54,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:30:54,174 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:30:54,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-24 16:30:54,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:30:54,283 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-10-24 16:30:54,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:30:54,559 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:54,560 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-10-24 16:30:54,571 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-10-24 16:30:54,875 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-10-24 16:30:54,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:30:54,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:30:54,990 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-24 16:30:54,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-24 16:30:55,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:30:55,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:30:55,285 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-24 16:30:55,285 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 49 treesize of output 44 [2024-10-24 16:30:55,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-24 16:30:55,325 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 12 [2024-10-24 16:30:55,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:30:55,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:30:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:30:55,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:30:55,680 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int))) (= 1 (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_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2024-10-24 16:30:57,182 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1336 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1336) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1337) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-10-24 16:30:57,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:30:57,609 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-10-24 16:30:57,624 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-10-24 16:30:57,640 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-10-24 16:31:00,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:31:00,704 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 222 treesize of output 183 [2024-10-24 16:31:00,735 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 348 treesize of output 320 [2024-10-24 16:31:00,754 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 259 treesize of output 255 [2024-10-24 16:31:01,569 INFO L349 Elim1Store]: treesize reduction 8, result has 91.0 percent of original size [2024-10-24 16:31:01,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 268 treesize of output 336 [2024-10-24 16:31:01,594 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 247 treesize of output 243 [2024-10-24 16:31:01,613 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 284 treesize of output 274 [2024-10-24 16:31:12,287 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|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse9 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_13 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12)))) (.cse4 (not .cse3))) (and (or (and (forall ((v_prenex_12 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int) (v_arrayElimCell_87 Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_prenex_11 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))) (forall ((v_prenex_12 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) .cse3) (or (forall ((v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_prenex_16 (Array Int Int)) (v_arrayElimCell_88 Int) (v_prenex_15 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_19)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_arrayElimCell_88 v_prenex_16) v_prenex_17 v_prenex_15) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_88))) .cse4) (or .cse4 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_13 Int) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_87 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 v_arrayElimCell_87)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_81 Int) (v_arrayElimCell_79 Int) (v_ArrVal_1330 (Array Int Int)) (v_ArrVal_1326 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1334))) (or (= 1 (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1330) v_arrayElimCell_81 v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))) (or .cse3 (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_arrayElimCell_81 Int) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_79 Int) (v_ArrVal_1330 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1326 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)))) (or (= (select (select (store (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1330) v_arrayElimCell_81 v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= 1 (select (select (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))) (or .cse3 (and (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_13 Int) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_87 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12)))) .cse9)) (or .cse3 (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_79 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1326 Int)) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1334))) (or (= 1 (select (select (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((v_prenex_12 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (forall ((v_arrayElimCell_87 Int)) (or (= v_prenex_12 v_arrayElimCell_87) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)))) (or (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_prenex_11 (Array Int Int))) (= (select (select (store (store (store .cse11 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))))))) (or .cse4 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_12 Int) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_87 Int)) (or (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 v_arrayElimCell_87)))) (or .cse9 .cse3) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_13 Int) (v_prenex_11 (Array Int Int)) (v_arrayElimCell_87 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)))) (or (= (select (select (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store .cse12 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_11) v_arrayElimCell_87 v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12) (= v_prenex_12 v_arrayElimCell_87)))) (or .cse3 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_12 Int) (v_prenex_10 (Array Int Int)) (v_prenex_13 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_13)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_10) v_prenex_12 v_prenex_9) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= v_prenex_12 |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_12)))) (or .cse4 (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_arrayElimCell_81 Int) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_79 Int) (v_ArrVal_1330 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1326 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1330) v_arrayElimCell_81 v_ArrVal_1334))) (or (= (select (select (store (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse13 |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))) (or (forall ((v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (v_arrayElimCell_81 Int) (v_arrayElimCell_79 Int) (v_ArrVal_1330 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1326 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1326)))) (or (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1330) v_arrayElimCell_81 v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1334) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1336) v_arrayElimCell_79 v_ArrVal_1339) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) .cse4)))) is different from false [2024-10-24 16:31:32,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:31:33,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:31:33,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 10 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 2230 treesize of output 2582 [2024-10-24 16:31:34,074 INFO L224 Elim1Store]: Index analysis took 488 ms [2024-10-24 16:31:34,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2545 treesize of output 2697 [2024-10-24 16:31:34,681 INFO L224 Elim1Store]: Index analysis took 265 ms [2024-10-24 16:31:34,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37759 treesize of output 37678 [2024-10-24 16:31:34,729 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-10-24 16:31:34,743 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-10-24 16:31:34,757 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-10-24 16:31:34,770 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-10-24 16:31:34,783 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-10-24 16:31:34,796 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-10-24 16:31:34,813 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 372 treesize of output 368 [2024-10-24 16:31:34,830 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 368 treesize of output 364 [2024-10-24 16:31:34,848 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 364 treesize of output 360 [2024-10-24 16:31:34,866 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 360 treesize of output 352 [2024-10-24 16:31:34,883 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 352 treesize of output 348 [2024-10-24 16:31:34,901 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 348 treesize of output 340 [2024-10-24 16:31:34,918 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 340 treesize of output 332 [2024-10-24 16:31:34,936 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 332 treesize of output 324 [2024-10-24 16:31:34,954 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 324 treesize of output 320 [2024-10-24 16:31:34,971 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 445 treesize of output 427 [2024-10-24 16:31:35,014 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-10-24 16:31:35,029 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-10-24 16:31:35,046 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-10-24 16:31:35,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-24 16:31:35,073 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