./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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-circular-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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:57:23,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:57:23,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:57:23,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:57:23,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:57:23,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:57:23,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:57:23,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:57:23,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:57:23,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:57:23,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:57:23,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:57:23,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:57:23,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:57:23,194 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:57:23,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:57:23,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:57:23,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:57:23,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:57:23,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:57:23,197 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:57:23,197 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:57:23,197 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:57:23,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:57:23,198 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:57:23,198 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:57:23,198 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:57:23,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:57:23,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:57:23,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:57:23,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:57:23,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:57:23,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:57:23,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:57:23,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:57:23,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:57:23,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:57:23,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:57:23,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:57:23,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:57:23,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:57:23,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:57:23,202 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2024-11-09 07:57:23,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:57:23,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:57:23,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:57:23,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:57:23,431 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:57:23,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2024-11-09 07:57:24,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:57:24,854 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:57:24,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2024-11-09 07:57:24,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ac541bc/550a4703e83241918fcee3179fbb7856/FLAG334a5bcb0 [2024-11-09 07:57:24,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ac541bc/550a4703e83241918fcee3179fbb7856 [2024-11-09 07:57:24,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:57:24,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:57:24,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:57:24,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:57:24,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:57:24,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:57:24" (1/1) ... [2024-11-09 07:57:24,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1d9f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:24, skipping insertion in model container [2024-11-09 07:57:24,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:57:24" (1/1) ... [2024-11-09 07:57:24,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:57:25,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:57:25,198 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:57:25,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:57:25,266 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:57:25,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25 WrapperNode [2024-11-09 07:57:25,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:57:25,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:57:25,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:57:25,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:57:25,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,299 INFO L138 Inliner]: procedures = 119, calls = 34, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2024-11-09 07:57:25,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:57:25,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:57:25,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:57:25,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:57:25,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,320 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-11-09 07:57:25,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:57:25,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:57:25,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:57:25,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:57:25,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (1/1) ... [2024-11-09 07:57:25,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:57:25,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:25,364 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-09 07:57:25,365 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-09 07:57:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:57:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:57:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:57:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:57:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:57:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:57:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:57:25,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:57:25,492 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:57:25,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:57:25,696 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-09 07:57:25,697 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:57:25,709 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:57:25,709 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 07:57:25,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:57:25 BoogieIcfgContainer [2024-11-09 07:57:25,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:57:25,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:57:25,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:57:25,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:57:25,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:57:24" (1/3) ... [2024-11-09 07:57:25,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ccae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:57:25, skipping insertion in model container [2024-11-09 07:57:25,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:25" (2/3) ... [2024-11-09 07:57:25,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34ccae57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:57:25, skipping insertion in model container [2024-11-09 07:57:25,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:57:25" (3/3) ... [2024-11-09 07:57:25,716 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2024-11-09 07:57:25,729 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:57:25,730 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-09 07:57:25,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:57:25,777 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;@926602e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:57:25,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-09 07:57:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 62 states have (on average 2.129032258064516) internal successors, (132), 112 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:57:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:57:25,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:25,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:57:25,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:25,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-09 07:57:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:25,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367086999] [2024-11-09 07:57:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:25,955 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-09 07:57:25,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:25,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367086999] [2024-11-09 07:57:25,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367086999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:25,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99643139] [2024-11-09 07:57:25,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:25,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:25,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:26,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:26,031 INFO L87 Difference]: Start difference. First operand has 117 states, 62 states have (on average 2.129032258064516) internal successors, (132), 112 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-09 07:57:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,136 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2024-11-09 07:57:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:26,138 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-09 07:57:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,144 INFO L225 Difference]: With dead ends: 107 [2024-11-09 07:57:26,144 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:57:26,145 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-09 07:57:26,147 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 76 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 89 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:57:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-09 07:57:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 57 states have (on average 1.9298245614035088) internal successors, (110), 103 states have internal predecessors, (110), 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-09 07:57:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2024-11-09 07:57:26,177 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 3 [2024-11-09 07:57:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,177 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2024-11-09 07:57:26,177 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-09 07:57:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2024-11-09 07:57:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:57:26,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:57:26,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:57:26,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-09 07:57:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404160109] [2024-11-09 07:57:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,250 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-09 07:57:26,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404160109] [2024-11-09 07:57:26,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404160109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962916391] [2024-11-09 07:57:26,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:26,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:26,253 INFO L87 Difference]: Start difference. First operand 105 states and 113 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-09 07:57:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,329 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2024-11-09 07:57:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:26,330 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-09 07:57:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,330 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:57:26,331 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:57:26,331 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-09 07:57:26,332 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 87 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:57:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 07:57:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 98 states have internal predecessors, (105), 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-09 07:57:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2024-11-09 07:57:26,338 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 3 [2024-11-09 07:57:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,338 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2024-11-09 07:57:26,338 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-09 07:57:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2024-11-09 07:57:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:57:26,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:26,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:57:26,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:26,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,340 INFO L85 PathProgramCache]: Analyzing trace with hash 919164529, now seen corresponding path program 1 times [2024-11-09 07:57:26,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178305901] [2024-11-09 07:57:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,415 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-09 07:57:26,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178305901] [2024-11-09 07:57:26,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178305901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:26,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140825011] [2024-11-09 07:57:26,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:57:26,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:57:26,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:57:26,418 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,536 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-09 07:57:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:26,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:57:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,537 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:57:26,537 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:57:26,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:26,538 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 112 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 62 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:57:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 07:57:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.631578947368421) internal successors, (93), 86 states have internal predecessors, (93), 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-09 07:57:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-11-09 07:57:26,543 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 9 [2024-11-09 07:57:26,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,543 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-11-09 07:57:26,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-11-09 07:57:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:57:26,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:26,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:57:26,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:26,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 919164530, now seen corresponding path program 1 times [2024-11-09 07:57:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5329310] [2024-11-09 07:57:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5329310] [2024-11-09 07:57:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5329310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43201366] [2024-11-09 07:57:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:57:26,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:57:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:57:26,698 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,811 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-11-09 07:57:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:57:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:57:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,813 INFO L225 Difference]: With dead ends: 99 [2024-11-09 07:57:26,814 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:57:26,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:26,815 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 82 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 107 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:57:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2024-11-09 07:57:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 95 states have internal predecessors, (105), 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-09 07:57:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-09 07:57:26,826 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 9 [2024-11-09 07:57:26,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,827 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-09 07:57:26,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-09 07:57:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:57:26,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:26,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:57:26,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:26,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931275, now seen corresponding path program 1 times [2024-11-09 07:57:26,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332412344] [2024-11-09 07:57:26,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,945 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-09 07:57:26,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:26,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332412344] [2024-11-09 07:57:26,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332412344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:26,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054778601] [2024-11-09 07:57:26,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:26,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:26,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:26,948 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:27,036 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-11-09 07:57:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:27,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:57:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:27,037 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:57:27,037 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:57:27,038 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-09 07:57:27,039 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 4 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:27,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 237 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:57:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 07:57:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 94 states have internal predecessors, (103), 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-09 07:57:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-11-09 07:57:27,046 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 12 [2024-11-09 07:57:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:27,046 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-11-09 07:57:27,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-11-09 07:57:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:57:27,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:27,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:27,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:57:27,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:27,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:27,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931274, now seen corresponding path program 1 times [2024-11-09 07:57:27,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:27,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645867283] [2024-11-09 07:57:27,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,190 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-09 07:57:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645867283] [2024-11-09 07:57:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645867283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:27,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:27,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:27,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130567425] [2024-11-09 07:57:27,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:27,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:27,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:27,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:27,194 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:27,296 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2024-11-09 07:57:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:27,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:57:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:27,297 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:57:27,297 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 07:57:27,298 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-09 07:57:27,298 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:27,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 232 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 07:57:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 07:57:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 93 states have internal predecessors, (101), 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-09 07:57:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2024-11-09 07:57:27,302 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 12 [2024-11-09 07:57:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:27,302 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2024-11-09 07:57:27,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-11-09 07:57:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:57:27,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:27,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:27,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:57:27,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:27,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1616812677, now seen corresponding path program 1 times [2024-11-09 07:57:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:27,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872030394] [2024-11-09 07:57:27,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,543 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-09 07:57:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:27,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872030394] [2024-11-09 07:57:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872030394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:27,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733904200] [2024-11-09 07:57:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:27,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:27,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:27,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:27,546 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-09 07:57:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:27,727 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2024-11-09 07:57:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:27,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 15 [2024-11-09 07:57:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:27,728 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:57:27,728 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 07:57:27,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:57:27,729 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 282 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:27,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 306 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 07:57:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2024-11-09 07:57:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 96 states have internal predecessors, (104), 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-09 07:57:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-09 07:57:27,734 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2024-11-09 07:57:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:27,735 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-09 07:57:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-09 07:57:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-09 07:57:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:57:27,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:27,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:27,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:57:27,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:27,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 606345282, now seen corresponding path program 1 times [2024-11-09 07:57:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670162430] [2024-11-09 07:57:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,920 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-09 07:57:27,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:27,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670162430] [2024-11-09 07:57:27,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670162430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:27,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:27,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088487692] [2024-11-09 07:57:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:27,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:27,931 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-09 07:57:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:28,157 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2024-11-09 07:57:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-09 07:57:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:28,158 INFO L225 Difference]: With dead ends: 126 [2024-11-09 07:57:28,159 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 07:57:28,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:57:28,160 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 202 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:28,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 236 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 07:57:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 100. [2024-11-09 07:57:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 98 states have internal predecessors, (107), 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-09 07:57:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2024-11-09 07:57:28,168 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 14 [2024-11-09 07:57:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:28,168 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2024-11-09 07:57:28,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-09 07:57:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2024-11-09 07:57:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:57:28,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:28,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:28,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:57:28,169 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:28,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash 606345283, now seen corresponding path program 1 times [2024-11-09 07:57:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:28,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100788803] [2024-11-09 07:57:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100788803] [2024-11-09 07:57:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100788803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137647114] [2024-11-09 07:57:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:28,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:28,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:28,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:28,420 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-09 07:57:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:28,664 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2024-11-09 07:57:28,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:28,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-09 07:57:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:28,666 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:57:28,666 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 07:57:28,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:57:28,666 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 148 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:28,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 270 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 07:57:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 112. [2024-11-09 07:57:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.5060240963855422) internal successors, (125), 110 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2024-11-09 07:57:28,673 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 14 [2024-11-09 07:57:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:28,674 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2024-11-09 07:57:28,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-09 07:57:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2024-11-09 07:57:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:57:28,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:28,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:28,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:57:28,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:28,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618057, now seen corresponding path program 1 times [2024-11-09 07:57:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679432477] [2024-11-09 07:57:28,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679432477] [2024-11-09 07:57:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679432477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:28,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:28,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:28,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994958331] [2024-11-09 07:57:28,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:28,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:28,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:28,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:28,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:28,813 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:29,036 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2024-11-09 07:57:29,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:57:29,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:57:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:29,038 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:57:29,038 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:57:29,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:57:29,038 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 123 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:29,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 193 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:57:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 07:57:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 109 states have internal predecessors, (124), 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-09 07:57:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2024-11-09 07:57:29,044 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 16 [2024-11-09 07:57:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:29,044 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2024-11-09 07:57:29,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2024-11-09 07:57:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:57:29,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:29,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:29,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:57:29,046 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:29,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:29,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618056, now seen corresponding path program 1 times [2024-11-09 07:57:29,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:29,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982741932] [2024-11-09 07:57:29,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:29,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:29,265 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-09 07:57:29,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:29,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982741932] [2024-11-09 07:57:29,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982741932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:29,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:29,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:29,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401530795] [2024-11-09 07:57:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:29,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:29,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:29,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:29,267 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:29,536 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2024-11-09 07:57:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:57:29,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:57:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:29,537 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:57:29,537 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:57:29,537 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-09 07:57:29,538 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 123 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:29,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 194 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:57:29,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2024-11-09 07:57:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 97 states have internal predecessors, (112), 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-09 07:57:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2024-11-09 07:57:29,540 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 16 [2024-11-09 07:57:29,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:29,541 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2024-11-09 07:57:29,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2024-11-09 07:57:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:57:29,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:29,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:29,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:57:29,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:29,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:29,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1000054462, now seen corresponding path program 1 times [2024-11-09 07:57:29,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:29,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738997584] [2024-11-09 07:57:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:29,816 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-09 07:57:29,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:29,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738997584] [2024-11-09 07:57:29,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738997584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021791041] [2024-11-09 07:57:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:29,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:29,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:29,817 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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-09 07:57:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:30,040 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2024-11-09 07:57:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:30,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-09 07:57:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:30,041 INFO L225 Difference]: With dead ends: 132 [2024-11-09 07:57:30,041 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 07:57:30,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:57:30,042 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 238 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:30,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 344 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 07:57:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2024-11-09 07:57:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 97 states have internal predecessors, (111), 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-09 07:57:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-11-09 07:57:30,044 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 17 [2024-11-09 07:57:30,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:30,044 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-11-09 07:57:30,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 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-09 07:57:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-11-09 07:57:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:57:30,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:30,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:30,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:57:30,045 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1000054461, now seen corresponding path program 1 times [2024-11-09 07:57:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196442118] [2024-11-09 07:57:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,294 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-09 07:57:30,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:30,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196442118] [2024-11-09 07:57:30,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196442118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:30,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:30,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:30,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486396725] [2024-11-09 07:57:30,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:30,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:30,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:30,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:30,296 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-09 07:57:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:30,520 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2024-11-09 07:57:30,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:30,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-09 07:57:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:30,521 INFO L225 Difference]: With dead ends: 131 [2024-11-09 07:57:30,521 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 07:57:30,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:57:30,522 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 183 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:30,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 233 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 07:57:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 99. [2024-11-09 07:57:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 97 states have internal predecessors, (110), 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-09 07:57:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2024-11-09 07:57:30,526 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 17 [2024-11-09 07:57:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:30,526 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2024-11-09 07:57:30,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-09 07:57:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2024-11-09 07:57:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:57:30,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:30,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:30,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:57:30,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:30,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash -936932038, now seen corresponding path program 1 times [2024-11-09 07:57:30,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:30,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251054970] [2024-11-09 07:57:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:30,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,674 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-09 07:57:30,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:30,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251054970] [2024-11-09 07:57:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251054970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:30,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:30,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:30,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058468135] [2024-11-09 07:57:30,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:30,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:30,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:30,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:30,676 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:30,851 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-11-09 07:57:30,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:30,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:57:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:30,852 INFO L225 Difference]: With dead ends: 128 [2024-11-09 07:57:30,852 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 07:57:30,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:57:30,853 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 221 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:30,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 212 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 07:57:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2024-11-09 07:57:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.5) internal successors, (141), 114 states have internal predecessors, (141), 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-09 07:57:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2024-11-09 07:57:30,856 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 18 [2024-11-09 07:57:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:30,857 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2024-11-09 07:57:30,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:30,857 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2024-11-09 07:57:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:57:30,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:30,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:30,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:57:30,858 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:30,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -936932037, now seen corresponding path program 1 times [2024-11-09 07:57:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921683489] [2024-11-09 07:57:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:30,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:31,096 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-09 07:57:31,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:31,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921683489] [2024-11-09 07:57:31,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921683489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:31,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:31,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:31,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461396814] [2024-11-09 07:57:31,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:31,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:31,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:31,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:31,098 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:31,276 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2024-11-09 07:57:31,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:31,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:57:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:31,277 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:57:31,277 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:57:31,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:31,279 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 131 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:31,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 211 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:57:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2024-11-09 07:57:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 119 states have internal predecessors, (146), 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-09 07:57:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 149 transitions. [2024-11-09 07:57:31,282 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 149 transitions. Word has length 18 [2024-11-09 07:57:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:31,283 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 149 transitions. [2024-11-09 07:57:31,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2024-11-09 07:57:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:57:31,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:31,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, 1] [2024-11-09 07:57:31,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:57:31,285 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:31,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash 850271077, now seen corresponding path program 1 times [2024-11-09 07:57:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:31,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545208584] [2024-11-09 07:57:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:31,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:31,425 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-09 07:57:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545208584] [2024-11-09 07:57:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545208584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:31,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560277187] [2024-11-09 07:57:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:31,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:31,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:31,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:31,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:31,429 INFO L87 Difference]: Start difference. First operand 121 states and 149 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:31,544 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2024-11-09 07:57:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:31,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 07:57:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:31,546 INFO L225 Difference]: With dead ends: 139 [2024-11-09 07:57:31,546 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 07:57:31,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:31,546 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 166 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:31,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 225 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 07:57:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 122. [2024-11-09 07:57:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 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-09 07:57:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 150 transitions. [2024-11-09 07:57:31,550 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 150 transitions. Word has length 21 [2024-11-09 07:57:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:31,550 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 150 transitions. [2024-11-09 07:57:31,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2024-11-09 07:57:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:57:31,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:31,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:31,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:57:31,552 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:31,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:31,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2045537116, now seen corresponding path program 1 times [2024-11-09 07:57:31,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:31,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593253983] [2024-11-09 07:57:31,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:31,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:31,575 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-09 07:57:31,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:31,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593253983] [2024-11-09 07:57:31,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593253983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:31,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:31,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284237614] [2024-11-09 07:57:31,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:31,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:31,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:31,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:31,576 INFO L87 Difference]: Start difference. First operand 122 states and 150 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:31,583 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2024-11-09 07:57:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:57:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:31,584 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:57:31,584 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:57:31,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 07:57:31,585 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:31,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:57:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 07:57:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.4563106796116505) internal successors, (150), 123 states have internal predecessors, (150), 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-09 07:57:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2024-11-09 07:57:31,588 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 23 [2024-11-09 07:57:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:31,588 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2024-11-09 07:57:31,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2024-11-09 07:57:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:57:31,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:31,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:31,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:57:31,589 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:31,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1458080557, now seen corresponding path program 1 times [2024-11-09 07:57:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83486951] [2024-11-09 07:57:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83486951] [2024-11-09 07:57:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83486951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:31,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:31,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114406591] [2024-11-09 07:57:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:31,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:31,645 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:31,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:31,738 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2024-11-09 07:57:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:31,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:57:31,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:31,740 INFO L225 Difference]: With dead ends: 124 [2024-11-09 07:57:31,740 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 07:57:31,741 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-09 07:57:31,741 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:31,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 180 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 07:57:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 07:57:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 122 states have internal predecessors, (147), 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-09 07:57:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2024-11-09 07:57:31,744 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 22 [2024-11-09 07:57:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:31,744 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2024-11-09 07:57:31,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2024-11-09 07:57:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:57:31,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:31,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:31,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:57:31,746 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:31,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:31,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1458080558, now seen corresponding path program 1 times [2024-11-09 07:57:31,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:31,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901108472] [2024-11-09 07:57:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:32,021 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-09 07:57:32,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:32,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901108472] [2024-11-09 07:57:32,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901108472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:32,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:32,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:32,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856450933] [2024-11-09 07:57:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:32,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:32,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:32,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:32,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:32,023 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:32,254 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2024-11-09 07:57:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:57:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:57:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:32,255 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:57:32,255 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:57:32,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:57:32,255 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 186 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:32,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 339 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:57:32,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2024-11-09 07:57:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 122 states have internal predecessors, (146), 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-09 07:57:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2024-11-09 07:57:32,258 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 22 [2024-11-09 07:57:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:32,259 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2024-11-09 07:57:32,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2024-11-09 07:57:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:57:32,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:32,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:32,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:57:32,260 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:32,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1782166538, now seen corresponding path program 1 times [2024-11-09 07:57:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386095536] [2024-11-09 07:57:32,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:32,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:32,328 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-09 07:57:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386095536] [2024-11-09 07:57:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386095536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:32,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:57:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285444734] [2024-11-09 07:57:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:32,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:57:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:57:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:32,330 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:32,408 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2024-11-09 07:57:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:57:32,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:57:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:32,409 INFO L225 Difference]: With dead ends: 124 [2024-11-09 07:57:32,409 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 07:57:32,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:32,409 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 104 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:32,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 104 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 07:57:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-09 07:57:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2024-11-09 07:57:32,411 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 23 [2024-11-09 07:57:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:32,412 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2024-11-09 07:57:32,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2024-11-09 07:57:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:57:32,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:32,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:32,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:57:32,413 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:32,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1066726440, now seen corresponding path program 1 times [2024-11-09 07:57:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:32,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129312421] [2024-11-09 07:57:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:32,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:32,575 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-09 07:57:32,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129312421] [2024-11-09 07:57:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129312421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:32,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624640506] [2024-11-09 07:57:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:32,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:32,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:32,577 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:32,715 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2024-11-09 07:57:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:32,715 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:57:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:32,716 INFO L225 Difference]: With dead ends: 135 [2024-11-09 07:57:32,716 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 07:57:32,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:32,716 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 34 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:32,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 328 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 07:57:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2024-11-09 07:57:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 119 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2024-11-09 07:57:32,720 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 23 [2024-11-09 07:57:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:32,720 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2024-11-09 07:57:32,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2024-11-09 07:57:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:57:32,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:32,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:32,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:57:32,721 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:32,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1068143498, now seen corresponding path program 1 times [2024-11-09 07:57:32,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:32,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796729385] [2024-11-09 07:57:32,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:32,881 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-09 07:57:32,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:32,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796729385] [2024-11-09 07:57:32,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796729385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:32,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:32,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:32,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331789747] [2024-11-09 07:57:32,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:32,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:32,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:32,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:32,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:32,883 INFO L87 Difference]: Start difference. First operand 121 states and 144 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:33,003 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2024-11-09 07:57:33,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:57:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:33,005 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:57:33,005 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:57:33,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:57:33,006 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 185 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:33,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 250 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:57:33,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2024-11-09 07:57:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 120 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2024-11-09 07:57:33,008 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 23 [2024-11-09 07:57:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:33,009 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2024-11-09 07:57:33,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2024-11-09 07:57:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:57:33,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:33,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:33,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:57:33,010 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:33,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:33,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1015078286, now seen corresponding path program 1 times [2024-11-09 07:57:33,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:33,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393918741] [2024-11-09 07:57:33,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:33,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393918741] [2024-11-09 07:57:33,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393918741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:33,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:33,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:57:33,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248086402] [2024-11-09 07:57:33,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:33,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:57:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:33,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:57:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:33,056 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:33,166 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2024-11-09 07:57:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:57:33,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 07:57:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:33,166 INFO L225 Difference]: With dead ends: 124 [2024-11-09 07:57:33,167 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 07:57:33,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:33,167 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 46 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:33,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 173 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 07:57:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-11-09 07:57:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2024-11-09 07:57:33,170 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 24 [2024-11-09 07:57:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:33,170 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2024-11-09 07:57:33,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2024-11-09 07:57:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:57:33,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:33,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:33,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:57:33,171 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:33,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1015078287, now seen corresponding path program 1 times [2024-11-09 07:57:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470140344] [2024-11-09 07:57:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:33,436 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-09 07:57:33,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:33,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470140344] [2024-11-09 07:57:33,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470140344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:33,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387101639] [2024-11-09 07:57:33,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:33,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:33,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:33,438 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-09 07:57:33,439 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-09 07:57:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:33,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:57:33,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:33,587 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-09 07:57:33,592 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-09 07:57:33,611 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-09 07:57:33,616 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-09 07:57:33,626 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-09 07:57:33,630 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-09 07:57:33,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:33,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:57:33,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:33,690 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-09 07:57:33,932 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:57:33,933 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 31 [2024-11-09 07:57:33,936 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 7 treesize of output 3 [2024-11-09 07:57:33,969 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-09 07:57:33,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:34,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:34,053 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 33 treesize of output 37 [2024-11-09 07:57:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387101639] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:34,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:34,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 10] total 22 [2024-11-09 07:57:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250778168] [2024-11-09 07:57:34,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:34,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:57:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:34,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:57:34,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:57:34,099 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:34,282 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2024-11-09 07:57:34,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:57:34,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 07:57:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:34,284 INFO L225 Difference]: With dead ends: 123 [2024-11-09 07:57:34,284 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 07:57:34,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:57:34,285 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:34,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 193 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 07:57:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-09 07:57:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 120 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2024-11-09 07:57:34,287 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 24 [2024-11-09 07:57:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:34,288 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2024-11-09 07:57:34,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2024-11-09 07:57:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:57:34,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:34,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:34,302 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-09 07:57:34,492 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,SelfDestructingSolverStorable23 [2024-11-09 07:57:34,494 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:34,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:34,494 INFO L85 PathProgramCache]: Analyzing trace with hash -11274789, now seen corresponding path program 1 times [2024-11-09 07:57:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:34,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32783090] [2024-11-09 07:57:34,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:34,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32783090] [2024-11-09 07:57:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32783090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:34,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:34,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:57:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870997768] [2024-11-09 07:57:34,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:34,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:57:34,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:34,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:57:34,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:57:34,746 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:34,928 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2024-11-09 07:57:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:57:34,929 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:57:34,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:34,929 INFO L225 Difference]: With dead ends: 135 [2024-11-09 07:57:34,929 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 07:57:34,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:57:34,931 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:34,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 428 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 07:57:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2024-11-09 07:57:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2024-11-09 07:57:34,935 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 25 [2024-11-09 07:57:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:34,935 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2024-11-09 07:57:34,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2024-11-09 07:57:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:57:34,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:34,940 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] [2024-11-09 07:57:34,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 07:57:34,940 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:34,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:34,941 INFO L85 PathProgramCache]: Analyzing trace with hash 532659763, now seen corresponding path program 1 times [2024-11-09 07:57:34,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:34,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098889041] [2024-11-09 07:57:34,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:34,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098889041] [2024-11-09 07:57:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098889041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114049433] [2024-11-09 07:57:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:35,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:35,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:35,193 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-09 07:57:35,194 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-09 07:57:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:35,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:57:35,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:35,284 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-09 07:57:35,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:35,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:57:35,302 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-09 07:57:35,310 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-09 07:57:35,314 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-09 07:57:35,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:35,367 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-09 07:57:35,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:35,372 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-09 07:57:35,380 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-09 07:57:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:35,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:35,472 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 5 [2024-11-09 07:57:36,001 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 36 treesize of output 34 [2024-11-09 07:57:36,005 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:36,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:36,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:36,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:36,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 6 [2024-11-09 07:57:36,027 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:57:36,028 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 16 [2024-11-09 07:57:36,036 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 27 treesize of output 25 [2024-11-09 07:57:36,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:36,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114049433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:36,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:36,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2024-11-09 07:57:36,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342615185] [2024-11-09 07:57:36,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:36,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:57:36,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:36,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:57:36,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=492, Unknown=17, NotChecked=0, Total=600 [2024-11-09 07:57:36,069 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 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-09 07:57:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:36,755 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2024-11-09 07:57:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:57:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:57:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:36,756 INFO L225 Difference]: With dead ends: 147 [2024-11-09 07:57:36,756 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 07:57:36,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1292, Unknown=17, NotChecked=0, Total=1640 [2024-11-09 07:57:36,758 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 599 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:36,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 700 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 07:57:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2024-11-09 07:57:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.308411214953271) internal successors, (140), 122 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2024-11-09 07:57:36,761 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 26 [2024-11-09 07:57:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:36,761 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2024-11-09 07:57:36,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 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-09 07:57:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2024-11-09 07:57:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:57:36,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:36,762 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-09 07:57:36,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:57:36,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 07:57:36,966 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:36,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:36,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1064543596, now seen corresponding path program 1 times [2024-11-09 07:57:36,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:36,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898815529] [2024-11-09 07:57:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:36,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,256 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-09 07:57:37,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:37,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898815529] [2024-11-09 07:57:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898815529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:37,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:57:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446054642] [2024-11-09 07:57:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:37,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:57:37,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:37,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:57:37,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:57:37,258 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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-09 07:57:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:37,505 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2024-11-09 07:57:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:57:37,505 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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-09 07:57:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:37,506 INFO L225 Difference]: With dead ends: 130 [2024-11-09 07:57:37,506 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 07:57:37,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:57:37,506 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 142 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:37,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 451 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 07:57:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2024-11-09 07:57:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3018867924528301) internal successors, (138), 121 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2024-11-09 07:57:37,508 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 27 [2024-11-09 07:57:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:37,509 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2024-11-09 07:57:37,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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-09 07:57:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2024-11-09 07:57:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:57:37,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:37,509 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-09 07:57:37,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 07:57:37,509 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:37,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1274137331, now seen corresponding path program 1 times [2024-11-09 07:57:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:37,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864304963] [2024-11-09 07:57:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,530 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-09 07:57:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864304963] [2024-11-09 07:57:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864304963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:37,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:57:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474197364] [2024-11-09 07:57:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:37,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:37,532 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-09 07:57:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:37,540 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2024-11-09 07:57:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:37,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-09 07:57:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:37,541 INFO L225 Difference]: With dead ends: 140 [2024-11-09 07:57:37,541 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 07:57:37,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09 07:57:37,542 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 5 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:37,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 07:57:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-11-09 07:57:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 122 states have (on average 1.278688524590164) internal successors, (156), 137 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2024-11-09 07:57:37,545 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 27 [2024-11-09 07:57:37,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:37,545 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2024-11-09 07:57:37,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-09 07:57:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2024-11-09 07:57:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:57:37,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:37,545 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:37,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 07:57:37,546 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:37,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash -667416458, now seen corresponding path program 1 times [2024-11-09 07:57:37,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:37,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122119012] [2024-11-09 07:57:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:37,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,776 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-09 07:57:37,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:37,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122119012] [2024-11-09 07:57:37,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122119012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:37,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8746513] [2024-11-09 07:57:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:37,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:37,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:37,779 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-09 07:57:37,780 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-09 07:57:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 07:57:37,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:37,877 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-09 07:57:37,880 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-09 07:57:37,886 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-09 07:57:37,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:57:37,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:57:37,903 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-09 07:57:37,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:57:37,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:37,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:57:37,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:37,956 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-09 07:57:38,217 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:57:38,218 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 33 [2024-11-09 07:57:38,220 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 7 treesize of output 3 [2024-11-09 07:57:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:38,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:38,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8746513] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:38,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:38,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 14] total 27 [2024-11-09 07:57:38,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870739924] [2024-11-09 07:57:38,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2024-11-09 07:57:38,406 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:38,541 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2024-11-09 07:57:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:38,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 07:57:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:38,543 INFO L225 Difference]: With dead ends: 159 [2024-11-09 07:57:38,543 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 07:57:38,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:57:38,544 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:38,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 324 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 07:57:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2024-11-09 07:57:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 132 states have (on average 1.2575757575757576) internal successors, (166), 147 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2024-11-09 07:57:38,546 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 27 [2024-11-09 07:57:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:38,546 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2024-11-09 07:57:38,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2024-11-09 07:57:38,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:57:38,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:38,547 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:38,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:57:38,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 07:57:38,748 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:38,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash 762074956, now seen corresponding path program 1 times [2024-11-09 07:57:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:38,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783655669] [2024-11-09 07:57:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:39,020 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-09 07:57:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783655669] [2024-11-09 07:57:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783655669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691775320] [2024-11-09 07:57:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:39,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:39,023 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-09 07:57:39,023 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-09 07:57:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:39,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 07:57:39,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:39,123 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-09 07:57:39,144 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:39,144 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-09 07:57:39,166 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-09 07:57:39,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:57:39,230 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:39,230 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-09 07:57:39,234 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-09 07:57:39,246 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-09 07:57:39,302 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:57:39,302 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-09 07:57:39,324 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-09 07:57:39,368 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:39,368 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 33 treesize of output 32 [2024-11-09 07:57:39,384 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 24 treesize of output 12 [2024-11-09 07:57:39,389 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-09 07:57:39,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:39,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_977 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2024-11-09 07:57:39,568 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_974 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_973))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_977)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))) (or (forall ((v_ArrVal_974 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_973))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (= .cse1 0) (not (= (select (select (store .cse2 .cse1 v_ArrVal_977) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))))))) is different from false [2024-11-09 07:57:39,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:39,646 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-09 07:57:39,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-09 07:57:39,653 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 5 [2024-11-09 07:57:39,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:39,658 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 56 treesize of output 40 [2024-11-09 07:57:39,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:39,666 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 162 treesize of output 145 [2024-11-09 07:57:39,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:39,676 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 86 treesize of output 82 [2024-11-09 07:57:39,680 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 66 treesize of output 62 [2024-11-09 07:57:39,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:39,773 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 37 treesize of output 30 [2024-11-09 07:57:39,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:39,785 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 141 treesize of output 128 [2024-11-09 07:57:39,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:39,796 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 76 treesize of output 75 [2024-11-09 07:57:39,799 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 66 treesize of output 62 [2024-11-09 07:57:39,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:39,832 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-09 07:57:39,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-09 07:57:39,838 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-09 07:57:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:57:39,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691775320] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:39,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 30 [2024-11-09 07:57:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544039837] [2024-11-09 07:57:39,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:39,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:57:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:39,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:57:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=655, Unknown=15, NotChecked=106, Total=870 [2024-11-09 07:57:39,963 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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-09 07:57:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:40,659 INFO L93 Difference]: Finished difference Result 241 states and 270 transitions. [2024-11-09 07:57:40,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:57:40,660 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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 30 [2024-11-09 07:57:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:40,661 INFO L225 Difference]: With dead ends: 241 [2024-11-09 07:57:40,661 INFO L226 Difference]: Without dead ends: 241 [2024-11-09 07:57:40,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=1212, Unknown=15, NotChecked=146, Total=1560 [2024-11-09 07:57:40,662 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 272 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:40,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 900 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1048 Invalid, 0 Unknown, 309 Unchecked, 0.5s Time] [2024-11-09 07:57:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-09 07:57:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 174. [2024-11-09 07:57:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 172 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2024-11-09 07:57:40,665 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 30 [2024-11-09 07:57:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:40,665 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2024-11-09 07:57:40,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 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-09 07:57:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2024-11-09 07:57:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:57:40,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:40,666 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] [2024-11-09 07:57:40,682 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-09 07:57:40,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:40,870 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2053626213, now seen corresponding path program 1 times [2024-11-09 07:57:40,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:40,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265967410] [2024-11-09 07:57:40,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:41,108 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-09 07:57:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265967410] [2024-11-09 07:57:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265967410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137324554] [2024-11-09 07:57:41,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:41,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:41,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:41,111 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-09 07:57:41,112 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-09 07:57:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:41,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:57:41,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:41,214 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-09 07:57:41,236 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:57:41,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:57:41,262 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-09 07:57:41,321 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:41,321 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-09 07:57:41,378 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:57:41,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:57:41,404 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:57:41,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:57:41,445 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:41,445 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-09 07:57:41,467 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-09 07:57:41,516 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-09 07:57:41,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:41,568 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1088 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1088) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:57:41,574 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1085 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1085))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1088)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:57:41,577 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1085 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1085))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1088)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:57:41,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:41,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-09 07:57:41,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:41,594 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 252 treesize of output 227 [2024-11-09 07:57:41,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 171 treesize of output 163 [2024-11-09 07:57:41,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:41,607 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 163 treesize of output 159 [2024-11-09 07:57:42,094 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-09 07:57:42,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137324554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:42,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:42,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 27 [2024-11-09 07:57:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211037593] [2024-11-09 07:57:42,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:42,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:57:42,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:42,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:57:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=485, Unknown=13, NotChecked=144, Total=756 [2024-11-09 07:57:42,098 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 28 states have internal predecessors, (76), 0 states have call successors, (0), 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-09 07:57:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:42,712 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2024-11-09 07:57:42,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:57:42,713 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 28 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 07:57:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:42,714 INFO L225 Difference]: With dead ends: 244 [2024-11-09 07:57:42,714 INFO L226 Difference]: Without dead ends: 244 [2024-11-09 07:57:42,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=954, Unknown=14, NotChecked=204, Total=1406 [2024-11-09 07:57:42,715 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 426 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 544 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:42,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 565 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 766 Invalid, 0 Unknown, 544 Unchecked, 0.4s Time] [2024-11-09 07:57:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-09 07:57:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 176. [2024-11-09 07:57:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 174 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2024-11-09 07:57:42,718 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 29 [2024-11-09 07:57:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:42,718 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2024-11-09 07:57:42,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 28 states have internal predecessors, (76), 0 states have call successors, (0), 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-09 07:57:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2024-11-09 07:57:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:57:42,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:42,718 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] [2024-11-09 07:57:42,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:57:42,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:42,920 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:42,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:42,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2053626212, now seen corresponding path program 1 times [2024-11-09 07:57:42,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:42,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206153353] [2024-11-09 07:57:42,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:42,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:43,192 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-09 07:57:43,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:43,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206153353] [2024-11-09 07:57:43,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206153353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:43,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351043234] [2024-11-09 07:57:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:43,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:43,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:43,194 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-09 07:57:43,195 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-09 07:57:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:43,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 07:57:43,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:43,296 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-09 07:57:43,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:43,316 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-09 07:57:43,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:57:43,346 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-09 07:57:43,352 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-09 07:57:43,412 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:43,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:57:43,415 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-09 07:57:43,472 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:57:43,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:57:43,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:43,477 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-09 07:57:43,501 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:43,501 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-09 07:57:43,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:57:43,515 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:57:43,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:57:43,559 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:43,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:57:43,564 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-09 07:57:43,581 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-09 07:57:43,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:57:43,617 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-09 07:57:43,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:43,761 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1203 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1204) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1203 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2024-11-09 07:57:43,769 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1203 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1203 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1204) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-09 07:57:43,781 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1198) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1197) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1197))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1198) .cse0 v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1204) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-09 07:57:43,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1198) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1197) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1203 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1197))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1198) .cse1 v_ArrVal_1203) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1204) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-11-09 07:57:43,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:43,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 07:57:43,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:43,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 07:57:43,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:43,812 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 334 treesize of output 301 [2024-11-09 07:57:43,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:43,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 474 treesize of output 457 [2024-11-09 07:57:43,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 172 [2024-11-09 07:57:43,855 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 172 treesize of output 164 [2024-11-09 07:57:43,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:43,864 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 164 treesize of output 154 [2024-11-09 07:57:43,870 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 74 treesize of output 70 [2024-11-09 07:57:43,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:43,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-09 07:57:44,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:44,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-09 07:57:44,006 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:44,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-09 07:57:44,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:44,011 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 07:57:44,099 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-09 07:57:44,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351043234] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:44,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:44,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 30 [2024-11-09 07:57:44,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327977524] [2024-11-09 07:57:44,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:44,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:57:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:57:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=613, Unknown=10, NotChecked=212, Total=930 [2024-11-09 07:57:44,101 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 07:57:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:44,862 INFO L93 Difference]: Finished difference Result 240 states and 268 transitions. [2024-11-09 07:57:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:57:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 07:57:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:44,863 INFO L225 Difference]: With dead ends: 240 [2024-11-09 07:57:44,863 INFO L226 Difference]: Without dead ends: 240 [2024-11-09 07:57:44,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=1256, Unknown=10, NotChecked=308, Total=1806 [2024-11-09 07:57:44,864 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 324 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 621 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:44,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 809 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1185 Invalid, 0 Unknown, 621 Unchecked, 0.5s Time] [2024-11-09 07:57:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-09 07:57:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 178. [2024-11-09 07:57:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.236024844720497) internal successors, (199), 176 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 201 transitions. [2024-11-09 07:57:44,868 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 201 transitions. Word has length 29 [2024-11-09 07:57:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:44,868 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 201 transitions. [2024-11-09 07:57:44,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 07:57:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 201 transitions. [2024-11-09 07:57:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:57:44,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:44,868 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-09 07:57:44,881 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-09 07:57:45,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:45,069 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-09 07:57:45,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash -837651138, now seen corresponding path program 1 times [2024-11-09 07:57:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760430457] [2024-11-09 07:57:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:45,305 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-09 07:57:45,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:45,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760430457] [2024-11-09 07:57:45,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760430457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:45,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893832385] [2024-11-09 07:57:45,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:45,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:45,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:45,308 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-09 07:57:45,309 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-09 07:57:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:45,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 07:57:45,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:45,414 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-09 07:57:45,432 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-09 07:57:45,436 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-09 07:57:45,464 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-09 07:57:45,469 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-09 07:57:45,476 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-09 07:57:45,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:57:45,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:45,541 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-09 07:57:45,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:45,545 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-09 07:57:45,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 07:57:45,771 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2024-11-09 07:57:45,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 19 [2024-11-09 07:57:45,773 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-09 07:57:45,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:45,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1266)) (.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (or (not (= v_ArrVal_1266 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_1266 .cse0)))) (< (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (= (select |c_#valid| (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1267))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select .cse2 (select (select .cse2 .cse3) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (select (select .cse1 .cse3) |v_ULTIMATE.start_main_~x~0#1.offset_74|))))) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_1267 .cse0)) v_ArrVal_1267)) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0)))) is different from false [2024-11-09 07:57:45,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (let ((.cse2 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (or (= (select |c_#valid| (let ((.cse1 (select v_ArrVal_1267 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1267))) (select .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1266) .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_74|)))) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|) (not (= v_ArrVal_1266 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2 (select v_ArrVal_1266 .cse2)))) (not (= v_ArrVal_1267 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2 (select v_ArrVal_1267 .cse2)))) (< (select v_ArrVal_1266 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0)))) is different from false [2024-11-09 07:57:45,981 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (or (= (select |c_#valid| (let ((.cse1 (select v_ArrVal_1267 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1267))) (select .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1266) .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_74|)))) 1) (not (= v_ArrVal_1267 (store .cse2 .cse3 (select v_ArrVal_1267 .cse3)))) (not (= v_ArrVal_1266 (store .cse4 .cse3 (select v_ArrVal_1266 .cse3)))) (< (select v_ArrVal_1266 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))) (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (let ((.cse5 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (or (not (= (store (store .cse4 .cse3 (select v_ArrVal_1266 .cse3)) .cse5 (select v_ArrVal_1266 .cse5)) v_ArrVal_1266)) (= (select |c_#valid| (let ((.cse7 (select v_ArrVal_1267 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1267))) (select .cse6 (select (select .cse6 .cse7) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1266) .cse7) |v_ULTIMATE.start_main_~x~0#1.offset_74|)))) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_75|) (not (= (store (store .cse2 .cse3 (select v_ArrVal_1267 .cse3)) .cse5 (select v_ArrVal_1267 .cse5)) v_ArrVal_1267)) (< (select v_ArrVal_1266 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0)))))) is different from false [2024-11-09 07:57:46,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (or (= (select |c_#valid| (let ((.cse1 (select v_ArrVal_1267 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1267))) (select .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1266) .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_74|)))) 1) (not (= (store (store .cse2 .cse3 (select v_ArrVal_1267 .cse3)) .cse4 (select v_ArrVal_1267 .cse4)) v_ArrVal_1267)) (not (= v_ArrVal_1266 (store (store .cse5 .cse3 (select v_ArrVal_1266 .cse3)) .cse4 (select v_ArrVal_1266 .cse4)))) (< (select v_ArrVal_1266 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))) (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1266 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (let ((.cse8 (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (or (= (select |c_#valid| (let ((.cse7 (select v_ArrVal_1267 |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1267))) (select .cse6 (select (select .cse6 .cse7) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_1266) .cse7) |v_ULTIMATE.start_main_~x~0#1.offset_74|)))) 1) (not (= (store (store (store .cse2 .cse3 (select v_ArrVal_1267 .cse3)) .cse4 (select v_ArrVal_1267 .cse4)) .cse8 (select v_ArrVal_1267 .cse8)) v_ArrVal_1267)) (< |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_75|) (not (= v_ArrVal_1266 (store (store (store .cse5 .cse3 (select v_ArrVal_1266 .cse3)) .cse4 (select v_ArrVal_1266 .cse4)) .cse8 (select v_ArrVal_1266 .cse8)))) (< (select v_ArrVal_1266 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0)))))) is different from false [2024-11-09 07:57:46,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:46,043 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 51 treesize of output 49 [2024-11-09 07:57:46,074 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-11-09 07:57:46,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 150 [2024-11-09 07:57:46,089 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,090 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,092 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 144 treesize of output 138 [2024-11-09 07:57:46,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:46,126 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 24 treesize of output 28 [2024-11-09 07:57:46,140 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,141 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:46,147 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 348 treesize of output 346 [2024-11-09 07:57:46,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:46,280 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 58 [2024-11-09 07:57:46,325 INFO L349 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2024-11-09 07:57:46,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 149 treesize of output 151 [2024-11-09 07:57:46,344 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,345 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,346 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,348 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 4035 treesize of output 4011 [2024-11-09 07:57:46,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:46,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 190 [2024-11-09 07:57:46,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,776 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,776 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:46,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:46,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 46944 treesize of output 46759