./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.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 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:56:05,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:56:05,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:56:05,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:56:05,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:56:05,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:56:05,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:56:05,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:56:05,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:56:05,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:56:05,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:56:05,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:56:05,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:56:05,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:56:05,275 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:56:05,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:56:05,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:56:05,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:56:05,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:56:05,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:56:05,277 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:56:05,278 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:56:05,278 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:56:05,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:56:05,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:56:05,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:56:05,279 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:56:05,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:56:05,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:56:05,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:56:05,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:56:05,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:56:05,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:56:05,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:56:05,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:56:05,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:56:05,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:56:05,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:56:05,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:56:05,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:56:05,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:56:05,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:56:05,286 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 -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2024-11-19 06:56:05,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:56:05,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:56:05,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:56:05,582 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:56:05,583 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:56:05,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2024-11-19 06:56:07,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:56:07,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:56:07,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2024-11-19 06:56:07,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a598b5b/ef83a89616af4f79b1746936adb07659/FLAG89a20129a [2024-11-19 06:56:07,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a598b5b/ef83a89616af4f79b1746936adb07659 [2024-11-19 06:56:07,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:56:07,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:56:07,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:56:07,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:56:07,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:56:07,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:56:07" (1/1) ... [2024-11-19 06:56:07,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2449f64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:07, skipping insertion in model container [2024-11-19 06:56:07,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:56:07" (1/1) ... [2024-11-19 06:56:07,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:56:07,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:56:07,971 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:56:08,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:56:08,081 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:56:08,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08 WrapperNode [2024-11-19 06:56:08,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:56:08,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:56:08,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:56:08,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:56:08,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,145 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 170 [2024-11-19 06:56:08,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:56:08,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:56:08,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:56:08,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:56:08,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,181 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-11-19 06:56:08,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:56:08,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:56:08,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:56:08,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:56:08,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (1/1) ... [2024-11-19 06:56:08,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:56:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:08,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:56:08,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:56:08,311 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:56:08,312 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:56:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:56:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:56:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:56:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:56:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:56:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:56:08,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:56:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:56:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:56:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:56:08,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:56:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:56:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:56:08,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:56:08,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:56:08,432 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:56:08,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:56:08,945 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-19 06:56:08,945 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:56:08,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:56:08,971 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-19 06:56:08,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:56:08 BoogieIcfgContainer [2024-11-19 06:56:08,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:56:08,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:56:08,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:56:08,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:56:08,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:56:07" (1/3) ... [2024-11-19 06:56:08,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71542ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:56:08, skipping insertion in model container [2024-11-19 06:56:08,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:08" (2/3) ... [2024-11-19 06:56:08,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71542ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:56:08, skipping insertion in model container [2024-11-19 06:56:08,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:56:08" (3/3) ... [2024-11-19 06:56:08,982 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2024-11-19 06:56:09,004 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:56:09,005 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2024-11-19 06:56:09,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:56:09,081 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;@6cc56d73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:56:09,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2024-11-19 06:56:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 93 states have (on average 2.129032258064516) internal successors, (198), 167 states have internal predecessors, (198), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 06:56:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:56:09,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:09,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:56:09,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:09,102 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-19 06:56:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:09,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430601426] [2024-11-19 06:56:09,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:09,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:09,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:09,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430601426] [2024-11-19 06:56:09,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430601426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:09,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:09,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:09,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772746891] [2024-11-19 06:56:09,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:09,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:09,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:09,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:09,410 INFO L87 Difference]: Start difference. First operand has 176 states, 93 states have (on average 2.129032258064516) internal successors, (198), 167 states have internal predecessors, (198), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:09,672 INFO L93 Difference]: Finished difference Result 193 states and 207 transitions. [2024-11-19 06:56:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:09,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:56:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:09,698 INFO L225 Difference]: With dead ends: 193 [2024-11-19 06:56:09,698 INFO L226 Difference]: Without dead ends: 191 [2024-11-19 06:56:09,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:09,704 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 140 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:09,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 121 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-19 06:56:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 166. [2024-11-19 06:56:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 88 states have (on average 1.9659090909090908) internal successors, (173), 164 states have internal predecessors, (173), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2024-11-19 06:56:09,745 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 3 [2024-11-19 06:56:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:09,746 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2024-11-19 06:56:09,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2024-11-19 06:56:09,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:56:09,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:09,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:56:09,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:56:09,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:09,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-19 06:56:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376716370] [2024-11-19 06:56:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:09,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376716370] [2024-11-19 06:56:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376716370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:09,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933067861] [2024-11-19 06:56:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:09,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:09,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:09,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:09,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:09,882 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:10,056 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2024-11-19 06:56:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:10,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:56:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:10,058 INFO L225 Difference]: With dead ends: 162 [2024-11-19 06:56:10,058 INFO L226 Difference]: Without dead ends: 162 [2024-11-19 06:56:10,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:10,060 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 149 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:10,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 99 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-19 06:56:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-19 06:56:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 88 states have (on average 1.9090909090909092) internal successors, (168), 160 states have internal predecessors, (168), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2024-11-19 06:56:10,079 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 3 [2024-11-19 06:56:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:10,079 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2024-11-19 06:56:10,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2024-11-19 06:56:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:56:10,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:10,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:10,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:56:10,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:10,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1466876622, now seen corresponding path program 1 times [2024-11-19 06:56:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:10,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045136645] [2024-11-19 06:56:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:10,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:10,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:10,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045136645] [2024-11-19 06:56:10,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045136645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:10,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:10,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:10,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131928795] [2024-11-19 06:56:10,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:10,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:10,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:10,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:10,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:10,225 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-11-19 06:56:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:10,378 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2024-11-19 06:56:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:10,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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-11-19 06:56:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:10,381 INFO L225 Difference]: With dead ends: 156 [2024-11-19 06:56:10,381 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 06:56:10,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:10,382 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 117 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:10,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 108 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 06:56:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-19 06:56:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 89 states have (on average 1.8314606741573034) internal successors, (163), 154 states have internal predecessors, (163), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-19 06:56:10,391 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 7 [2024-11-19 06:56:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:10,391 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-19 06:56:10,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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-11-19 06:56:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-19 06:56:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:56:10,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:10,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:10,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:56:10,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:10,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1466876623, now seen corresponding path program 1 times [2024-11-19 06:56:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346910353] [2024-11-19 06:56:10,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:10,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346910353] [2024-11-19 06:56:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346910353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:10,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:10,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:10,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225178088] [2024-11-19 06:56:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:10,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:10,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:10,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:10,553 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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-11-19 06:56:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:10,687 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2024-11-19 06:56:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:10,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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-11-19 06:56:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:10,689 INFO L225 Difference]: With dead ends: 160 [2024-11-19 06:56:10,689 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 06:56:10,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:10,691 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 111 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:10,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 124 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 06:56:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-19 06:56:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 96 states have (on average 1.7395833333333333) internal successors, (167), 158 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2024-11-19 06:56:10,704 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 7 [2024-11-19 06:56:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:10,705 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2024-11-19 06:56:10,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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-11-19 06:56:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2024-11-19 06:56:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:56:10,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:10,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:10,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:56:10,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:10,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1904930185, now seen corresponding path program 1 times [2024-11-19 06:56:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118259620] [2024-11-19 06:56:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:10,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118259620] [2024-11-19 06:56:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118259620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:10,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:10,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:56:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763137144] [2024-11-19 06:56:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:10,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:10,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:10,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:10,898 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:11,117 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2024-11-19 06:56:11,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:11,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 06:56:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:11,119 INFO L225 Difference]: With dead ends: 147 [2024-11-19 06:56:11,119 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 06:56:11,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:11,120 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 154 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:11,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 95 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 06:56:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-19 06:56:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.5918367346938775) internal successors, (156), 145 states have internal predecessors, (156), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 163 transitions. [2024-11-19 06:56:11,136 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 163 transitions. Word has length 13 [2024-11-19 06:56:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:11,136 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 163 transitions. [2024-11-19 06:56:11,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 163 transitions. [2024-11-19 06:56:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:56:11,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:11,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:11,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:56:11,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:11,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:11,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1904930184, now seen corresponding path program 1 times [2024-11-19 06:56:11,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:11,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196600046] [2024-11-19 06:56:11,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:11,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:11,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196600046] [2024-11-19 06:56:11,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196600046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:11,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:11,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:56:11,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017166337] [2024-11-19 06:56:11,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:11,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:11,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:11,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:11,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:11,344 INFO L87 Difference]: Start difference. First operand 147 states and 163 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:11,552 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2024-11-19 06:56:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:56:11,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 06:56:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:11,553 INFO L225 Difference]: With dead ends: 160 [2024-11-19 06:56:11,553 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 06:56:11,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:11,554 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 130 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:11,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 147 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 06:56:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-11-19 06:56:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 155 states have internal predecessors, (169), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 176 transitions. [2024-11-19 06:56:11,564 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 176 transitions. Word has length 13 [2024-11-19 06:56:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:11,568 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 176 transitions. [2024-11-19 06:56:11,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 176 transitions. [2024-11-19 06:56:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:56:11,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:11,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:11,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:56:11,570 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1396149807, now seen corresponding path program 1 times [2024-11-19 06:56:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:11,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920935899] [2024-11-19 06:56:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:11,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920935899] [2024-11-19 06:56:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920935899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:11,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:56:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138693974] [2024-11-19 06:56:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:11,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:11,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:11,671 INFO L87 Difference]: Start difference. First operand 157 states and 176 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:11,887 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2024-11-19 06:56:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 17 [2024-11-19 06:56:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:11,889 INFO L225 Difference]: With dead ends: 193 [2024-11-19 06:56:11,890 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 06:56:11,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:56:11,891 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 280 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:11,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 170 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 06:56:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 159. [2024-11-19 06:56:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 157 states have internal predecessors, (171), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2024-11-19 06:56:11,897 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 17 [2024-11-19 06:56:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:11,897 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2024-11-19 06:56:11,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2024-11-19 06:56:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:56:11,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:11,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:11,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:56:11,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:11,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash -372244357, now seen corresponding path program 1 times [2024-11-19 06:56:11,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:11,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111234407] [2024-11-19 06:56:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:11,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111234407] [2024-11-19 06:56:12,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111234407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:12,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:12,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240020659] [2024-11-19 06:56:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:12,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:12,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:12,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:12,030 INFO L87 Difference]: Start difference. First operand 159 states and 177 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-11-19 06:56:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:12,192 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2024-11-19 06:56:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:12,193 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-11-19 06:56:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:12,194 INFO L225 Difference]: With dead ends: 158 [2024-11-19 06:56:12,194 INFO L226 Difference]: Without dead ends: 158 [2024-11-19 06:56:12,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:12,195 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 4 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:12,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 360 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-19 06:56:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-19 06:56:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 156 states have internal predecessors, (169), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2024-11-19 06:56:12,201 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 16 [2024-11-19 06:56:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:12,203 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2024-11-19 06:56:12,204 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-11-19 06:56:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2024-11-19 06:56:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:56:12,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:12,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:12,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:56:12,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:12,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash -372244356, now seen corresponding path program 1 times [2024-11-19 06:56:12,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:12,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734802780] [2024-11-19 06:56:12,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:12,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734802780] [2024-11-19 06:56:12,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734802780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:12,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:12,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:12,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461034198] [2024-11-19 06:56:12,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:12,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:12,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:12,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:12,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:12,501 INFO L87 Difference]: Start difference. First operand 158 states and 175 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-11-19 06:56:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:12,703 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2024-11-19 06:56:12,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:12,703 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-11-19 06:56:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:12,705 INFO L225 Difference]: With dead ends: 157 [2024-11-19 06:56:12,705 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 06:56:12,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:12,706 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 2 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:12,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 06:56:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-19 06:56:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 112 states have (on average 1.4910714285714286) internal successors, (167), 155 states have internal predecessors, (167), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2024-11-19 06:56:12,711 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 16 [2024-11-19 06:56:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:12,711 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2024-11-19 06:56:12,712 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-11-19 06:56:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2024-11-19 06:56:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:56:12,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:12,712 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-11-19 06:56:12,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:56:12,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:12,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash -544751945, now seen corresponding path program 1 times [2024-11-19 06:56:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:12,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113808550] [2024-11-19 06:56:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:13,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:13,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113808550] [2024-11-19 06:56:13,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113808550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:13,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:13,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:56:13,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756265940] [2024-11-19 06:56:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:13,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:56:13,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:13,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:56:13,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:56:13,007 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11-19 06:56:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:13,275 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2024-11-19 06:56:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:56:13,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11-19 06:56:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:13,277 INFO L225 Difference]: With dead ends: 197 [2024-11-19 06:56:13,277 INFO L226 Difference]: Without dead ends: 197 [2024-11-19 06:56:13,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:56:13,278 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 213 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:13,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 369 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-19 06:56:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 162. [2024-11-19 06:56:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.4700854700854702) internal successors, (172), 160 states have internal predecessors, (172), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2024-11-19 06:56:13,283 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 20 [2024-11-19 06:56:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:13,283 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2024-11-19 06:56:13,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-11-19 06:56:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2024-11-19 06:56:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:56:13,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:13,284 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-11-19 06:56:13,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:56:13,284 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:13,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2002803523, now seen corresponding path program 1 times [2024-11-19 06:56:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:13,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503865910] [2024-11-19 06:56:13,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:13,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503865910] [2024-11-19 06:56:13,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503865910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:13,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:13,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:56:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482556292] [2024-11-19 06:56:13,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:13,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:56:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:13,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:56:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:56:13,535 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:13,907 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2024-11-19 06:56:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:56:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 06:56:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:13,909 INFO L225 Difference]: With dead ends: 161 [2024-11-19 06:56:13,909 INFO L226 Difference]: Without dead ends: 161 [2024-11-19 06:56:13,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:56:13,909 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 147 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:13,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 271 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:56:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-19 06:56:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-19 06:56:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 117 states have (on average 1.4615384615384615) internal successors, (171), 159 states have internal predecessors, (171), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2024-11-19 06:56:13,913 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 20 [2024-11-19 06:56:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:13,914 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2024-11-19 06:56:13,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2024-11-19 06:56:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:56:13,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:13,915 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-11-19 06:56:13,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:56:13,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:13,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2002803522, now seen corresponding path program 1 times [2024-11-19 06:56:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:13,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339130137] [2024-11-19 06:56:13,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:14,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:14,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339130137] [2024-11-19 06:56:14,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339130137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:14,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:14,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:56:14,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359206091] [2024-11-19 06:56:14,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:14,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:56:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:14,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:56:14,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:56:14,269 INFO L87 Difference]: Start difference. First operand 161 states and 177 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:14,874 INFO L93 Difference]: Finished difference Result 175 states and 195 transitions. [2024-11-19 06:56:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:56:14,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-19 06:56:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:14,876 INFO L225 Difference]: With dead ends: 175 [2024-11-19 06:56:14,876 INFO L226 Difference]: Without dead ends: 175 [2024-11-19 06:56:14,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:56:14,877 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 193 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:14,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 390 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:56:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-19 06:56:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2024-11-19 06:56:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 163 states have internal predecessors, (179), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2024-11-19 06:56:14,882 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 20 [2024-11-19 06:56:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:14,882 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2024-11-19 06:56:14,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2024-11-19 06:56:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:56:14,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:14,883 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] [2024-11-19 06:56:14,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:56:14,884 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:14,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash 726822264, now seen corresponding path program 1 times [2024-11-19 06:56:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564096878] [2024-11-19 06:56:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:14,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:15,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564096878] [2024-11-19 06:56:15,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564096878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991083250] [2024-11-19 06:56:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:15,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:15,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:15,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:56:15,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:56:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:15,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 06:56:15,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:15,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:56:15,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:56:15,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:56:15,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:56:15,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:56:15,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-19 06:56:15,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 06:56:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:15,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:16,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-19 06:56:16,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-19 06:56:16,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-19 06:56:16,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:16,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991083250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:16,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 16 [2024-11-19 06:56:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632501062] [2024-11-19 06:56:16,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:16,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:56:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:16,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:56:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:56:16,120 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:16,826 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2024-11-19 06:56:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:56:16,827 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 06:56:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:16,828 INFO L225 Difference]: With dead ends: 203 [2024-11-19 06:56:16,828 INFO L226 Difference]: Without dead ends: 203 [2024-11-19 06:56:16,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:56:16,829 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 352 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:16,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 704 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:56:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-19 06:56:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 172. [2024-11-19 06:56:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.3955223880597014) internal successors, (187), 170 states have internal predecessors, (187), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2024-11-19 06:56:16,838 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 25 [2024-11-19 06:56:16,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:16,839 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2024-11-19 06:56:16,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2024-11-19 06:56:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:56:16,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:16,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:16,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:56:17,040 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,SelfDestructingSolverStorable12 [2024-11-19 06:56:17,042 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:17,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash 966766044, now seen corresponding path program 1 times [2024-11-19 06:56:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:17,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313879944] [2024-11-19 06:56:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:17,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:17,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313879944] [2024-11-19 06:56:17,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313879944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:17,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:17,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:56:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560677755] [2024-11-19 06:56:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:17,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:17,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:17,117 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:17,284 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2024-11-19 06:56:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:17,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 06:56:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:17,286 INFO L225 Difference]: With dead ends: 175 [2024-11-19 06:56:17,286 INFO L226 Difference]: Without dead ends: 175 [2024-11-19 06:56:17,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:17,287 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 18 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:17,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 361 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-19 06:56:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2024-11-19 06:56:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 169 states have internal predecessors, (184), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 190 transitions. [2024-11-19 06:56:17,291 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 190 transitions. Word has length 27 [2024-11-19 06:56:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:17,292 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 190 transitions. [2024-11-19 06:56:17,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 190 transitions. [2024-11-19 06:56:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:56:17,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:17,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:17,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:56:17,295 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:17,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash 53240123, now seen corresponding path program 1 times [2024-11-19 06:56:17,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:17,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646581152] [2024-11-19 06:56:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:17,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:17,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646581152] [2024-11-19 06:56:17,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646581152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:17,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:17,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:17,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49448849] [2024-11-19 06:56:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:17,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:17,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:17,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:17,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:17,418 INFO L87 Difference]: Start difference. First operand 171 states and 190 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:17,527 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2024-11-19 06:56:17,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:56:17,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 28 [2024-11-19 06:56:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:17,528 INFO L225 Difference]: With dead ends: 174 [2024-11-19 06:56:17,528 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 06:56:17,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:17,529 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 15 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:17,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 307 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 06:56:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2024-11-19 06:56:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 133 states have (on average 1.368421052631579) internal successors, (182), 168 states have internal predecessors, (182), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2024-11-19 06:56:17,536 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 28 [2024-11-19 06:56:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:17,536 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2024-11-19 06:56:17,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2024-11-19 06:56:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:56:17,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:17,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:17,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:56:17,541 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:17,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash 314752878, now seen corresponding path program 1 times [2024-11-19 06:56:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320897809] [2024-11-19 06:56:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:17,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320897809] [2024-11-19 06:56:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320897809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:17,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:17,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:17,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498078746] [2024-11-19 06:56:17,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:17,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:17,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:17,704 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:17,860 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2024-11-19 06:56:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:17,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 06:56:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:17,862 INFO L225 Difference]: With dead ends: 169 [2024-11-19 06:56:17,862 INFO L226 Difference]: Without dead ends: 169 [2024-11-19 06:56:17,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:17,863 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:17,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 335 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:17,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-19 06:56:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-19 06:56:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 167 states have internal predecessors, (181), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2024-11-19 06:56:17,867 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 28 [2024-11-19 06:56:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:17,867 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2024-11-19 06:56:17,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2024-11-19 06:56:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:56:17,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:17,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:17,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:56:17,869 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:17,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:17,870 INFO L85 PathProgramCache]: Analyzing trace with hash 314752879, now seen corresponding path program 1 times [2024-11-19 06:56:17,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:17,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664838004] [2024-11-19 06:56:17,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:17,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664838004] [2024-11-19 06:56:18,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664838004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:18,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:18,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:18,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960605569] [2024-11-19 06:56:18,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:18,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:18,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:18,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:18,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:18,112 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:18,283 INFO L93 Difference]: Finished difference Result 168 states and 185 transitions. [2024-11-19 06:56:18,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:18,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 06:56:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:18,285 INFO L225 Difference]: With dead ends: 168 [2024-11-19 06:56:18,285 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 06:56:18,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:18,286 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:18,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 06:56:18,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-19 06:56:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.3533834586466165) internal successors, (180), 166 states have internal predecessors, (180), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2024-11-19 06:56:18,290 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 28 [2024-11-19 06:56:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:18,291 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2024-11-19 06:56:18,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2024-11-19 06:56:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:56:18,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:18,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:18,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:56:18,292 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:18,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1120381926, now seen corresponding path program 1 times [2024-11-19 06:56:18,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:18,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907086274] [2024-11-19 06:56:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:18,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:18,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907086274] [2024-11-19 06:56:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907086274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:18,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63541092] [2024-11-19 06:56:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:18,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:18,504 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:18,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:18,638 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2024-11-19 06:56:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:56:18,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-11-19 06:56:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:18,639 INFO L225 Difference]: With dead ends: 168 [2024-11-19 06:56:18,639 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 06:56:18,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:18,640 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:18,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 256 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 06:56:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2024-11-19 06:56:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 165 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2024-11-19 06:56:18,645 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 31 [2024-11-19 06:56:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:18,645 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2024-11-19 06:56:18,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2024-11-19 06:56:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:56:18,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:18,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:18,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:56:18,646 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:18,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash -73432733, now seen corresponding path program 1 times [2024-11-19 06:56:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:18,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021357878] [2024-11-19 06:56:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:18,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021357878] [2024-11-19 06:56:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021357878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370483907] [2024-11-19 06:56:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:18,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:18,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:18,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:56:18,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:56:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:18,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:56:18,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:56:18,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:56:18,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370483907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:18,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:56:18,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-19 06:56:18,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476970791] [2024-11-19 06:56:18,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:18,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:18,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:56:18,983 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 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-11-19 06:56:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:19,036 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2024-11-19 06:56:19,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:19,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 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 31 [2024-11-19 06:56:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:19,038 INFO L225 Difference]: With dead ends: 168 [2024-11-19 06:56:19,038 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 06:56:19,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:56:19,039 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 64 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:19,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 134 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:56:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 06:56:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-19 06:56:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.328358208955224) internal successors, (178), 166 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2024-11-19 06:56:19,043 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 31 [2024-11-19 06:56:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2024-11-19 06:56:19,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 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-11-19 06:56:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2024-11-19 06:56:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:56:19,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:19,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:19,065 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-11-19 06:56:19,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:19,246 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:19,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1802650096, now seen corresponding path program 1 times [2024-11-19 06:56:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:19,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170207316] [2024-11-19 06:56:19,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:19,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:19,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:19,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170207316] [2024-11-19 06:56:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170207316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:19,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:56:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445262388] [2024-11-19 06:56:19,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:19,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:56:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:19,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:56:19,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:56:19,495 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:19,830 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2024-11-19 06:56:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:56:19,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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 32 [2024-11-19 06:56:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:19,831 INFO L225 Difference]: With dead ends: 168 [2024-11-19 06:56:19,831 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 06:56:19,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-11-19 06:56:19,832 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:19,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 373 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:56:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 06:56:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2024-11-19 06:56:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.3208955223880596) internal successors, (177), 165 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 181 transitions. [2024-11-19 06:56:19,837 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 181 transitions. Word has length 32 [2024-11-19 06:56:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:19,837 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 181 transitions. [2024-11-19 06:56:19,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 181 transitions. [2024-11-19 06:56:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:56:19,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:19,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:19,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 06:56:19,838 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1802650097, now seen corresponding path program 1 times [2024-11-19 06:56:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:19,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687211558] [2024-11-19 06:56:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:20,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687211558] [2024-11-19 06:56:20,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687211558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:20,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:56:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417582652] [2024-11-19 06:56:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:20,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:56:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:20,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:56:20,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:56:20,271 INFO L87 Difference]: Start difference. First operand 167 states and 181 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:20,599 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2024-11-19 06:56:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:56:20,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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 32 [2024-11-19 06:56:20,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:20,601 INFO L225 Difference]: With dead ends: 163 [2024-11-19 06:56:20,601 INFO L226 Difference]: Without dead ends: 163 [2024-11-19 06:56:20,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:56:20,602 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 57 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:20,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 389 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:56:20,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-19 06:56:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 144. [2024-11-19 06:56:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 142 states have internal predecessors, (152), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2024-11-19 06:56:20,606 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 32 [2024-11-19 06:56:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:20,607 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2024-11-19 06:56:20,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2024-11-19 06:56:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:56:20,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:20,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:20,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:56:20,610 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:20,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1291289455, now seen corresponding path program 1 times [2024-11-19 06:56:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:20,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020961208] [2024-11-19 06:56:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020961208] [2024-11-19 06:56:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020961208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:20,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:56:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52129008] [2024-11-19 06:56:20,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:56:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:20,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:56:20,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:56:20,978 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:21,486 INFO L93 Difference]: Finished difference Result 191 states and 205 transitions. [2024-11-19 06:56:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:56:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 33 [2024-11-19 06:56:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:21,488 INFO L225 Difference]: With dead ends: 191 [2024-11-19 06:56:21,488 INFO L226 Difference]: Without dead ends: 191 [2024-11-19 06:56:21,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:56:21,489 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 307 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:21,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 338 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:56:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-19 06:56:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 151. [2024-11-19 06:56:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.272) internal successors, (159), 149 states have internal predecessors, (159), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2024-11-19 06:56:21,493 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 33 [2024-11-19 06:56:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:21,493 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2024-11-19 06:56:21,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2024-11-19 06:56:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:56:21,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:21,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:21,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:56:21,494 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:21,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1849369658, now seen corresponding path program 1 times [2024-11-19 06:56:21,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:21,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330624818] [2024-11-19 06:56:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:21,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:21,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330624818] [2024-11-19 06:56:21,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330624818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:21,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613171066] [2024-11-19 06:56:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:21,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:21,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:56:21,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:56:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:21,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:56:21,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:21,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:56:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:56:21,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:56:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613171066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:56:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-11-19 06:56:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210521237] [2024-11-19 06:56:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:56:21,823 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:21,898 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2024-11-19 06:56:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:56:21,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 06:56:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:21,900 INFO L225 Difference]: With dead ends: 158 [2024-11-19 06:56:21,900 INFO L226 Difference]: Without dead ends: 158 [2024-11-19 06:56:21,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:56:21,901 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 5 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:21,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 289 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-19 06:56:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2024-11-19 06:56:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.265625) internal successors, (162), 152 states have internal predecessors, (162), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2024-11-19 06:56:21,905 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 33 [2024-11-19 06:56:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:21,905 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2024-11-19 06:56:21,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2024-11-19 06:56:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:56:21,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:21,906 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] [2024-11-19 06:56:21,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:56:22,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:22,107 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:22,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:22,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1187283993, now seen corresponding path program 1 times [2024-11-19 06:56:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:22,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365980383] [2024-11-19 06:56:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:22,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365980383] [2024-11-19 06:56:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365980383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244643416] [2024-11-19 06:56:22,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:22,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:22,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:22,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:56:22,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:56:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:22,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:56:22,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:22,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:56:22,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:56:22,488 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-11-19 06:56:22,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 06:56:22,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 06:56:22,528 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 36 treesize of output 23 [2024-11-19 06:56:22,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2024-11-19 06:56:22,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:56:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:56:22,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:56:22,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244643416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:22,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:22,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2024-11-19 06:56:22,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267457816] [2024-11-19 06:56:22,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:22,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:56:22,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:56:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:56:22,782 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:23,275 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2024-11-19 06:56:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:56:23,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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 34 [2024-11-19 06:56:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:23,276 INFO L225 Difference]: With dead ends: 176 [2024-11-19 06:56:23,276 INFO L226 Difference]: Without dead ends: 176 [2024-11-19 06:56:23,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:56:23,277 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 16 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:23,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 519 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:56:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-19 06:56:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2024-11-19 06:56:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 179 transitions. [2024-11-19 06:56:23,281 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 179 transitions. Word has length 34 [2024-11-19 06:56:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:23,281 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 179 transitions. [2024-11-19 06:56:23,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:23,281 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2024-11-19 06:56:23,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:56:23,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:23,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:23,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:56:23,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:23,487 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:23,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1848902189, now seen corresponding path program 1 times [2024-11-19 06:56:23,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:23,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485837352] [2024-11-19 06:56:23,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:23,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:56:23,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485837352] [2024-11-19 06:56:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485837352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:23,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:23,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:23,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944659313] [2024-11-19 06:56:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:23,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:23,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:23,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:23,526 INFO L87 Difference]: Start difference. First operand 165 states and 179 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:23,565 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2024-11-19 06:56:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 06:56:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:23,567 INFO L225 Difference]: With dead ends: 164 [2024-11-19 06:56:23,567 INFO L226 Difference]: Without dead ends: 164 [2024-11-19 06:56:23,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:23,568 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:23,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 91 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:56:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-19 06:56:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-19 06:56:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 162 states have internal predecessors, (173), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2024-11-19 06:56:23,575 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 35 [2024-11-19 06:56:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:23,575 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2024-11-19 06:56:23,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2024-11-19 06:56:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:56:23,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:23,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:23,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 06:56:23,576 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:23,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:23,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1321467958, now seen corresponding path program 1 times [2024-11-19 06:56:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91136235] [2024-11-19 06:56:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:23,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:56:23,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:23,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91136235] [2024-11-19 06:56:23,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91136235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:23,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58325947] [2024-11-19 06:56:23,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:23,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:23,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:23,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:56:23,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:56:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:24,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 06:56:24,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:24,063 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:56:24,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-11-19 06:56:24,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 29 [2024-11-19 06:56:24,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2024-11-19 06:56:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:56:24,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:56:24,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58325947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:24,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:24,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-11-19 06:56:24,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730106878] [2024-11-19 06:56:24,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:24,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:56:24,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:24,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:56:24,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:56:24,673 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:25,131 INFO L93 Difference]: Finished difference Result 174 states and 186 transitions. [2024-11-19 06:56:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:56:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 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 37 [2024-11-19 06:56:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:25,132 INFO L225 Difference]: With dead ends: 174 [2024-11-19 06:56:25,133 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 06:56:25,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:56:25,133 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 7 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:25,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 458 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:56:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 06:56:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-19 06:56:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 147 states have internal predecessors, (157), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2024-11-19 06:56:25,138 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 37 [2024-11-19 06:56:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:25,138 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2024-11-19 06:56:25,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2024-11-19 06:56:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:56:25,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:25,139 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:25,157 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-11-19 06:56:25,340 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,SelfDestructingSolverStorable25 [2024-11-19 06:56:25,341 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:25,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1132536065, now seen corresponding path program 1 times [2024-11-19 06:56:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080687947] [2024-11-19 06:56:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:26,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:26,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080687947] [2024-11-19 06:56:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080687947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99733009] [2024-11-19 06:56:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:26,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:26,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:26,107 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:56:26,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:56:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:26,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 06:56:26,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:26,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:56:26,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:56:26,354 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:26,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:56:26,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:26,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:26,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:56:26,486 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:26,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-19 06:56:26,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:56:26,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 06:56:26,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:56:26,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:56:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:26,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:26,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1576 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1576) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-19 06:56:26,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1572 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1574) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1572) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1576) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-19 06:56:26,804 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1572 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1574) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1572) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1576)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-19 06:56:26,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:26,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-19 06:56:26,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-19 06:56:26,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-19 06:56:26,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1570 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1570) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1576) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1570 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1570)))) .cse2) (or (not .cse2) (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1570 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1570 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1570)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1570) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1574) v_arrayElimCell_30 v_ArrVal_1576) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))) (forall ((v_ArrVal_1570 (Array Int Int))) (or (not (= (store .cse1 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1570 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_1570)) (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1574 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1570))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1576) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1574) v_arrayElimCell_30 v_ArrVal_1576) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)))))))) is different from false [2024-11-19 06:56:34,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 163 [2024-11-19 06:56:34,860 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:56:34,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:56:34,868 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:56:34,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-19 06:56:34,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:56:34,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:56:34,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-19 06:56:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:34,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99733009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:34,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 36 [2024-11-19 06:56:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130284908] [2024-11-19 06:56:34,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:34,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 06:56:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:34,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 06:56:34,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=811, Unknown=30, NotChecked=252, Total=1260 [2024-11-19 06:56:34,917 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:36,729 INFO L93 Difference]: Finished difference Result 229 states and 250 transitions. [2024-11-19 06:56:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:56:36,730 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 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 41 [2024-11-19 06:56:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:36,731 INFO L225 Difference]: With dead ends: 229 [2024-11-19 06:56:36,731 INFO L226 Difference]: Without dead ends: 229 [2024-11-19 06:56:36,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=481, Invalid=1760, Unknown=31, NotChecked=380, Total=2652 [2024-11-19 06:56:36,733 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 710 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 80 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 780 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:36,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 708 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1122 Invalid, 17 Unknown, 780 Unchecked, 1.0s Time] [2024-11-19 06:56:36,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-19 06:56:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 175. [2024-11-19 06:56:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 150 states have (on average 1.2333333333333334) internal successors, (185), 173 states have internal predecessors, (185), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 189 transitions. [2024-11-19 06:56:36,738 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 189 transitions. Word has length 41 [2024-11-19 06:56:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:36,738 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 189 transitions. [2024-11-19 06:56:36,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 189 transitions. [2024-11-19 06:56:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:56:36,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:36,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:36,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:56:36,940 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,SelfDestructingSolverStorable26 [2024-11-19 06:56:36,941 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:36,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 855816986, now seen corresponding path program 1 times [2024-11-19 06:56:36,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555672480] [2024-11-19 06:56:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:36,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:37,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:37,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555672480] [2024-11-19 06:56:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555672480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:37,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 06:56:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168661550] [2024-11-19 06:56:37,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:37,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:56:37,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:37,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:56:37,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:56:37,581 INFO L87 Difference]: Start difference. First operand 175 states and 189 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:38,122 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2024-11-19 06:56:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:56:38,123 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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 43 [2024-11-19 06:56:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:38,123 INFO L225 Difference]: With dead ends: 185 [2024-11-19 06:56:38,124 INFO L226 Difference]: Without dead ends: 185 [2024-11-19 06:56:38,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:56:38,124 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 318 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:38,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 583 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:56:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-19 06:56:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 167. [2024-11-19 06:56:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 165 states have internal predecessors, (177), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2024-11-19 06:56:38,132 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 43 [2024-11-19 06:56:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:38,132 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2024-11-19 06:56:38,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2024-11-19 06:56:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:56:38,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:38,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:38,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 06:56:38,133 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:38,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash 338487662, now seen corresponding path program 1 times [2024-11-19 06:56:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:38,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316261889] [2024-11-19 06:56:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:38,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316261889] [2024-11-19 06:56:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316261889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322557958] [2024-11-19 06:56:38,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:38,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:38,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:38,572 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:56:38,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:56:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:38,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 06:56:38,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:38,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:56:38,794 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:38,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:56:38,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:38,907 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:38,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-19 06:56:38,967 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:56:38,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-19 06:56:39,027 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:39,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 06:56:39,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 06:56:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:39,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:39,437 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-19 06:56:39,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:56:39,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:39,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2024-11-19 06:56:39,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:39,726 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 330 treesize of output 265 [2024-11-19 06:56:39,740 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 88 treesize of output 82 [2024-11-19 06:56:39,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:39,753 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 60 treesize of output 55 [2024-11-19 06:56:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322557958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:40,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2024-11-19 06:56:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956111137] [2024-11-19 06:56:40,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:40,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 06:56:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:40,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 06:56:40,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1119, Unknown=25, NotChecked=0, Total=1260 [2024-11-19 06:56:40,070 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand has 36 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 36 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:41,396 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2024-11-19 06:56:41,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:56:41,397 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 36 states have internal predecessors, (122), 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 46 [2024-11-19 06:56:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:41,398 INFO L225 Difference]: With dead ends: 254 [2024-11-19 06:56:41,398 INFO L226 Difference]: Without dead ends: 254 [2024-11-19 06:56:41,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=1861, Unknown=25, NotChecked=0, Total=2162 [2024-11-19 06:56:41,399 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 378 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:41,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1001 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 06:56:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-19 06:56:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2024-11-19 06:56:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 177 states have (on average 1.2146892655367232) internal successors, (215), 199 states have internal predecessors, (215), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2024-11-19 06:56:41,409 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 46 [2024-11-19 06:56:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:41,410 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2024-11-19 06:56:41,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 36 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2024-11-19 06:56:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:56:41,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:41,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:41,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:56:41,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:41,612 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:41,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 338487663, now seen corresponding path program 1 times [2024-11-19 06:56:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:41,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681785188] [2024-11-19 06:56:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:42,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681785188] [2024-11-19 06:56:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681785188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179026539] [2024-11-19 06:56:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:42,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:42,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:42,224 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:56:42,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:56:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:42,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 06:56:42,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:42,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:56:42,456 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:42,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:56:42,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:42,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:42,563 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:42,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-19 06:56:42,569 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 16 treesize of output 1 [2024-11-19 06:56:42,661 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:56:42,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 06:56:42,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 06:56:42,677 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:56:42,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-19 06:56:42,733 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:42,733 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 56 treesize of output 51 [2024-11-19 06:56:42,740 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 39 treesize of output 24 [2024-11-19 06:56:42,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-19 06:56:42,925 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 26 treesize of output 14 [2024-11-19 06:56:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:42,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:43,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:43,376 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 56 treesize of output 60 [2024-11-19 06:56:43,449 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_5 Int) (v_ArrVal_1949 (Array Int Int))) (or (< v_prenex_5 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1949) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) |c_ULTIMATE.start_main_~end~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_91| Int) (v_ArrVal_1948 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_91|) 9)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_91|) (< |v_ULTIMATE.start_main_~end~0#1.offset_91| 0))) (forall ((v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (or (< v_prenex_5 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_6) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) (+ |c_ULTIMATE.start_main_~end~0#1.offset| 1)) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5)))) is different from false [2024-11-19 06:56:43,876 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1944 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1944) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 0)) (forall ((v_ArrVal_1945 (Array Int Int)) (v_prenex_5 Int) (v_ArrVal_1949 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1945))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_1949) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) .cse1))) (< v_prenex_5 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5)))) (forall ((v_ArrVal_1944 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1944))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_1945 (Array Int Int)) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (or (< (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1945) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_prenex_6) |c_ULTIMATE.start_main_~list~0#1.base|) v_prenex_5) (+ .cse3 1)) (< v_prenex_5 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| v_prenex_5))) (< .cse3 0))))) (forall ((v_ArrVal_1944 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1944))) (or (forall ((v_ArrVal_1945 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_91| Int) (v_ArrVal_1948 (Array Int Int))) (or (< 0 (+ (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1945) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1948) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_91|) 9)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_91|) (< |v_ULTIMATE.start_main_~end~0#1.offset_91| 0))) (< (select (select .cse4 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 0))))) is different from false [2024-11-19 06:56:44,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:44,136 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 57 treesize of output 49 [2024-11-19 06:56:44,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:44,144 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-11-19 06:56:44,150 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 54 treesize of output 46 [2024-11-19 06:56:44,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:44,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 124 [2024-11-19 06:56:44,170 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 68 treesize of output 60 [2024-11-19 06:56:44,175 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 88 treesize of output 82 [2024-11-19 06:56:44,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:44,185 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 68 treesize of output 72 [2024-11-19 06:56:44,318 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:56:44,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2024-11-19 06:56:44,324 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:56:44,324 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 72 treesize of output 1 [2024-11-19 06:56:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:44,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179026539] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:44,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:44,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2024-11-19 06:56:44,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481551510] [2024-11-19 06:56:44,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:44,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 06:56:44,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:44,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 06:56:44,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1287, Unknown=7, NotChecked=146, Total=1560 [2024-11-19 06:56:44,554 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 40 states, 39 states have (on average 3.282051282051282) internal successors, (128), 40 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:46,364 INFO L93 Difference]: Finished difference Result 257 states and 280 transitions. [2024-11-19 06:56:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:56:46,364 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.282051282051282) internal successors, (128), 40 states have internal predecessors, (128), 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 46 [2024-11-19 06:56:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:46,365 INFO L225 Difference]: With dead ends: 257 [2024-11-19 06:56:46,365 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 06:56:46,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=351, Invalid=2512, Unknown=7, NotChecked=210, Total=3080 [2024-11-19 06:56:46,367 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 464 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:46,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1098 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2047 Invalid, 0 Unknown, 422 Unchecked, 1.2s Time] [2024-11-19 06:56:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 06:56:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 204. [2024-11-19 06:56:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 180 states have (on average 1.211111111111111) internal successors, (218), 202 states have internal predecessors, (218), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 221 transitions. [2024-11-19 06:56:46,373 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 221 transitions. Word has length 46 [2024-11-19 06:56:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:46,373 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 221 transitions. [2024-11-19 06:56:46,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.282051282051282) internal successors, (128), 40 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 221 transitions. [2024-11-19 06:56:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:56:46,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:46,374 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:46,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 06:56:46,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:46,575 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-11-19 06:56:46,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1407484500, now seen corresponding path program 1 times [2024-11-19 06:56:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:46,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053416976] [2024-11-19 06:56:46,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:46,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053416976] [2024-11-19 06:56:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053416976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627228933] [2024-11-19 06:56:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:47,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:47,752 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:56:47,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:56:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:47,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-19 06:56:47,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:47,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:56:47,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:56:48,007 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:48,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:56:48,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:48,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:48,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 23 treesize of output 11 [2024-11-19 06:56:48,108 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:48,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-19 06:56:48,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:56:48,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 06:56:48,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:56:48,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:56:48,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:48,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:56:48,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:56:48,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:48,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:48,344 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:48,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-19 06:56:48,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:56:48,358 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-19 06:56:48,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-19 06:56:48,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-19 06:56:48,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:56:48,469 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:56:48,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-19 06:56:48,505 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 06:56:48,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-19 06:56:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:48,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:48,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:48,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 06:56:49,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_97| Int) (v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2147 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_2149) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2148) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2147) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) |v_ULTIMATE.start_main_~end~0#1.offset_97|) (< |v_ULTIMATE.start_main_~end~0#1.offset_97| 0) (not (= (select v_arrayElimArr_7 (+ |v_ULTIMATE.start_main_~end~0#1.offset_97| 8)) 1))))) is different from false [2024-11-19 06:56:49,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:49,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-19 06:56:49,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-19 06:56:49,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-19 06:56:49,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:49,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 06:56:49,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-11-19 06:56:49,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-19 06:56:49,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:49,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 103 [2024-11-19 06:56:50,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_prenex_16 Int) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= v_prenex_16 .cse0) (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2149 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2139) .cse0 v_prenex_18))) (or (= (select (select (store .cse1 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse1 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= 1 (select v_prenex_17 8))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2145 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2140) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2139) .cse3 v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| .cse3) (not (= (select v_arrayElimArr_7 8) 1))))))) is different from false [2024-11-19 06:56:50,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_prenex_16 Int) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2140) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2149 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| .cse2 v_ArrVal_2139) .cse3 v_prenex_18))) (or (= 1 (select (select (store (store .cse0 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (= (select (select (store .cse0 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= 1 (select v_prenex_17 8)))))) (= .cse3 v_prenex_16)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2145 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2140) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select v_arrayElimArr_7 8) 1)) (= .cse4 |v_ULTIMATE.start_main_#t~malloc8#1.base_9|) (= (select (select (store (store (store |c_#memory_int#1| .cse2 v_ArrVal_2139) .cse4 v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) is different from false [2024-11-19 06:56:50,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:50,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 131 [2024-11-19 06:56:50,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 219 [2024-11-19 06:56:50,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 199 [2024-11-19 06:56:50,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 195 [2024-11-19 06:56:51,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse4 (not .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (or .cse0 (forall ((v_prenex_16 Int) (v_arrayElimCell_85 Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2149 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_18))) (or (= (select (select (store .cse1 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_16) (not (= 1 (select v_prenex_17 8))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)) (= (select (select (store (store .cse1 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (or .cse4 (and (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_2145 (Array Int Int))) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) v_arrayElimCell_93 v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= (select v_arrayElimArr_7 8) 1)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimCell_93))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_arrayElimCell_93 Int) (v_arrayElimArr_7 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_2145 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) v_arrayElimCell_93 v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimCell_93) (not (= (select v_arrayElimArr_7 8) 1)))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_16) (forall ((v_arrayElimCell_92 Int)) (or (= v_prenex_16 v_arrayElimCell_92) (forall ((v_prenex_17 (Array Int Int))) (or (forall ((v_prenex_18 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_18))) (or (= (select (select (store .cse6 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_2139 (Array Int Int))) (= (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2139) v_arrayElimCell_92 v_prenex_18) v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2149 (Array Int Int))) (= (select (select (store (store .cse6 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (not (= 1 (select v_prenex_17 8))))))))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2145 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))) .cse0) (or .cse4 (and (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_92 Int)) (or (= v_prenex_16 v_arrayElimCell_92) (forall ((v_prenex_17 (Array Int Int))) (or (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2149 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (or (forall ((v_ArrVal_2139 (Array Int Int))) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2139) v_arrayElimCell_92 v_prenex_18) v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_18) v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= 1 (select v_prenex_17 8))))))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_92 Int)) (or (= v_prenex_16 v_arrayElimCell_92) (forall ((v_prenex_17 (Array Int Int))) (or (forall ((v_prenex_18 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_18))) (or (= (select (select (store .cse9 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_2139 (Array Int Int))) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2139) v_arrayElimCell_92 v_prenex_18) v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2149 (Array Int Int))) (= (select (select (store (store .cse9 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (not (= 1 (select v_prenex_17 8))))))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_92 Int)) (or (forall ((v_prenex_17 (Array Int Int))) (or (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2149 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2139) v_arrayElimCell_92 v_prenex_18))) (or (= (select (select (store .cse11 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse11 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= 1 (select v_prenex_17 8))))) (= v_prenex_16 v_arrayElimCell_92))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_85 Int) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2149 (Array Int Int)) (v_arrayElimCell_92 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2139) v_arrayElimCell_92 v_prenex_18))) (or (= (select (select (store .cse12 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_18) v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_16 v_arrayElimCell_92) (= (select (select (store (store .cse12 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= 1 (select v_prenex_17 8))))))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int)) (or (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_2145 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) v_arrayElimCell_93 v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= (select v_arrayElimArr_7 8) 1)))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimCell_93))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))) (or .cse4 (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_arrayElimCell_93 Int) (v_arrayElimArr_7 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2145 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) v_arrayElimCell_93 v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimCell_93) (not (= (select v_arrayElimArr_7 8) 1)) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138))))) (or (and (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_16) (forall ((v_arrayElimCell_92 Int)) (or (= v_prenex_16 v_arrayElimCell_92) (forall ((v_prenex_17 (Array Int Int))) (or (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2149 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (or (forall ((v_ArrVal_2139 (Array Int Int))) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2139) v_arrayElimCell_92 v_prenex_18) v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_18) v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= 1 (select v_prenex_17 8))))))))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_16) (forall ((v_arrayElimCell_92 Int)) (or (forall ((v_prenex_17 (Array Int Int))) (or (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2149 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2139) v_arrayElimCell_92 v_prenex_18))) (or (= (select (select (store .cse16 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse16 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= 1 (select v_prenex_17 8))))) (= v_prenex_16 v_arrayElimCell_92))))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138))))) .cse4) (or .cse0 (and (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((v_prenex_16 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_16) (forall ((v_arrayElimCell_92 Int) (v_prenex_17 (Array Int Int))) (or (forall ((v_prenex_18 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_18))) (or (= (select (select (store .cse17 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_2139 (Array Int Int))) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2139) v_arrayElimCell_92 v_prenex_18) v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2149 (Array Int Int))) (= (select (select (store (store .cse17 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (not (= 1 (select v_prenex_17 8))))))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)) (forall ((v_prenex_16 Int)) (or (forall ((v_arrayElimCell_85 Int) (v_ArrVal_2149 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_18))) (or (= (select (select (store .cse19 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= 1 (select v_prenex_17 8))) (= (select (select (store (store .cse19 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_16))))))) (or (and (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int)) (or (forall ((v_arrayElimCell_93 Int) (v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_2145 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (or (forall ((v_prenex_21 (Array Int Int))) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_21) v_arrayElimCell_93 v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (= (select (select (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (not (= (select v_arrayElimArr_7 8) 1)))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))) (forall ((v_ArrVal_2138 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2145 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 8) 1)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2145) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138))))) .cse0) (or .cse4 (forall ((v_prenex_16 Int) (v_arrayElimCell_85 Int) (v_ArrVal_2139 (Array Int Int)) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2149 (Array Int Int)) (v_arrayElimCell_92 Int) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2138))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2139) v_arrayElimCell_92 v_prenex_18))) (or (= (select (select (store .cse21 v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_18) v_prenex_16 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_16) (= v_prenex_16 v_arrayElimCell_92) (= (select (select (store (store .cse21 v_prenex_16 v_ArrVal_2149) v_arrayElimCell_85 v_prenex_17) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= 1 (select v_prenex_17 8))) (not (= (store .cse3 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_2138 |c_ULTIMATE.start_main_~end~0#1.offset|)) v_ArrVal_2138)))))))))) is different from false [2024-11-19 06:57:06,444 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,449 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 97 treesize of output 95 [2024-11-19 06:57:06,464 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:57:06,465 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 75 treesize of output 64 [2024-11-19 06:57:06,475 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 20 [2024-11-19 06:57:06,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,491 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,494 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 154 treesize of output 152 [2024-11-19 06:57:06,506 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:57:06,506 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 132 treesize of output 113 [2024-11-19 06:57:06,514 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 20 [2024-11-19 06:57:06,520 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 20 [2024-11-19 06:57:06,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,549 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,554 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 97 treesize of output 95 [2024-11-19 06:57:06,577 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:57:06,577 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 75 treesize of output 64 [2024-11-19 06:57:06,590 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:57:06,607 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 199 treesize of output 197 [2024-11-19 06:57:06,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:57:06,623 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 189 treesize of output 171 [2024-11-19 06:57:06,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,654 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 122 treesize of output 110 [2024-11-19 06:57:06,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-11-19 06:57:06,708 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 152 [2024-11-19 06:57:06,727 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:57:06,728 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 132 treesize of output 113 [2024-11-19 06:57:06,741 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 20 [2024-11-19 06:57:06,749 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 20 [2024-11-19 06:57:06,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,772 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 163 [2024-11-19 06:57:06,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-19 06:57:06,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,832 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:57:06,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2024-11-19 06:57:06,838 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-19 06:57:06,846 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:57:06,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-19 06:57:06,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 06:57:06,863 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:57:06,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2024-11-19 06:57:06,867 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2024-11-19 06:57:06,883 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:57:06,883 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 18 treesize of output 15 [2024-11-19 06:57:06,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:57:06,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:57:06,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-19 06:57:06,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 06:57:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:57:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627228933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:57:11,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:57:11,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 22] total 59 [2024-11-19 06:57:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625257237] [2024-11-19 06:57:11,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:57:11,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-19 06:57:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:57:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-19 06:57:11,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=2468, Unknown=129, NotChecked=436, Total=3422 [2024-11-19 06:57:11,718 INFO L87 Difference]: Start difference. First operand 204 states and 221 transitions. Second operand has 59 states, 59 states have (on average 2.305084745762712) internal successors, (136), 59 states have internal predecessors, (136), 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)