./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:12:09,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:12:10,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:12:10,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:12:10,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:12:10,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:12:10,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:12:10,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:12:10,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:12:10,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:12:10,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:12:10,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:12:10,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:12:10,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:12:10,077 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:12:10,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:12:10,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:12:10,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:12:10,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:12:10,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:12:10,081 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:12:10,081 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:12:10,081 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:12:10,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:12:10,082 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:12:10,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:12:10,082 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:12:10,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:12:10,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:12:10,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:12:10,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:12:10,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:12:10,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:12:10,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:12:10,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:12:10,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:12:10,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:12:10,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:12:10,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:12:10,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:12:10,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:12:10,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:12:10,090 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-clean/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-clean/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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2024-10-11 18:12:10,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:12:10,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:12:10,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:12:10,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:12:10,382 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:12:10,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2024-10-11 18:12:11,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:12:12,001 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:12:12,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2024-10-11 18:12:12,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/abf4e6c6f/4a21726786ee47a8a6da85e42fbe10d9/FLAGe53f011e6 [2024-10-11 18:12:12,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/abf4e6c6f/4a21726786ee47a8a6da85e42fbe10d9 [2024-10-11 18:12:12,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:12:12,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:12:12,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:12:12,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:12:12,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:12:12,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0d678c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12, skipping insertion in model container [2024-10-11 18:12:12,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:12:12,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:12:12,451 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:12:12,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:12:12,527 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:12:12,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12 WrapperNode [2024-10-11 18:12:12,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:12:12,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:12:12,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:12:12,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:12:12,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,579 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2024-10-11 18:12:12,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:12:12,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:12:12,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:12:12,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:12:12,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,627 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2024-10-11 18:12:12,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:12:12,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:12:12,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:12:12,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:12:12,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (1/1) ... [2024-10-11 18:12:12,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:12:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:12,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:12:12,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:12:12,767 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 18:12:12,767 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 18:12:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:12:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:12:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:12:12,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:12:12,904 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:12:12,905 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:12:13,360 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-10-11 18:12:13,360 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:12:13,407 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:12:13,407 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 18:12:13,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:13 BoogieIcfgContainer [2024-10-11 18:12:13,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:12:13,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:12:13,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:12:13,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:12:13,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:12:12" (1/3) ... [2024-10-11 18:12:13,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27246805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:13, skipping insertion in model container [2024-10-11 18:12:13,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:12:12" (2/3) ... [2024-10-11 18:12:13,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27246805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:12:13, skipping insertion in model container [2024-10-11 18:12:13,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:12:13" (3/3) ... [2024-10-11 18:12:13,419 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2024-10-11 18:12:13,438 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:12:13,439 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2024-10-11 18:12:13,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:12:13,503 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;@7ff5bd1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:12:13,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-10-11 18:12:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 69 states have (on average 2.4057971014492754) internal successors, (166), 137 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:12:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:12:13,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:13,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:12:13,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash 10956, now seen corresponding path program 1 times [2024-10-11 18:12:13,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:13,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391911125] [2024-10-11 18:12:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:13,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:13,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391911125] [2024-10-11 18:12:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391911125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:13,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:13,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:12:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472967566] [2024-10-11 18:12:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:13,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:13,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:13,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:13,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:13,773 INFO L87 Difference]: Start difference. First operand has 144 states, 69 states have (on average 2.4057971014492754) internal successors, (166), 137 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:13,967 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2024-10-11 18:12:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:13,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 18:12:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:13,980 INFO L225 Difference]: With dead ends: 133 [2024-10-11 18:12:13,980 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 18:12:13,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:13,987 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 84 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:13,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 115 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:12:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 18:12:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 18:12:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 63 states have (on average 2.1904761904761907) internal successors, (138), 130 states have internal predecessors, (138), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-10-11 18:12:14,029 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 2 [2024-10-11 18:12:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:14,030 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-10-11 18:12:14,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-10-11 18:12:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 18:12:14,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:14,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 18:12:14,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:12:14,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:14,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash 10957, now seen corresponding path program 1 times [2024-10-11 18:12:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:14,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109252597] [2024-10-11 18:12:14,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:14,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:14,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:14,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109252597] [2024-10-11 18:12:14,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109252597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:12:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57244467] [2024-10-11 18:12:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:14,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:14,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:14,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:14,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:14,161 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:14,349 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2024-10-11 18:12:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:14,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 18:12:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:14,351 INFO L225 Difference]: With dead ends: 131 [2024-10-11 18:12:14,352 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 18:12:14,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:14,353 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 25 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:14,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 176 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:12:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 18:12:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2024-10-11 18:12:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 63 states have (on average 2.126984126984127) internal successors, (134), 126 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2024-10-11 18:12:14,362 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 2 [2024-10-11 18:12:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:14,363 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2024-10-11 18:12:14,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2024-10-11 18:12:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:12:14,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:14,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:12:14,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:12:14,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:14,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1537122341, now seen corresponding path program 1 times [2024-10-11 18:12:14,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:14,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967950931] [2024-10-11 18:12:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967950931] [2024-10-11 18:12:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967950931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:14,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087542217] [2024-10-11 18:12:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:14,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:14,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:14,571 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:14,807 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2024-10-11 18:12:14,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:12:14,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 18:12:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:14,808 INFO L225 Difference]: With dead ends: 130 [2024-10-11 18:12:14,809 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:12:14,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:12:14,810 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 38 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:14,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 227 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:12:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:12:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2024-10-11 18:12:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 123 states have internal predecessors, (139), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 144 transitions. [2024-10-11 18:12:14,828 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 144 transitions. Word has length 6 [2024-10-11 18:12:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:14,828 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 144 transitions. [2024-10-11 18:12:14,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 144 transitions. [2024-10-11 18:12:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:12:14,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:14,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:12:14,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:12:14,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:14,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1537122342, now seen corresponding path program 1 times [2024-10-11 18:12:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:14,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635542067] [2024-10-11 18:12:14,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:15,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:15,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635542067] [2024-10-11 18:12:15,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635542067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:15,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:15,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:15,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656103183] [2024-10-11 18:12:15,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:15,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:15,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:15,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:15,131 INFO L87 Difference]: Start difference. First operand 125 states and 144 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:15,323 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2024-10-11 18:12:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:12:15,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 18:12:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:15,325 INFO L225 Difference]: With dead ends: 121 [2024-10-11 18:12:15,326 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 18:12:15,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:12:15,328 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:15,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 295 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:12:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 18:12:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 18:12:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 119 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2024-10-11 18:12:15,341 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 6 [2024-10-11 18:12:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:15,342 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2024-10-11 18:12:15,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2024-10-11 18:12:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:12:15,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:15,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:15,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:12:15,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:15,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash 769396375, now seen corresponding path program 1 times [2024-10-11 18:12:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274417707] [2024-10-11 18:12:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:15,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:15,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274417707] [2024-10-11 18:12:15,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274417707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:15,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:15,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:15,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411232381] [2024-10-11 18:12:15,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:15,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:15,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:15,506 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:15,698 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2024-10-11 18:12:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:15,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-11 18:12:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:15,700 INFO L225 Difference]: With dead ends: 125 [2024-10-11 18:12:15,700 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 18:12:15,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:12:15,701 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:15,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 221 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:12:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 18:12:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2024-10-11 18:12:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.8873239436619718) internal successors, (134), 118 states have internal predecessors, (134), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2024-10-11 18:12:15,714 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 10 [2024-10-11 18:12:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:15,715 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2024-10-11 18:12:15,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2024-10-11 18:12:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:12:15,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:15,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:15,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:12:15,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:15,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash 769396376, now seen corresponding path program 1 times [2024-10-11 18:12:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:15,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212164637] [2024-10-11 18:12:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:15,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:15,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212164637] [2024-10-11 18:12:15,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212164637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:15,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:15,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:15,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213236869] [2024-10-11 18:12:15,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:15,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:15,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:15,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:15,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:15,983 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:16,134 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2024-10-11 18:12:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:16,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-11 18:12:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:16,139 INFO L225 Difference]: With dead ends: 117 [2024-10-11 18:12:16,139 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 18:12:16,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:16,140 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:16,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 284 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 18:12:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 18:12:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 115 states have internal predecessors, (131), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2024-10-11 18:12:16,148 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 10 [2024-10-11 18:12:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:16,152 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2024-10-11 18:12:16,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2024-10-11 18:12:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:12:16,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:16,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:16,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:12:16,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:16,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:16,154 INFO L85 PathProgramCache]: Analyzing trace with hash 41858133, now seen corresponding path program 1 times [2024-10-11 18:12:16,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:16,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556475886] [2024-10-11 18:12:16,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:16,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556475886] [2024-10-11 18:12:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556475886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:16,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:16,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:12:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354912258] [2024-10-11 18:12:16,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:16,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:16,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:16,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:16,279 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:16,363 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2024-10-11 18:12:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:16,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-11 18:12:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:16,364 INFO L225 Difference]: With dead ends: 112 [2024-10-11 18:12:16,365 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 18:12:16,365 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-10-11 18:12:16,366 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:16,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 108 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 18:12:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 18:12:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 110 states have internal predecessors, (126), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2024-10-11 18:12:16,376 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 15 [2024-10-11 18:12:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:16,377 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2024-10-11 18:12:16,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2024-10-11 18:12:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:12:16,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:16,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:16,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:12:16,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:16,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash 41858132, now seen corresponding path program 1 times [2024-10-11 18:12:16,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:16,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081536599] [2024-10-11 18:12:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:16,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:16,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081536599] [2024-10-11 18:12:16,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081536599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:16,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:16,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:12:16,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42911264] [2024-10-11 18:12:16,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:16,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:16,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:16,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:16,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:16,473 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:16,582 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2024-10-11 18:12:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-11 18:12:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:16,583 INFO L225 Difference]: With dead ends: 107 [2024-10-11 18:12:16,583 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 18:12:16,583 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-10-11 18:12:16,584 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:16,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 108 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 18:12:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-11 18:12:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.704225352112676) internal successors, (121), 105 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2024-10-11 18:12:16,594 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 15 [2024-10-11 18:12:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:16,598 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2024-10-11 18:12:16,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2024-10-11 18:12:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:12:16,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:16,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:16,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:12:16,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:16,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1571038946, now seen corresponding path program 1 times [2024-10-11 18:12:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:16,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313211496] [2024-10-11 18:12:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:16,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:16,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:16,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313211496] [2024-10-11 18:12:16,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313211496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:16,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:16,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:12:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56855931] [2024-10-11 18:12:16,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:16,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:12:16,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:16,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:12:16,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:16,769 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-10-11 18:12:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:16,954 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2024-10-11 18:12:16,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:12:16,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-10-11 18:12:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:16,956 INFO L225 Difference]: With dead ends: 120 [2024-10-11 18:12:16,956 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 18:12:16,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:12:16,957 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 94 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:16,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 131 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:12:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 18:12:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2024-10-11 18:12:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 111 states have internal predecessors, (132), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2024-10-11 18:12:16,964 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 17 [2024-10-11 18:12:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:16,965 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2024-10-11 18:12:16,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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-10-11 18:12:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2024-10-11 18:12:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:12:16,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:16,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:16,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:12:16,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:16,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1571038947, now seen corresponding path program 1 times [2024-10-11 18:12:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:16,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574407474] [2024-10-11 18:12:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:16,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574407474] [2024-10-11 18:12:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574407474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:17,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:17,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:12:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968294838] [2024-10-11 18:12:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:17,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:12:17,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:12:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:12:17,270 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-10-11 18:12:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:17,494 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2024-10-11 18:12:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:12:17,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-10-11 18:12:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:17,499 INFO L225 Difference]: With dead ends: 157 [2024-10-11 18:12:17,499 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 18:12:17,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:12:17,500 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 231 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:17,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 129 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:12:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 18:12:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-10-11 18:12:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 110 states have (on average 1.6727272727272726) internal successors, (184), 144 states have internal predecessors, (184), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 189 transitions. [2024-10-11 18:12:17,508 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 189 transitions. Word has length 17 [2024-10-11 18:12:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:17,508 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 189 transitions. [2024-10-11 18:12:17,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-10-11 18:12:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 189 transitions. [2024-10-11 18:12:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:12:17,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:17,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:17,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:12:17,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:17,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1457568018, now seen corresponding path program 1 times [2024-10-11 18:12:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:17,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978130498] [2024-10-11 18:12:17,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:17,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978130498] [2024-10-11 18:12:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978130498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:17,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:17,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:12:17,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520706080] [2024-10-11 18:12:17,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:17,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:12:17,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:17,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:12:17,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:12:17,601 INFO L87 Difference]: Start difference. First operand 146 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:17,695 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2024-10-11 18:12:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:17,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 18:12:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:17,696 INFO L225 Difference]: With dead ends: 159 [2024-10-11 18:12:17,696 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 18:12:17,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:17,697 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 100 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:17,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 166 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 18:12:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2024-10-11 18:12:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 143 states have internal predecessors, (181), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2024-10-11 18:12:17,701 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 18 [2024-10-11 18:12:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:17,701 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2024-10-11 18:12:17,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2024-10-11 18:12:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:12:17,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:17,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:17,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:12:17,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:17,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash 566047051, now seen corresponding path program 1 times [2024-10-11 18:12:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:17,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951041222] [2024-10-11 18:12:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:17,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:18,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:18,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951041222] [2024-10-11 18:12:18,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951041222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:18,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:18,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 18:12:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780201804] [2024-10-11 18:12:18,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:18,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:12:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:12:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:12:18,377 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:18,875 INFO L93 Difference]: Finished difference Result 157 states and 196 transitions. [2024-10-11 18:12:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:12:18,876 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 18:12:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:18,876 INFO L225 Difference]: With dead ends: 157 [2024-10-11 18:12:18,876 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 18:12:18,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:12:18,877 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 115 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:18,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 352 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:12:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 18:12:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2024-10-11 18:12:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 117 states have (on average 1.5811965811965811) internal successors, (185), 149 states have internal predecessors, (185), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 188 transitions. [2024-10-11 18:12:18,882 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 188 transitions. Word has length 20 [2024-10-11 18:12:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:18,884 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 188 transitions. [2024-10-11 18:12:18,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 188 transitions. [2024-10-11 18:12:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:12:18,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:18,886 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-10-11 18:12:18,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:12:18,887 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:18,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1573212541, now seen corresponding path program 1 times [2024-10-11 18:12:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:18,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464802418] [2024-10-11 18:12:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464802418] [2024-10-11 18:12:18,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464802418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:18,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:18,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:12:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773698091] [2024-10-11 18:12:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:18,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:12:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:18,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:12:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:12:18,938 INFO L87 Difference]: Start difference. First operand 151 states and 188 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:18,980 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2024-10-11 18:12:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:12:18,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 18:12:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:18,982 INFO L225 Difference]: With dead ends: 150 [2024-10-11 18:12:18,982 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 18:12:18,982 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-10-11 18:12:18,983 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:18,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 126 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:12:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 18:12:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-11 18:12:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 148 states have internal predecessors, (184), 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-10-11 18:12:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2024-10-11 18:12:18,987 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 24 [2024-10-11 18:12:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:18,987 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2024-10-11 18:12:18,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2024-10-11 18:12:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:12:18,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:18,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:18,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:12:18,989 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:18,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:18,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2060682207, now seen corresponding path program 1 times [2024-10-11 18:12:18,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:18,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153507456] [2024-10-11 18:12:18,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:18,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:19,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:19,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153507456] [2024-10-11 18:12:19,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153507456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:19,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:12:19,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:12:19,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806875106] [2024-10-11 18:12:19,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:19,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:12:19,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:19,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:12:19,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:12:19,093 INFO L87 Difference]: Start difference. First operand 150 states and 186 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:19,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:19,208 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2024-10-11 18:12:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:12:19,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 18:12:19,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:19,210 INFO L225 Difference]: With dead ends: 161 [2024-10-11 18:12:19,210 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 18:12:19,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:12:19,211 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 89 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:19,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 181 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:12:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 18:12:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2024-10-11 18:12:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.5630252100840336) internal successors, (186), 150 states have internal predecessors, (186), 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-10-11 18:12:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2024-10-11 18:12:19,214 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 25 [2024-10-11 18:12:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:19,215 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2024-10-11 18:12:19,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2024-10-11 18:12:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:12:19,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:19,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:19,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:12:19,216 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:19,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1772464190, now seen corresponding path program 1 times [2024-10-11 18:12:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770780920] [2024-10-11 18:12:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:19,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:19,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770780920] [2024-10-11 18:12:19,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770780920] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:19,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965037832] [2024-10-11 18:12:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:19,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:19,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:19,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:19,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:12:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:20,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 18:12:20,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:20,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:12:20,222 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:12:20,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:12:20,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:12:20,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:20,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:20,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:12:20,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:20,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:12:20,475 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-11 18:12:20,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 44 [2024-10-11 18:12:20,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 18:12:20,582 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-11 18:12:20,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2024-10-11 18:12:20,646 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-11 18:12:20,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2024-10-11 18:12:20,665 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 16 treesize of output 12 [2024-10-11 18:12:20,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:12:20,736 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-11 18:12:20,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:12:20,796 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:12:20,796 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 26 treesize of output 23 [2024-10-11 18:12:20,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 18:12:20,929 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:12:20,930 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 41 treesize of output 38 [2024-10-11 18:12:20,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 18:12:21,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:21,477 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 89 treesize of output 89 [2024-10-11 18:12:21,896 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 25 treesize of output 13 [2024-10-11 18:12:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:21,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:22,167 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 22 treesize of output 20 [2024-10-11 18:12:22,471 INFO L349 Elim1Store]: treesize reduction 5, result has 80.8 percent of original size [2024-10-11 18:12:22,471 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 74 treesize of output 73 [2024-10-11 18:12:22,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:22,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2024-10-11 18:12:22,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:22,782 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 53 treesize of output 45 [2024-10-11 18:12:22,786 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:22,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:22,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 247 [2024-10-11 18:12:22,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:22,814 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 111 treesize of output 105 [2024-10-11 18:12:22,822 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 49 treesize of output 41 [2024-10-11 18:12:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965037832] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:23,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 35 [2024-10-11 18:12:23,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109017923] [2024-10-11 18:12:23,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:23,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 18:12:23,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 18:12:23,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1162, Unknown=13, NotChecked=0, Total=1332 [2024-10-11 18:12:23,074 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:29,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 18:12:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:30,101 INFO L93 Difference]: Finished difference Result 288 states and 341 transitions. [2024-10-11 18:12:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 18:12:30,102 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 18:12:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:30,103 INFO L225 Difference]: With dead ends: 288 [2024-10-11 18:12:30,104 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 18:12:30,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=529, Invalid=3233, Unknown=20, NotChecked=0, Total=3782 [2024-10-11 18:12:30,106 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 842 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 65 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:30,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 684 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1354 Invalid, 27 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 18:12:30,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 18:12:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 206. [2024-10-11 18:12:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 173 states have (on average 1.5375722543352601) internal successors, (266), 204 states have internal predecessors, (266), 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-10-11 18:12:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2024-10-11 18:12:30,111 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 27 [2024-10-11 18:12:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:30,111 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2024-10-11 18:12:30,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2024-10-11 18:12:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:12:30,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:30,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:12:30,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:12:30,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 18:12:30,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:30,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1772464191, now seen corresponding path program 1 times [2024-10-11 18:12:30,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:30,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679440043] [2024-10-11 18:12:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:31,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:31,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679440043] [2024-10-11 18:12:31,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679440043] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:31,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456851522] [2024-10-11 18:12:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:31,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:31,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:31,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:31,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:12:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:31,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 18:12:31,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:31,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:12:31,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:12:31,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 23 treesize of output 11 [2024-10-11 18:12:31,561 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:12:31,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:12:31,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:12:31,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-10-11 18:12:31,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 18:12:31,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:31,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:31,727 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:12:31,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:12:31,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:12:31,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:31,837 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 25 treesize of output 13 [2024-10-11 18:12:31,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:31,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:31,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:31,996 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:12:31,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:12:32,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:32,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:12:32,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:32,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 26 treesize of output 18 [2024-10-11 18:12:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:32,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:12:32,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456851522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:12:32,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:12:32,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [13] total 28 [2024-10-11 18:12:32,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009962035] [2024-10-11 18:12:32,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:12:32,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 18:12:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:32,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 18:12:32,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2024-10-11 18:12:32,274 INFO L87 Difference]: Start difference. First operand 206 states and 268 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:33,125 INFO L93 Difference]: Finished difference Result 328 states and 414 transitions. [2024-10-11 18:12:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:12:33,126 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-10-11 18:12:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:33,127 INFO L225 Difference]: With dead ends: 328 [2024-10-11 18:12:33,127 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 18:12:33,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=1395, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 18:12:33,128 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 337 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:33,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 449 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:12:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 18:12:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 241. [2024-10-11 18:12:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 208 states have (on average 1.4759615384615385) internal successors, (307), 239 states have internal predecessors, (307), 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-10-11 18:12:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 309 transitions. [2024-10-11 18:12:33,134 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 309 transitions. Word has length 27 [2024-10-11 18:12:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:33,134 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 309 transitions. [2024-10-11 18:12:33,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 309 transitions. [2024-10-11 18:12:33,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:12:33,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:33,136 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] [2024-10-11 18:12:33,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:12:33,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 18:12:33,337 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:33,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:33,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1816383173, now seen corresponding path program 1 times [2024-10-11 18:12:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:33,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464324716] [2024-10-11 18:12:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:33,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:33,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464324716] [2024-10-11 18:12:33,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464324716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:33,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228407223] [2024-10-11 18:12:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:33,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:33,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:12:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:34,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 18:12:34,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:34,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:12:34,126 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:34,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 11 treesize of output 11 [2024-10-11 18:12:34,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:12:34,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:34,189 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:12:34,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:12:34,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:34,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:12:34,318 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-11 18:12:34,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 44 [2024-10-11 18:12:34,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 18:12:34,419 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-11 18:12:34,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2024-10-11 18:12:34,486 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-11 18:12:34,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2024-10-11 18:12:34,568 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2024-10-11 18:12:34,568 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 31 treesize of output 32 [2024-10-11 18:12:34,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:34,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2024-10-11 18:12:34,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:12:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:34,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:35,049 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_88| Int) (v_ArrVal_1114 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1114) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_88|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_88| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_88|))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_88| Int) (v_ArrVal_1114 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1114) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_88|)) 1) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_88| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_88|)))) is different from false [2024-10-11 18:12:35,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:35,184 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 61 treesize of output 65 [2024-10-11 18:12:35,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_88| Int) (v_ArrVal_1114 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (or (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (not (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_3) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_2) (< v_prenex_2 0))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1114) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_88|) |c_ULTIMATE.start_main_~bcki~0#1.base|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_3 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_3) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_2) (< v_prenex_2 0))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_88| Int) (v_ArrVal_1114 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_88| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_88|) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1114) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_88|) |c_ULTIMATE.start_main_~bcki~0#1.base|))))) is different from false [2024-10-11 18:12:35,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:35,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 137 [2024-10-11 18:12:35,453 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-11 18:12:35,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 26 [2024-10-11 18:12:35,503 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:12:35,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 6 [2024-10-11 18:12:35,583 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_7 Int) (v_prenex_2 Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_88| Int) (v_ArrVal_1114 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_prenex_3 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_3)) (.cse1 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_2) (not (= (select (select (store .cse0 .cse1 v_prenex_3) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select (select (store .cse0 .cse1 v_ArrVal_1114) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_88|) |c_ULTIMATE.start_main_~bcki~0#1.base|) (< v_prenex_2 0) (not (= (select |c_#valid| .cse1) 0)) (not (= (select (store (store v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset| v_DerPreprocessor_5) v_prenex_7 .cse1) |ULTIMATE.start_main_~bcki~0#1.offset|) v_DerPreprocessor_5))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_DerPreprocessor_7 Int) (v_prenex_6 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_5 v_prenex_4))) (or (not (= (select |c_#valid| .cse2) 0)) (not (= (select (store (store v_arrayElimArr_5 v_prenex_4 v_DerPreprocessor_7) v_prenex_7 .cse2) v_prenex_4) v_DerPreprocessor_7)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_5) .cse2 v_prenex_6) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) |c_ULTIMATE.start_main_~bcki~0#1.base|) (< v_prenex_5 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_5)))) (forall ((v_prenex_7 Int) (v_arrayElimArr_4 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_4 v_prenex_7))) (or (forall ((v_prenex_9 (Array Int Int)) (v_prenex_8 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_4) .cse3 v_prenex_9) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_8) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| v_prenex_8) (< v_prenex_8 0))) (not (= (select |c_#valid| .cse3) 0)))))) is different from false [2024-10-11 18:12:35,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:35,897 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 168 treesize of output 145 [2024-10-11 18:12:35,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:35,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 535 treesize of output 583 [2024-10-11 18:12:35,986 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 292 treesize of output 288 [2024-10-11 18:12:36,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:36,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 289 treesize of output 298 [2024-10-11 18:12:36,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:36,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 275 treesize of output 323 [2024-10-11 18:12:36,119 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 258 treesize of output 254 [2024-10-11 18:12:36,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:36,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 287 treesize of output 283 [2024-10-11 18:12:36,185 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 248 treesize of output 244 [2024-10-11 18:12:36,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:36,214 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 276 treesize of output 266 [2024-10-11 18:12:36,242 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 228 treesize of output 224 [2024-10-11 18:12:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228407223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:46,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:46,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 28 [2024-10-11 18:12:46,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725006279] [2024-10-11 18:12:46,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:46,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 18:12:46,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 18:12:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=609, Unknown=4, NotChecked=156, Total=870 [2024-10-11 18:12:46,008 INFO L87 Difference]: Start difference. First operand 241 states and 309 transitions. Second operand has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:48,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:12:48,825 INFO L93 Difference]: Finished difference Result 254 states and 320 transitions. [2024-10-11 18:12:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:12:48,826 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:12:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:12:48,827 INFO L225 Difference]: With dead ends: 254 [2024-10-11 18:12:48,827 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 18:12:48,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=244, Invalid=1246, Unknown=4, NotChecked=228, Total=1722 [2024-10-11 18:12:48,828 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 145 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:12:48,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 706 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1139 Invalid, 0 Unknown, 381 Unchecked, 1.8s Time] [2024-10-11 18:12:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 18:12:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2024-10-11 18:12:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 217 states have (on average 1.4654377880184333) internal successors, (318), 248 states have internal predecessors, (318), 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-10-11 18:12:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 320 transitions. [2024-10-11 18:12:48,833 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 320 transitions. Word has length 28 [2024-10-11 18:12:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:12:48,833 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 320 transitions. [2024-10-11 18:12:48,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:12:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 320 transitions. [2024-10-11 18:12:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:12:48,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:12:48,834 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] [2024-10-11 18:12:48,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:12:49,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:49,035 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:12:49,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:12:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1816383174, now seen corresponding path program 1 times [2024-10-11 18:12:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:12:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708256319] [2024-10-11 18:12:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:12:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:12:49,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708256319] [2024-10-11 18:12:49,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708256319] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:12:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367688227] [2024-10-11 18:12:49,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:12:49,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:12:49,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:12:49,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:12:49,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:12:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:12:49,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 18:12:49,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:12:49,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:12:49,997 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:12:49,998 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-10-11 18:12:50,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:12:50,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:12:50,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:12:50,146 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:12:50,146 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 42 treesize of output 31 [2024-10-11 18:12:50,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:12:50,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:50,174 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:12:50,174 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-10-11 18:12:50,189 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:12:50,189 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 42 treesize of output 31 [2024-10-11 18:12:50,204 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 18:12:50,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 18:12:50,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 18:12:50,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:12:50,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:12:50,358 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-10-11 18:12:50,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2024-10-11 18:12:50,385 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:12:50,386 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-10-11 18:12:50,439 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:12:50,440 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-10-11 18:12:50,469 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-10-11 18:12:50,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2024-10-11 18:12:50,530 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-11 18:12:50,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 69 [2024-10-11 18:12:50,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2024-10-11 18:12:50,669 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-11 18:12:50,669 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 27 treesize of output 17 [2024-10-11 18:12:50,699 INFO L349 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2024-10-11 18:12:50,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 50 [2024-10-11 18:12:50,911 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-11 18:12:50,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 27 [2024-10-11 18:12:50,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:12:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:50,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:12:51,171 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_93| Int) (v_ArrVal_1269 (Array Int Int))) (or (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_93|))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_93|) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_93| 0))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_93| Int) (v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (or (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_93|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1270) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_93|))) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_93|) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_93| 0)))) is different from false [2024-10-11 18:12:51,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:51,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2024-10-11 18:12:51,466 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 26 treesize of output 22 [2024-10-11 18:12:52,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:52,746 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 23 treesize of output 24 [2024-10-11 18:12:52,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:52,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:52,755 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 34 treesize of output 34 [2024-10-11 18:12:52,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-11 18:12:52,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:52,787 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 52 treesize of output 53 [2024-10-11 18:12:52,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:52,797 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 44 treesize of output 45 [2024-10-11 18:12:52,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:52,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:52,811 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 72 treesize of output 72 [2024-10-11 18:12:52,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:12:52,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:52,827 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 102 treesize of output 98 [2024-10-11 18:12:52,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:12:52,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-10-11 18:12:52,846 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 16 treesize of output 14 [2024-10-11 18:12:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:12:56,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367688227] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:12:56,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:12:56,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 29 [2024-10-11 18:12:56,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130718048] [2024-10-11 18:12:56,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:12:56,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 18:12:56,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:12:56,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 18:12:56,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=724, Unknown=16, NotChecked=56, Total=930 [2024-10-11 18:12:56,984 INFO L87 Difference]: Start difference. First operand 250 states and 320 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:01,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:13:05,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:13:09,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:13:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:13:17,080 INFO L93 Difference]: Finished difference Result 280 states and 355 transitions. [2024-10-11 18:13:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 18:13:17,080 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:13:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:13:17,081 INFO L225 Difference]: With dead ends: 280 [2024-10-11 18:13:17,081 INFO L226 Difference]: Without dead ends: 280 [2024-10-11 18:13:17,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=295, Invalid=1579, Unknown=22, NotChecked=84, Total=1980 [2024-10-11 18:13:17,083 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 176 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 40 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:13:17,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 779 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1234 Invalid, 10 Unknown, 139 Unchecked, 13.5s Time] [2024-10-11 18:13:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-11 18:13:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 265. [2024-10-11 18:13:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 235 states have (on average 1.4638297872340424) internal successors, (344), 263 states have internal predecessors, (344), 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-10-11 18:13:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 346 transitions. [2024-10-11 18:13:17,088 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 346 transitions. Word has length 28 [2024-10-11 18:13:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:13:17,088 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 346 transitions. [2024-10-11 18:13:17,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:13:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 346 transitions. [2024-10-11 18:13:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:13:17,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:13:17,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:13:17,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:13:17,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:13:17,290 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2024-10-11 18:13:17,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:13:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2022720760, now seen corresponding path program 1 times [2024-10-11 18:13:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:13:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596688840] [2024-10-11 18:13:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:17,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:13:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:18,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:13:18,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596688840] [2024-10-11 18:13:18,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596688840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:13:18,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119316115] [2024-10-11 18:13:18,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:13:18,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:13:18,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:13:18,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:13:18,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:13:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:13:18,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-11 18:13:18,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:13:18,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:13:18,503 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:13:18,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:13:18,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:13:18,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:13:18,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:13:18,676 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:18,676 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-10-11 18:13:18,697 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:13:18,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:13:18,763 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:18,764 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-10-11 18:13:18,778 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:13:18,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-11 18:13:18,791 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:13:18,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-11 18:13:18,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:13:18,814 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:13:18,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:13:18,907 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-11 18:13:18,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2024-10-11 18:13:18,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:13:18,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:13:19,041 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-10-11 18:13:19,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 55 [2024-10-11 18:13:19,072 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:19,073 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-10-11 18:13:19,137 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-10-11 18:13:19,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 55 [2024-10-11 18:13:19,169 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:19,170 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-10-11 18:13:19,237 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-11 18:13:19,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 76 [2024-10-11 18:13:19,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2024-10-11 18:13:19,346 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:13:19,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-11 18:13:19,378 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:13:19,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 18:13:19,451 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:19,452 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-10-11 18:13:19,482 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-11 18:13:19,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-10-11 18:13:19,486 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 36 treesize of output 26 [2024-10-11 18:13:19,682 INFO L349 Elim1Store]: treesize reduction 44, result has 50.0 percent of original size [2024-10-11 18:13:19,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 99 [2024-10-11 18:13:19,703 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:13:19,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-10-11 18:13:19,996 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 36 treesize of output 26 [2024-10-11 18:13:20,018 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-10-11 18:13:20,058 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 60 treesize of output 50 [2024-10-11 18:13:22,921 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-11 18:13:22,922 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 155 [2024-10-11 18:13:22,927 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 128 treesize of output 116 [2024-10-11 18:13:22,972 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 15 treesize of output 11 [2024-10-11 18:13:22,987 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 15 treesize of output 11 [2024-10-11 18:13:23,002 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 15 treesize of output 11 [2024-10-11 18:13:23,010 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 64 treesize of output 50 [2024-10-11 18:13:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:13:23,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:13:23,642 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1442 Int)) (or (< 8 v_ArrVal_1442) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_98| Int)) (let ((.cse0 (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1442))) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_98|) (< (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_98| 12)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_98| 0) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1445) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_98|) 11) (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1446) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_98|)))))))))) (forall ((v_ArrVal_1442 Int)) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_51|) 0)) (forall ((v_ArrVal_1445 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_98| Int)) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_98|) (< (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1442) |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_98| 12)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_98| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_51| v_ArrVal_1445) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_98|) 9)))))) (< 8 v_ArrVal_1442)))) is different from false [2024-10-11 18:13:24,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:24,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 137 [2024-10-11 18:13:29,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:13:29,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 117 [2024-10-11 18:13:29,723 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 44 treesize of output 38