./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/prefixsum_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:44:49,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:44:50,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:44:50,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:44:50,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:44:50,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:44:50,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:44:50,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:44:50,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:44:50,041 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:44:50,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:44:50,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:44:50,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:44:50,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:44:50,042 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:44:50,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:44:50,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:44:50,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:44:50,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:44:50,044 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2025-03-08 22:44:50,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:44:50,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:44:50,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:44:50,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:44:50,248 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:44:50,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-08 22:44:51,419 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f5828c0/2ea74fd6d50d48ba91b72b16f701ecca/FLAG5ebafd457 [2025-03-08 22:44:51,682 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:44:51,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-08 22:44:51,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f5828c0/2ea74fd6d50d48ba91b72b16f701ecca/FLAG5ebafd457 [2025-03-08 22:44:51,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f5828c0/2ea74fd6d50d48ba91b72b16f701ecca [2025-03-08 22:44:51,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:44:51,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:44:51,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:44:51,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:44:51,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:44:51,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d3d26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51, skipping insertion in model container [2025-03-08 22:44:51,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:44:51,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:44:51,857 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:44:51,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:44:51,883 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:44:51,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51 WrapperNode [2025-03-08 22:44:51,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:44:51,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:44:51,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:44:51,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:44:51,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,907 INFO L138 Inliner]: procedures = 22, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2025-03-08 22:44:51,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:44:51,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:44:51,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:44:51,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:44:51,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,926 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-03-08 22:44:51,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:44:51,941 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:44:51,942 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:44:51,942 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:44:51,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (1/1) ... [2025-03-08 22:44:51,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:44:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:44:51,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:44:51,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:44:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:44:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 22:44:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 22:44:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:44:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:44:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2025-03-08 22:44:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2025-03-08 22:44:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:44:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:44:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:44:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2025-03-08 22:44:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2025-03-08 22:44:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:44:51,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:44:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:44:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:44:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 22:44:51,989 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 22:44:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:44:52,055 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:44:52,057 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:44:52,366 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-08 22:44:52,370 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:44:52,378 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:44:52,379 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:44:52,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:44:52 BoogieIcfgContainer [2025-03-08 22:44:52,379 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:44:52,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:44:52,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:44:52,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:44:52,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:44:51" (1/3) ... [2025-03-08 22:44:52,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58711c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:44:52, skipping insertion in model container [2025-03-08 22:44:52,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:44:51" (2/3) ... [2025-03-08 22:44:52,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58711c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:44:52, skipping insertion in model container [2025-03-08 22:44:52,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:44:52" (3/3) ... [2025-03-08 22:44:52,386 INFO L128 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2025-03-08 22:44:52,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:44:52,397 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prefixsum_rec.c that has 5 procedures, 105 locations, 1 initial locations, 3 loop locations, and 34 error locations. [2025-03-08 22:44:52,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:44:52,435 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;@2e28ffe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:44:52,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-08 22:44:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 90 states have internal predecessors, (97), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:44:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:44:52,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:52,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:52,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:44:52,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:52,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2126653616, now seen corresponding path program 1 times [2025-03-08 22:44:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608195178] [2025-03-08 22:44:52,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:52,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:44:52,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:44:52,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:52,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:44:52,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608195178] [2025-03-08 22:44:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608195178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069898438] [2025-03-08 22:44:52,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:52,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:52,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:44:52,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:44:52,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:44:52,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:44:52,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:44:52,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:52,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:52,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 22:44:52,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:44:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:44:52,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:44:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069898438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:44:52,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:44:52,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 22:44:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613726200] [2025-03-08 22:44:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:44:52,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:44:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:52,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:44:52,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:44:52,709 INFO L87 Difference]: Start difference. First operand has 105 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 90 states have internal predecessors, (97), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:44:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:52,726 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2025-03-08 22:44:52,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:44:52,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-08 22:44:52,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:52,732 INFO L225 Difference]: With dead ends: 104 [2025-03-08 22:44:52,733 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 22:44:52,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:44:52,738 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:52,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:44:52,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 22:44:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-08 22:44:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 87 states have internal predecessors, (92), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:44:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2025-03-08 22:44:52,766 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 28 [2025-03-08 22:44:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:52,767 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2025-03-08 22:44:52,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:44:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2025-03-08 22:44:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:44:52,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:52,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:52,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:44:52,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 22:44:52,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:44:52,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1549112686, now seen corresponding path program 1 times [2025-03-08 22:44:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442773934] [2025-03-08 22:44:52,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:52,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:44:52,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:44:52,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:52,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:44:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:53,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442773934] [2025-03-08 22:44:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442773934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:44:53,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:44:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:44:53,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216845287] [2025-03-08 22:44:53,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:44:53,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:44:53,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:53,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:44:53,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:44:53,225 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:44:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:53,339 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-03-08 22:44:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:44:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-08 22:44:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:53,340 INFO L225 Difference]: With dead ends: 99 [2025-03-08 22:44:53,340 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 22:44:53,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:44:53,341 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 26 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:53,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 204 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:44:53,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 22:44:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 22:44:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 84 states have internal predecessors, (89), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:44:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-03-08 22:44:53,353 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 28 [2025-03-08 22:44:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:53,354 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-03-08 22:44:53,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:44:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-03-08 22:44:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:44:53,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:53,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:53,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:44:53,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:44:53,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:53,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1549112687, now seen corresponding path program 1 times [2025-03-08 22:44:53,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:53,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973035749] [2025-03-08 22:44:53,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:53,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:53,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:44:53,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:44:53,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:53,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:44:53,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973035749] [2025-03-08 22:44:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973035749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:44:53,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:44:53,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:44:53,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631532765] [2025-03-08 22:44:53,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:44:53,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:44:53,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:53,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:44:53,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:44:53,760 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:44:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:54,105 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2025-03-08 22:44:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:44:54,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2025-03-08 22:44:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:54,107 INFO L225 Difference]: With dead ends: 123 [2025-03-08 22:44:54,107 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 22:44:54,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:44:54,108 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 63 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:54,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 546 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:44:54,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 22:44:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2025-03-08 22:44:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 91 states have internal predecessors, (98), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 22:44:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2025-03-08 22:44:54,117 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 28 [2025-03-08 22:44:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:54,117 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2025-03-08 22:44:54,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:44:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2025-03-08 22:44:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:44:54,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:54,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:54,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:44:54,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:44:54,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:54,118 INFO L85 PathProgramCache]: Analyzing trace with hash 777853064, now seen corresponding path program 1 times [2025-03-08 22:44:54,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:54,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669009417] [2025-03-08 22:44:54,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:54,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:54,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:44:54,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:44:54,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:54,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:44:54,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:54,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669009417] [2025-03-08 22:44:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669009417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:44:54,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:44:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:44:54,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134737025] [2025-03-08 22:44:54,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:44:54,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:44:54,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:54,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:44:54,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:44:54,173 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:44:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:54,239 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2025-03-08 22:44:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:44:54,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2025-03-08 22:44:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:54,241 INFO L225 Difference]: With dead ends: 108 [2025-03-08 22:44:54,242 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 22:44:54,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:44:54,243 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 26 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:54,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 211 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:44:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 22:44:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 22:44:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 90 states have internal predecessors, (97), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 22:44:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2025-03-08 22:44:54,250 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 29 [2025-03-08 22:44:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:54,250 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2025-03-08 22:44:54,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:44:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2025-03-08 22:44:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:44:54,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:54,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:54,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:44:54,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:44:54,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash 777853065, now seen corresponding path program 1 times [2025-03-08 22:44:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486778926] [2025-03-08 22:44:54,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:54,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:54,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:44:54,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:44:54,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:44:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486778926] [2025-03-08 22:44:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486778926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:44:54,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:44:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:44:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542229193] [2025-03-08 22:44:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:44:54,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:44:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:54,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:44:54,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:44:54,497 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:44:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:54,695 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2025-03-08 22:44:54,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:44:54,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-03-08 22:44:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:54,696 INFO L225 Difference]: With dead ends: 112 [2025-03-08 22:44:54,696 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 22:44:54,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:44:54,697 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:54,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 395 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:44:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 22:44:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-08 22:44:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.59375) internal successors, (102), 93 states have internal predecessors, (102), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 22:44:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2025-03-08 22:44:54,701 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 29 [2025-03-08 22:44:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:54,701 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2025-03-08 22:44:54,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:44:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2025-03-08 22:44:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:44:54,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:54,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:54,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:44:54,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:44:54,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1806546206, now seen corresponding path program 1 times [2025-03-08 22:44:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:54,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329897696] [2025-03-08 22:44:54,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:54,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:44:54,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:44:54,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:54,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:44:55,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329897696] [2025-03-08 22:44:55,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329897696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097622560] [2025-03-08 22:44:55,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:55,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:55,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:44:55,126 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:44:55,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:44:55,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:44:55,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:44:55,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:55,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:55,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 22:44:55,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:44:55,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:44:55,275 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 7 [2025-03-08 22:44:55,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:44:55,500 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 43 treesize of output 32 [2025-03-08 22:44:55,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:44:55,509 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 [2025-03-08 22:44:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:44:55,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:44:55,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097622560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:55,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:44:55,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-08 22:44:55,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124067136] [2025-03-08 22:44:55,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:44:55,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:44:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:55,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:44:55,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:44:55,886 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:44:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:56,614 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2025-03-08 22:44:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:44:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 29 [2025-03-08 22:44:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:56,615 INFO L225 Difference]: With dead ends: 111 [2025-03-08 22:44:56,616 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 22:44:56,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2025-03-08 22:44:56,617 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 182 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:56,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 423 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:44:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 22:44:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2025-03-08 22:44:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 85 states have internal predecessors, (90), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:44:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-03-08 22:44:56,621 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2025-03-08 22:44:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:56,623 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-03-08 22:44:56,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:44:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-03-08 22:44:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 22:44:56,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:56,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:56,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:44:56,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 22:44:56,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:44:56,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:56,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1672120555, now seen corresponding path program 1 times [2025-03-08 22:44:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:56,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464739465] [2025-03-08 22:44:56,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:56,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:44:56,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:44:56,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:56,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:44:56,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464739465] [2025-03-08 22:44:56,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464739465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268805339] [2025-03-08 22:44:56,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:56,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:56,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:44:56,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:44:56,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:44:57,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:44:57,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:44:57,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:57,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:57,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 22:44:57,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:44:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 22:44:57,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:44:57,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268805339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:44:57,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:44:57,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 15 [2025-03-08 22:44:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701546515] [2025-03-08 22:44:57,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:44:57,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:44:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:57,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:44:57,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:44:57,136 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:44:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:57,196 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-03-08 22:44:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:44:57,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2025-03-08 22:44:57,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:57,197 INFO L225 Difference]: With dead ends: 103 [2025-03-08 22:44:57,197 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 22:44:57,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:44:57,197 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 15 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:57,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 618 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:44:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 22:44:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 22:44:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 86 states have internal predecessors, (91), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:44:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-03-08 22:44:57,207 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2025-03-08 22:44:57,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:57,207 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-03-08 22:44:57,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:44:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-03-08 22:44:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:44:57,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:57,208 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:57,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:44:57,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:57,408 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:44:57,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash -981649126, now seen corresponding path program 1 times [2025-03-08 22:44:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:57,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654392379] [2025-03-08 22:44:57,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:57,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:57,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:44:57,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:44:57,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:57,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:44:57,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:57,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654392379] [2025-03-08 22:44:57,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654392379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:57,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954219515] [2025-03-08 22:44:57,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:57,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:57,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:44:57,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:44:57,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:44:57,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:44:57,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:44:57,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:57,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:57,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 22:44:57,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:44:57,802 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 [2025-03-08 22:44:57,812 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 [2025-03-08 22:44:57,897 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:44:57,897 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 [2025-03-08 22:44:57,904 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 16 treesize of output 11 [2025-03-08 22:44:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:44:58,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:44:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954219515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:58,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:44:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2025-03-08 22:44:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118987624] [2025-03-08 22:44:58,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:44:58,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:44:58,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:58,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:44:58,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:44:58,266 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:44:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:44:58,763 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2025-03-08 22:44:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:44:58,763 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 33 [2025-03-08 22:44:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:44:58,764 INFO L225 Difference]: With dead ends: 106 [2025-03-08 22:44:58,764 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 22:44:58,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 22:44:58,764 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 149 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:44:58,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 452 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:44:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 22:44:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-03-08 22:44:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.540983606557377) internal successors, (94), 89 states have internal predecessors, (94), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:44:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2025-03-08 22:44:58,773 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 33 [2025-03-08 22:44:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:44:58,773 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2025-03-08 22:44:58,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:44:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2025-03-08 22:44:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 22:44:58,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:44:58,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:44:58,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:44:58,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:58,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:44:58,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:44:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash -366351810, now seen corresponding path program 1 times [2025-03-08 22:44:58,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:44:58,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761683160] [2025-03-08 22:44:58,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:58,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:44:58,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:44:58,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:44:58,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:58,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:44:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:44:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761683160] [2025-03-08 22:44:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761683160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338344809] [2025-03-08 22:44:59,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:44:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:44:59,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:44:59,178 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:44:59,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:44:59,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:44:59,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:44:59,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:44:59,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:44:59,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 22:44:59,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:44:59,237 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 10 treesize of output 9 [2025-03-08 22:44:59,336 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-08 22:44:59,336 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 1 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 22:44:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:44:59,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:44:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338344809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:44:59,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:44:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-08 22:44:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369354727] [2025-03-08 22:44:59,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:44:59,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:44:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:44:59,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:44:59,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:44:59,832 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 22:45:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:00,349 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2025-03-08 22:45:00,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:45:00,350 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2025-03-08 22:45:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:00,353 INFO L225 Difference]: With dead ends: 103 [2025-03-08 22:45:00,354 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 22:45:00,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:45:00,354 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 96 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:00,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 570 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:45:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 22:45:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 22:45:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 88 states have internal predecessors, (93), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:45:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2025-03-08 22:45:00,358 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 34 [2025-03-08 22:45:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:00,358 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2025-03-08 22:45:00,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 22:45:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2025-03-08 22:45:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 22:45:00,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:00,359 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:00,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:45:00,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:00,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:00,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash -474849514, now seen corresponding path program 2 times [2025-03-08 22:45:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:00,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802203745] [2025-03-08 22:45:00,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:45:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:00,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 22:45:00,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:45:00,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:45:00,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:45:01,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802203745] [2025-03-08 22:45:01,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802203745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616453895] [2025-03-08 22:45:01,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:45:01,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:01,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:01,005 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:01,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:45:01,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 22:45:01,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:45:01,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:45:01,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:01,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 22:45:01,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:01,114 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 10 treesize of output 9 [2025-03-08 22:45:01,685 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:45:01,685 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 1 case distinctions, treesize of input 18 treesize of output 20 [2025-03-08 22:45:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:45:02,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616453895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:02,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:45:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2025-03-08 22:45:02,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689253620] [2025-03-08 22:45:02,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:02,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:45:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:02,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:45:02,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=642, Unknown=1, NotChecked=0, Total=756 [2025-03-08 22:45:02,222 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:03,055 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2025-03-08 22:45:03,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:45:03,055 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2025-03-08 22:45:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:03,056 INFO L225 Difference]: With dead ends: 109 [2025-03-08 22:45:03,056 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 22:45:03,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=249, Invalid=1310, Unknown=1, NotChecked=0, Total=1560 [2025-03-08 22:45:03,057 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:03,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 903 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:45:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 22:45:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2025-03-08 22:45:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 92 states have internal predecessors, (98), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:45:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2025-03-08 22:45:03,064 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 37 [2025-03-08 22:45:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:03,064 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2025-03-08 22:45:03,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2025-03-08 22:45:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 22:45:03,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:03,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:03,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:45:03,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:03,270 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting upsweepErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:03,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1382261362, now seen corresponding path program 1 times [2025-03-08 22:45:03,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:03,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883777130] [2025-03-08 22:45:03,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:03,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:45:03,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:45:03,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:03,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:45:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883777130] [2025-03-08 22:45:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883777130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:45:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567623275] [2025-03-08 22:45:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:45:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:03,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:45:03,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:45:03,316 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 22:45:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:03,395 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2025-03-08 22:45:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:45:03,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-03-08 22:45:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:03,396 INFO L225 Difference]: With dead ends: 104 [2025-03-08 22:45:03,397 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 22:45:03,397 INFO L434 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 [2025-03-08 22:45:03,397 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:03,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 236 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:45:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 22:45:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-08 22:45:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 89 states have internal predecessors, (95), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:45:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2025-03-08 22:45:03,402 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 40 [2025-03-08 22:45:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:03,402 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2025-03-08 22:45:03,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 22:45:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2025-03-08 22:45:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 22:45:03,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:03,403 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:03,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:45:03,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:03,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1382261363, now seen corresponding path program 1 times [2025-03-08 22:45:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:03,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505731106] [2025-03-08 22:45:03,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:03,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:45:03,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:45:03,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:03,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505731106] [2025-03-08 22:45:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505731106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344991207] [2025-03-08 22:45:03,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:03,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:03,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:03,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:03,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:45:03,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:45:03,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:45:03,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:03,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:03,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 22:45:03,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:03,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:04,210 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 71 treesize of output 65 [2025-03-08 22:45:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:04,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344991207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:45:04,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:45:04,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-08 22:45:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470775444] [2025-03-08 22:45:04,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:04,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 22:45:04,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:04,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 22:45:04,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 22:45:04,437 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 32 states have internal predecessors, (56), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:05,038 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2025-03-08 22:45:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:45:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 32 states have internal predecessors, (56), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 40 [2025-03-08 22:45:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:05,039 INFO L225 Difference]: With dead ends: 141 [2025-03-08 22:45:05,039 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 22:45:05,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=2001, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 22:45:05,039 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 131 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:05,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1031 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:45:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 22:45:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2025-03-08 22:45:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 108 states have internal predecessors, (122), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 22:45:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2025-03-08 22:45:05,043 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 40 [2025-03-08 22:45:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:05,043 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2025-03-08 22:45:05,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 32 states have internal predecessors, (56), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2025-03-08 22:45:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 22:45:05,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:05,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:05,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 22:45:05,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:05,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting upsweepErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:05,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash -99570735, now seen corresponding path program 1 times [2025-03-08 22:45:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:05,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246648956] [2025-03-08 22:45:05,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:05,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:05,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:45:05,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:45:05,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:05,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:05,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246648956] [2025-03-08 22:45:05,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246648956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:05,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509740057] [2025-03-08 22:45:05,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:05,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:05,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:05,411 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:05,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:45:05,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:45:05,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:45:05,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:05,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:05,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 22:45:05,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:05,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:05,721 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 28 treesize of output 24 [2025-03-08 22:45:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:05,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509740057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:45:05,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:45:05,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-08 22:45:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946261679] [2025-03-08 22:45:05,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:05,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 22:45:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:05,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 22:45:05,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:45:05,795 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:06,151 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2025-03-08 22:45:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:45:06,151 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 41 [2025-03-08 22:45:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:06,152 INFO L225 Difference]: With dead ends: 140 [2025-03-08 22:45:06,152 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 22:45:06,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 22:45:06,152 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 71 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:06,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1087 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:45:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 22:45:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2025-03-08 22:45:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 104 states have internal predecessors, (114), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 22:45:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2025-03-08 22:45:06,156 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 41 [2025-03-08 22:45:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:06,156 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2025-03-08 22:45:06,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2025-03-08 22:45:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 22:45:06,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:06,158 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:06,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:45:06,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 22:45:06,359 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:06,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:06,359 INFO L85 PathProgramCache]: Analyzing trace with hash -156489966, now seen corresponding path program 3 times [2025-03-08 22:45:06,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:06,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749396100] [2025-03-08 22:45:06,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:45:06,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:06,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-08 22:45:06,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 41 statements. [2025-03-08 22:45:06,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:45:06,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 22:45:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749396100] [2025-03-08 22:45:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749396100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793745823] [2025-03-08 22:45:06,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:45:06,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:06,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:06,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:06,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:45:06,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-08 22:45:06,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 41 statements. [2025-03-08 22:45:06,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:45:06,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:06,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 22:45:06,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:06,720 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 [2025-03-08 22:45:06,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 6 treesize of output 5 [2025-03-08 22:45:06,808 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:45:06,808 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 [2025-03-08 22:45:06,816 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 16 treesize of output 11 [2025-03-08 22:45:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:45:07,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:07,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793745823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:07,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:45:07,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2025-03-08 22:45:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550827965] [2025-03-08 22:45:07,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:07,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:45:07,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:07,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:45:07,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2025-03-08 22:45:07,504 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:08,266 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2025-03-08 22:45:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:45:08,266 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 41 [2025-03-08 22:45:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:08,267 INFO L225 Difference]: With dead ends: 124 [2025-03-08 22:45:08,267 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 22:45:08,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 22:45:08,268 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 161 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:08,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 342 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:45:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 22:45:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2025-03-08 22:45:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 98 states have internal predecessors, (107), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 22:45:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2025-03-08 22:45:08,272 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 41 [2025-03-08 22:45:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:08,272 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2025-03-08 22:45:08,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2025-03-08 22:45:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 22:45:08,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:08,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:08,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 22:45:08,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 22:45:08,473 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:08,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1196726076, now seen corresponding path program 1 times [2025-03-08 22:45:08,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:08,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730938619] [2025-03-08 22:45:08,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:08,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:45:08,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:45:08,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:08,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:08,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730938619] [2025-03-08 22:45:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730938619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90730295] [2025-03-08 22:45:08,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:08,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:08,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:08,565 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:08,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:45:08,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 22:45:08,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 22:45:08,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:08,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:08,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:45:08,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:08,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:08,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90730295] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:45:08,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:45:08,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2025-03-08 22:45:08,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138494489] [2025-03-08 22:45:08,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:08,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:45:08,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:08,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:45:08,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:45:08,755 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 22:45:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:08,826 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2025-03-08 22:45:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:45:08,829 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-03-08 22:45:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:08,830 INFO L225 Difference]: With dead ends: 140 [2025-03-08 22:45:08,830 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 22:45:08,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:45:08,830 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:08,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 685 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:45:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 22:45:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2025-03-08 22:45:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 110 states have internal predecessors, (119), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 22:45:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2025-03-08 22:45:08,837 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 43 [2025-03-08 22:45:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:08,838 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2025-03-08 22:45:08,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 22:45:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2025-03-08 22:45:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 22:45:08,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:08,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:08,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:45:09,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 22:45:09,039 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:09,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:09,040 INFO L85 PathProgramCache]: Analyzing trace with hash -141147200, now seen corresponding path program 2 times [2025-03-08 22:45:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:09,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647159618] [2025-03-08 22:45:09,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:45:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:09,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 22:45:09,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:45:09,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:45:09,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 22:45:09,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:09,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647159618] [2025-03-08 22:45:09,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647159618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:09,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087333331] [2025-03-08 22:45:09,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:45:09,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:09,136 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:09,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:45:09,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 22:45:09,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 22:45:09,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:45:09,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:09,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:45:09,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 22:45:09,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:45:09,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087333331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:45:09,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:45:09,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 24 [2025-03-08 22:45:09,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469945819] [2025-03-08 22:45:09,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:09,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 22:45:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:09,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 22:45:09,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:45:09,462 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 22:45:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:09,661 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2025-03-08 22:45:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:45:09,662 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2025-03-08 22:45:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:09,663 INFO L225 Difference]: With dead ends: 149 [2025-03-08 22:45:09,663 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 22:45:09,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:45:09,663 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 41 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:09,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1117 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:45:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 22:45:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2025-03-08 22:45:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.32) internal successors, (132), 122 states have internal predecessors, (132), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 22:45:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2025-03-08 22:45:09,666 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 47 [2025-03-08 22:45:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:09,667 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2025-03-08 22:45:09,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 22:45:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2025-03-08 22:45:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 22:45:09,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:09,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:09,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 22:45:09,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 22:45:09,867 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting downsweepErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:09,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1662116030, now seen corresponding path program 1 times [2025-03-08 22:45:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107753624] [2025-03-08 22:45:09,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:09,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:45:09,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:45:09,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:09,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:45:09,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:09,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107753624] [2025-03-08 22:45:09,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107753624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:45:09,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:45:09,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:45:09,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170087145] [2025-03-08 22:45:09,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:45:09,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:45:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:09,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:45:09,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:45:09,910 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 22:45:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:09,980 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2025-03-08 22:45:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:45:09,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-08 22:45:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:09,981 INFO L225 Difference]: With dead ends: 139 [2025-03-08 22:45:09,981 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 22:45:09,982 INFO L434 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 [2025-03-08 22:45:09,982 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 46 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:09,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 213 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:45:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 22:45:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-08 22:45:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.27) internal successors, (127), 117 states have internal predecessors, (127), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 22:45:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2025-03-08 22:45:09,986 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 49 [2025-03-08 22:45:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:09,987 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2025-03-08 22:45:09,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 22:45:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2025-03-08 22:45:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 22:45:09,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:09,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:09,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:45:09,988 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting downsweepErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:09,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1662116031, now seen corresponding path program 1 times [2025-03-08 22:45:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:09,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060770631] [2025-03-08 22:45:09,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:09,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:45:10,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:45:10,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:10,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060770631] [2025-03-08 22:45:10,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060770631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839204357] [2025-03-08 22:45:10,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:10,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:10,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:10,200 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:10,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:45:10,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:45:10,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:45:10,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:10,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:10,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 22:45:10,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:10,275 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 [2025-03-08 22:45:10,328 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:45:10,328 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 1 case distinctions, treesize of input 18 treesize of output 17 [2025-03-08 22:45:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:45:11,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:11,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839204357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:11,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:45:11,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2025-03-08 22:45:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577503422] [2025-03-08 22:45:11,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:11,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 22:45:11,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:11,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 22:45:11,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:45:11,557 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 26 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 8 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:14,002 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2025-03-08 22:45:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:45:14,003 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 8 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 49 [2025-03-08 22:45:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:14,004 INFO L225 Difference]: With dead ends: 163 [2025-03-08 22:45:14,005 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 22:45:14,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=331, Invalid=2119, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 22:45:14,006 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 251 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:14,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 458 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:45:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 22:45:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2025-03-08 22:45:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 128 states have internal predecessors, (141), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 22:45:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 175 transitions. [2025-03-08 22:45:14,015 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 175 transitions. Word has length 49 [2025-03-08 22:45:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:14,015 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 175 transitions. [2025-03-08 22:45:14,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 8 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-08 22:45:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 175 transitions. [2025-03-08 22:45:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:45:14,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:14,016 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:14,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 22:45:14,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 22:45:14,217 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:14,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1084014404, now seen corresponding path program 3 times [2025-03-08 22:45:14,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:14,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46453944] [2025-03-08 22:45:14,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:45:14,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:14,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 5 equivalence classes. [2025-03-08 22:45:14,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 51 statements. [2025-03-08 22:45:14,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:45:14,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 22:45:14,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46453944] [2025-03-08 22:45:14,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46453944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557025848] [2025-03-08 22:45:14,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:45:14,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:14,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:14,503 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:14,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 22:45:14,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 5 equivalence classes. [2025-03-08 22:45:14,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 51 statements. [2025-03-08 22:45:14,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:45:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:14,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 22:45:14,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 22:45:14,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:15,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-03-08 22:45:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 22:45:15,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557025848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:45:15,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:45:15,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2025-03-08 22:45:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954689060] [2025-03-08 22:45:15,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:15,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 22:45:15,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:15,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 22:45:15,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 22:45:15,575 INFO L87 Difference]: Start difference. First operand 153 states and 175 transitions. Second operand has 42 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 15 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 22:45:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:45:16,288 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2025-03-08 22:45:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:45:16,288 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 15 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 51 [2025-03-08 22:45:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:45:16,289 INFO L225 Difference]: With dead ends: 169 [2025-03-08 22:45:16,289 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 22:45:16,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=372, Invalid=2598, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 22:45:16,290 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:45:16,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1307 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:45:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 22:45:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2025-03-08 22:45:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 119 states have (on average 1.26890756302521) internal successors, (151), 136 states have internal predecessors, (151), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 22:45:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 189 transitions. [2025-03-08 22:45:16,295 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 189 transitions. Word has length 51 [2025-03-08 22:45:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:45:16,295 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 189 transitions. [2025-03-08 22:45:16,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 15 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 22:45:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 189 transitions. [2025-03-08 22:45:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:45:16,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:45:16,295 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:45:16,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 22:45:16,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:16,497 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting upsweepErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:45:16,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:45:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash 755291816, now seen corresponding path program 1 times [2025-03-08 22:45:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:45:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999207409] [2025-03-08 22:45:16,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:45:16,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:45:16,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:45:16,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:16,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:45:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:45:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999207409] [2025-03-08 22:45:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999207409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713111264] [2025-03-08 22:45:16,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:45:16,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:45:16,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:45:16,747 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:45:16,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 22:45:16,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:45:16,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:45:16,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:45:16,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:45:16,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 22:45:16,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:45:16,851 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 [2025-03-08 22:45:16,855 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 [2025-03-08 22:45:16,921 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:45:16,921 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 [2025-03-08 22:45:16,928 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 18 treesize of output 13 [2025-03-08 22:45:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:45:35,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:45:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713111264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:45:41,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:45:41,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2025-03-08 22:45:41,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200103557] [2025-03-08 22:45:41,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:45:41,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 22:45:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:45:41,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 22:45:41,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2076, Unknown=5, NotChecked=0, Total=2352 [2025-03-08 22:45:41,102 INFO L87 Difference]: Start difference. First operand 164 states and 189 transitions. Second operand has 35 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 30 states have internal predecessors, (71), 10 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-08 22:45:45,309 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] [2025-03-08 22:45:49,353 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] [2025-03-08 22:45:53,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:45:57,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:46:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:28,720 INFO L93 Difference]: Finished difference Result 221 states and 256 transitions. [2025-03-08 22:46:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 22:46:28,721 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 30 states have internal predecessors, (71), 10 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 52 [2025-03-08 22:46:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:28,721 INFO L225 Difference]: With dead ends: 221 [2025-03-08 22:46:28,721 INFO L226 Difference]: Without dead ends: 221 [2025-03-08 22:46:28,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 53.2s TimeCoverageRelationStatistics Valid=707, Invalid=5133, Unknown=12, NotChecked=0, Total=5852 [2025-03-08 22:46:28,723 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 258 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 84 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:28,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1205 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2215 Invalid, 4 Unknown, 0 Unchecked, 17.7s Time] [2025-03-08 22:46:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-08 22:46:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 178. [2025-03-08 22:46:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 129 states have (on average 1.255813953488372) internal successors, (162), 146 states have internal predecessors, (162), 21 states have call successors, (21), 11 states have call predecessors, (21), 11 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 22:46:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2025-03-08 22:46:28,727 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 52 [2025-03-08 22:46:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:28,727 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2025-03-08 22:46:28,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 30 states have internal predecessors, (71), 10 states have call successors, (11), 7 states have call predecessors, (11), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-08 22:46:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2025-03-08 22:46:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:46:28,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:28,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:28,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:28,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:28,932 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting downsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:46:28,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash -579313896, now seen corresponding path program 1 times [2025-03-08 22:46:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:28,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789955574] [2025-03-08 22:46:28,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:28,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:46:28,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:46:28,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:46:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789955574] [2025-03-08 22:46:29,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789955574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361579926] [2025-03-08 22:46:29,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:29,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:29,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:29,217 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:46:29,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 22:46:29,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:46:29,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:46:29,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:29,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:29,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 22:46:29,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:46:29,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:29,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-08 22:46:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:46:29,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361579926] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:29,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:46:29,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 11] total 31 [2025-03-08 22:46:29,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516458736] [2025-03-08 22:46:29,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:29,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:46:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:29,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:46:29,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:46:29,810 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 22:46:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:30,015 INFO L93 Difference]: Finished difference Result 197 states and 228 transitions. [2025-03-08 22:46:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:46:30,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 52 [2025-03-08 22:46:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:30,016 INFO L225 Difference]: With dead ends: 197 [2025-03-08 22:46:30,016 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 22:46:30,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 22:46:30,017 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 42 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:30,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 501 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 22:46:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2025-03-08 22:46:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 156 states have internal predecessors, (172), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 22:46:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 218 transitions. [2025-03-08 22:46:30,022 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 218 transitions. Word has length 52 [2025-03-08 22:46:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:30,023 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 218 transitions. [2025-03-08 22:46:30,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 22:46:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 218 transitions. [2025-03-08 22:46:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:46:30,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:30,023 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:30,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 22:46:30,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:30,228 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-08 22:46:30,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:30,228 INFO L85 PathProgramCache]: Analyzing trace with hash -12568101, now seen corresponding path program 4 times [2025-03-08 22:46:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:30,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140981447] [2025-03-08 22:46:30,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:46:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:30,236 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-08 22:46:30,240 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 54 statements. [2025-03-08 22:46:30,240 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 22:46:30,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:46:30,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:30,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140981447] [2025-03-08 22:46:30,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140981447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:30,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610106869] [2025-03-08 22:46:30,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:46:30,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:30,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:30,376 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:46:30,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 22:46:30,429 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-03-08 22:46:30,445 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 54 statements. [2025-03-08 22:46:30,445 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 22:46:30,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:30,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 22:46:30,447 INFO L279 TraceCheckSpWp]: Computing forward predicates...