./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d450427152972d80716d02c80706dd3b248a3fc7c05c71ffd29d66e32e1e82f2 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:34:12,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:34:12,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:34:12,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:34:12,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:34:12,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:34:12,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:34:12,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:34:12,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:34:12,946 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:34:12,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:34:12,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:34:12,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:34:12,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:34:12,947 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:34:12,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:34:12,948 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:34:12,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:34:12,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:34:12,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:34:12,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:34:12,949 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 -> d450427152972d80716d02c80706dd3b248a3fc7c05c71ffd29d66e32e1e82f2 [2025-04-30 10:34:13,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:34:13,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:34:13,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:34:13,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:34:13,170 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:34:13,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2025-04-30 10:34:14,467 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41fa01caa/e4c082ef298c475986d3a2e7ab1803bf/FLAG1ee8fb11e [2025-04-30 10:34:14,690 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:34:14,690 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca-2.i [2025-04-30 10:34:14,699 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41fa01caa/e4c082ef298c475986d3a2e7ab1803bf/FLAG1ee8fb11e [2025-04-30 10:34:15,517 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41fa01caa/e4c082ef298c475986d3a2e7ab1803bf [2025-04-30 10:34:15,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:34:15,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:34:15,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:34:15,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:34:15,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:34:15,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c39b3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15, skipping insertion in model container [2025-04-30 10:34:15,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:34:15,787 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:34:15,788 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:34:15,792 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:34:15,800 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:34:15,847 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:34:15,863 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:34:15,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15 WrapperNode [2025-04-30 10:34:15,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:34:15,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:34:15,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:34:15,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:34:15,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,897 INFO L138 Inliner]: procedures = 117, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-04-30 10:34:15,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:34:15,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:34:15,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:34:15,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:34:15,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,916 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-04-30 10:34:15,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,920 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:34:15,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:34:15,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:34:15,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:34:15,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (1/1) ... [2025-04-30 10:34:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:34:15,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:15,960 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-04-30 10:34:15,965 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-04-30 10:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:34:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:34:15,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:34:16,056 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:34:16,057 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:34:16,187 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-04-30 10:34:16,187 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:34:16,194 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:34:16,195 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:34:16,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:34:16 BoogieIcfgContainer [2025-04-30 10:34:16,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:34:16,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:34:16,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:34:16,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:34:16,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:34:15" (1/3) ... [2025-04-30 10:34:16,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fdad3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:34:16, skipping insertion in model container [2025-04-30 10:34:16,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:34:15" (2/3) ... [2025-04-30 10:34:16,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fdad3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:34:16, skipping insertion in model container [2025-04-30 10:34:16,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:34:16" (3/3) ... [2025-04-30 10:34:16,204 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca-2.i [2025-04-30 10:34:16,214 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:34:16,215 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrpbrk-alloca-2.i that has 1 procedures, 42 locations, 50 edges, 1 initial locations, 4 loop locations, and 13 error locations. [2025-04-30 10:34:16,248 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:34:16,258 INFO L340 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;@14acc685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:34:16,259 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-30 10:34:16,262 INFO L278 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:16,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:16,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:16,267 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:16,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-30 10:34:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:16,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039554942] [2025-04-30 10:34:16,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:16,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:16,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:16,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:16,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:16,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:16,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:16,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039554942] [2025-04-30 10:34:16,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039554942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:16,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:16,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:34:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718468127] [2025-04-30 10:34:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:16,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:34:16,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:16,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:34:16,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:16,592 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:16,639 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-04-30 10:34:16,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:34:16,641 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:34:16,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:16,644 INFO L225 Difference]: With dead ends: 40 [2025-04-30 10:34:16,645 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:34:16,646 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:16,648 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:16,648 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 56 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:34:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-30 10:34:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-04-30 10:34:16,675 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 7 [2025-04-30 10:34:16,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:16,675 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-04-30 10:34:16,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:16,675 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-04-30 10:34:16,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:16,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:16,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:16,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:34:16,677 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:16,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028969, now seen corresponding path program 1 times [2025-04-30 10:34:16,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:16,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814846455] [2025-04-30 10:34:16,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:16,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:16,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:16,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:16,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:16,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:16,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814846455] [2025-04-30 10:34:16,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814846455] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:16,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300670825] [2025-04-30 10:34:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:16,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:16,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:16,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:16,976 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:17,071 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-04-30 10:34:17,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:17,071 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:34:17,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:17,072 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:34:17,072 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:34:17,072 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:17,073 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:17,073 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 113 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:34:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2025-04-30 10:34:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-04-30 10:34:17,079 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 7 [2025-04-30 10:34:17,079 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:17,079 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-04-30 10:34:17,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,079 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2025-04-30 10:34:17,080 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:17,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:17,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:17,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:34:17,081 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:17,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876011, now seen corresponding path program 1 times [2025-04-30 10:34:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:17,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855277069] [2025-04-30 10:34:17,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:17,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:17,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:17,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:17,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:17,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:17,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855277069] [2025-04-30 10:34:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855277069] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:17,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:17,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999486525] [2025-04-30 10:34:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:17,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:34:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:17,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:34:17,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:17,248 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:17,300 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-04-30 10:34:17,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:17,301 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:34:17,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:17,301 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:34:17,301 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:34:17,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:17,302 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:17,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 109 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:34:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2025-04-30 10:34:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-04-30 10:34:17,305 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 7 [2025-04-30 10:34:17,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:17,306 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-04-30 10:34:17,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,306 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-04-30 10:34:17,306 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:34:17,306 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:17,306 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:17,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:34:17,306 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:17,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash 627432691, now seen corresponding path program 1 times [2025-04-30 10:34:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:17,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835859323] [2025-04-30 10:34:17,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:17,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:34:17,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:34:17,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:17,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:17,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:17,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835859323] [2025-04-30 10:34:17,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835859323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:17,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871481584] [2025-04-30 10:34:17,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:17,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:17,369 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-04-30 10:34:17,371 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-04-30 10:34:17,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:34:17,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:34:17,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:17,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:17,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:34:17,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:17,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:34:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871481584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:17,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:34:17,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:34:17,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739330153] [2025-04-30 10:34:17,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:17,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:17,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:17,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:17,459 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:17,483 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-04-30 10:34:17,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:17,483 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:34:17,483 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:17,484 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:34:17,484 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:34:17,484 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:17,484 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:17,484 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:34:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2025-04-30 10:34:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-04-30 10:34:17,487 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 10 [2025-04-30 10:34:17,487 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:17,487 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-04-30 10:34:17,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,487 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-04-30 10:34:17,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:34:17,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:17,488 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:17,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:34:17,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:17,688 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:17,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash -181913935, now seen corresponding path program 1 times [2025-04-30 10:34:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:17,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249873430] [2025-04-30 10:34:17,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:17,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:17,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:34:17,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:34:17,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:17,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:17,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249873430] [2025-04-30 10:34:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249873430] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:17,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864381314] [2025-04-30 10:34:17,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:17,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:17,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:17,965 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-04-30 10:34:17,966 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-04-30 10:34:17,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:34:18,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:34:18,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:18,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:18,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:34:18,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:18,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:34:18,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-30 10:34:18,064 INFO L354 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 10 treesize of output 8 [2025-04-30 10:34:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:18,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:18,384 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:34:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:18,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864381314] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:18,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:18,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-30 10:34:18,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268477456] [2025-04-30 10:34:18,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:18,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:34:18,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:18,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:34:18,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:34:18,431 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:18,567 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-04-30 10:34:18,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:34:18,568 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:34:18,568 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:18,568 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:34:18,569 INFO L226 Difference]: Without dead ends: 46 [2025-04-30 10:34:18,569 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:34:18,569 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:18,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 204 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-30 10:34:18,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-04-30 10:34:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.5) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-04-30 10:34:18,572 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 10 [2025-04-30 10:34:18,572 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:18,572 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-04-30 10:34:18,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:18,572 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2025-04-30 10:34:18,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:34:18,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:18,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:18,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:34:18,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:18,773 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:18,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2024416852, now seen corresponding path program 1 times [2025-04-30 10:34:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:18,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527528789] [2025-04-30 10:34:18,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:18,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:18,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:18,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:18,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:18,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:18,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527528789] [2025-04-30 10:34:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527528789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:18,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:18,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124146415] [2025-04-30 10:34:18,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:18,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:18,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:18,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:18,808 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:18,825 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-04-30 10:34:18,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:18,826 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:34:18,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:18,826 INFO L225 Difference]: With dead ends: 48 [2025-04-30 10:34:18,826 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:34:18,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:18,827 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:18,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 66 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:34:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-04-30 10:34:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-04-30 10:34:18,831 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 11 [2025-04-30 10:34:18,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:18,831 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-04-30 10:34:18,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:18,832 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-04-30 10:34:18,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:34:18,832 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:18,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:18,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:34:18,832 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:18,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2024417044, now seen corresponding path program 1 times [2025-04-30 10:34:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:18,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761718703] [2025-04-30 10:34:18,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:18,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:18,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:18,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:18,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:18,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:18,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761718703] [2025-04-30 10:34:18,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761718703] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:18,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64795705] [2025-04-30 10:34:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:18,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:34:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:18,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:34:18,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:18,965 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:19,046 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-04-30 10:34:19,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:19,046 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:34:19,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:19,047 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:34:19,047 INFO L226 Difference]: Without dead ends: 67 [2025-04-30 10:34:19,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:19,048 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:19,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 134 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-30 10:34:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2025-04-30 10:34:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2025-04-30 10:34:19,054 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 11 [2025-04-30 10:34:19,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:19,054 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2025-04-30 10:34:19,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,054 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2025-04-30 10:34:19,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:34:19,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:19,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:19,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:34:19,054 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:19,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2024417045, now seen corresponding path program 1 times [2025-04-30 10:34:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:19,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613663351] [2025-04-30 10:34:19,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:19,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:19,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:19,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:19,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:19,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:19,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613663351] [2025-04-30 10:34:19,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613663351] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:19,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:19,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:34:19,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249871495] [2025-04-30 10:34:19,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:19,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:34:19,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:19,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:34:19,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:19,111 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:19,133 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2025-04-30 10:34:19,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:34:19,134 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:34:19,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:19,134 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:34:19,134 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:34:19,134 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:19,135 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:19,135 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:34:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-30 10:34:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 59 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-04-30 10:34:19,137 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 11 [2025-04-30 10:34:19,137 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:19,137 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-04-30 10:34:19,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,139 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-04-30 10:34:19,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:34:19,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:19,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:19,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:34:19,140 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:19,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:19,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1461203626, now seen corresponding path program 1 times [2025-04-30 10:34:19,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:19,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111089258] [2025-04-30 10:34:19,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:19,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:19,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:19,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:19,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:19,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:19,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111089258] [2025-04-30 10:34:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111089258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:19,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:34:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927439056] [2025-04-30 10:34:19,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:19,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:34:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:19,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:34:19,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:19,306 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:19,384 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-04-30 10:34:19,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:19,385 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:34:19,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:19,385 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:34:19,385 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:34:19,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:34:19,386 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:19,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 92 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:34:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-04-30 10:34:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 60 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-04-30 10:34:19,389 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 11 [2025-04-30 10:34:19,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:19,389 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-04-30 10:34:19,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,390 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-04-30 10:34:19,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:34:19,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:19,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:19,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:34:19,390 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:19,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash 522585882, now seen corresponding path program 1 times [2025-04-30 10:34:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:19,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535035619] [2025-04-30 10:34:19,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:19,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:34:19,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:34:19,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:19,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535035619] [2025-04-30 10:34:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535035619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:19,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690692684] [2025-04-30 10:34:19,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:19,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:19,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:19,485 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-04-30 10:34:19,489 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-04-30 10:34:19,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:34:19,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:34:19,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:19,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:19,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:34:19,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:19,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:19,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-30 10:34:19,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:19,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690692684] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:19,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:19,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-04-30 10:34:19,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778753844] [2025-04-30 10:34:19,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:19,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:34:19,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:19,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:34:19,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:34:19,697 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:19,785 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-04-30 10:34:19,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:19,785 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:34:19,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:19,786 INFO L225 Difference]: With dead ends: 74 [2025-04-30 10:34:19,786 INFO L226 Difference]: Without dead ends: 74 [2025-04-30 10:34:19,786 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:34:19,786 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:19,787 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 174 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-30 10:34:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-04-30 10:34:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.353846153846154) internal successors, (88), 72 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2025-04-30 10:34:19,793 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 14 [2025-04-30 10:34:19,793 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:19,793 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2025-04-30 10:34:19,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:19,793 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2025-04-30 10:34:19,793 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:34:19,793 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:19,794 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:19,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:19,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:19,994 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:19,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash 522585690, now seen corresponding path program 1 times [2025-04-30 10:34:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:19,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094990400] [2025-04-30 10:34:19,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:19,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:20,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:34:20,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:34:20,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:20,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:20,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:20,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094990400] [2025-04-30 10:34:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094990400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:20,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58656558] [2025-04-30 10:34:20,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:20,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:20,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:20,045 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-04-30 10:34:20,047 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-04-30 10:34:20,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:34:20,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:34:20,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:20,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:20,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:34:20,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:20,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:34:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58656558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:20,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:34:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:34:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071695144] [2025-04-30 10:34:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:20,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:20,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:20,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:20,122 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:20,142 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2025-04-30 10:34:20,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:20,142 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:34:20,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:20,142 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:34:20,142 INFO L226 Difference]: Without dead ends: 72 [2025-04-30 10:34:20,142 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:20,144 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:20,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 97 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-30 10:34:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-04-30 10:34:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 70 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2025-04-30 10:34:20,147 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 14 [2025-04-30 10:34:20,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:20,150 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2025-04-30 10:34:20,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:20,150 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2025-04-30 10:34:20,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:34:20,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:20,151 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:20,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:20,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:20,352 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:20,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1223650268, now seen corresponding path program 1 times [2025-04-30 10:34:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:20,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927684612] [2025-04-30 10:34:20,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:20,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:20,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:34:20,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:34:20,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:20,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:20,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:20,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927684612] [2025-04-30 10:34:20,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927684612] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:20,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474854031] [2025-04-30 10:34:20,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:20,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:20,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:20,527 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-04-30 10:34:20,529 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-04-30 10:34:20,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:34:20,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:34:20,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:20,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:20,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:34:20,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:20,592 INFO L354 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-04-30 10:34:20,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-30 10:34:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:20,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:20,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474854031] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:20,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:20,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-04-30 10:34:20,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800794575] [2025-04-30 10:34:20,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:20,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:34:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:20,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:34:20,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:34:20,975 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:21,123 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2025-04-30 10:34:21,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:34:21,123 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:34:21,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:21,124 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:34:21,124 INFO L226 Difference]: Without dead ends: 72 [2025-04-30 10:34:21,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:34:21,124 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:21,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 153 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-30 10:34:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2025-04-30 10:34:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.278688524590164) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-04-30 10:34:21,126 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 14 [2025-04-30 10:34:21,126 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:21,126 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-04-30 10:34:21,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,129 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-04-30 10:34:21,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:34:21,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:21,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:21,135 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-04-30 10:34:21,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-30 10:34:21,334 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:21,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash 780751320, now seen corresponding path program 1 times [2025-04-30 10:34:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:21,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112721394] [2025-04-30 10:34:21,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:21,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:21,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:34:21,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:34:21,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:21,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:21,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:21,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112721394] [2025-04-30 10:34:21,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112721394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:21,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:21,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:34:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884670627] [2025-04-30 10:34:21,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:21,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:34:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:21,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:34:21,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:21,415 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:21,444 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-04-30 10:34:21,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:21,445 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:34:21,445 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:21,445 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:34:21,445 INFO L226 Difference]: Without dead ends: 67 [2025-04-30 10:34:21,445 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:21,445 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:21,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 102 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-30 10:34:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2025-04-30 10:34:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-04-30 10:34:21,447 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 14 [2025-04-30 10:34:21,447 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:21,447 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-04-30 10:34:21,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,447 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-04-30 10:34:21,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:34:21,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:21,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:21,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:34:21,448 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:21,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash -721541425, now seen corresponding path program 1 times [2025-04-30 10:34:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:21,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017539241] [2025-04-30 10:34:21,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:21,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:34:21,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:34:21,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:21,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:21,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017539241] [2025-04-30 10:34:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017539241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:34:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116959696] [2025-04-30 10:34:21,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:21,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:34:21,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:21,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:34:21,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:21,528 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:21,549 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-04-30 10:34:21,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:34:21,549 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:34:21,550 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:21,550 INFO L225 Difference]: With dead ends: 57 [2025-04-30 10:34:21,550 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:34:21,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:21,550 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:21,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:34:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-04-30 10:34:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-04-30 10:34:21,552 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 15 [2025-04-30 10:34:21,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:21,553 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-04-30 10:34:21,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,553 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2025-04-30 10:34:21,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:34:21,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:21,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:21,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:34:21,553 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:21,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2144397059, now seen corresponding path program 1 times [2025-04-30 10:34:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:21,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701322468] [2025-04-30 10:34:21,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:21,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:34:21,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:34:21,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:21,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:21,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:21,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701322468] [2025-04-30 10:34:21,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701322468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:21,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:21,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:21,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755165332] [2025-04-30 10:34:21,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:21,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:21,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:21,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:21,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:21,633 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:21,662 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2025-04-30 10:34:21,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:21,663 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:34:21,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:21,663 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:34:21,663 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:34:21,663 INFO L436 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-04-30 10:34:21,664 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:21,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 69 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:34:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-04-30 10:34:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-04-30 10:34:21,665 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 18 [2025-04-30 10:34:21,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:21,665 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-04-30 10:34:21,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:21,665 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-04-30 10:34:21,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:34:21,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:21,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:21,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:34:21,666 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:21,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2144397058, now seen corresponding path program 1 times [2025-04-30 10:34:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:21,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072775607] [2025-04-30 10:34:21,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:21,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:21,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:34:21,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:34:21,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:21,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:21,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:21,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072775607] [2025-04-30 10:34:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072775607] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:21,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699536784] [2025-04-30 10:34:21,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:21,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:21,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:21,768 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-04-30 10:34:21,770 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-04-30 10:34:21,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:34:21,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:34:21,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:21,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-30 10:34:21,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:21,844 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:34:21,844 INFO L354 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 1 case distinctions, treesize of input 9 treesize of output 11 [2025-04-30 10:34:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:21,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699536784] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:34:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 8] total 20 [2025-04-30 10:34:22,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394397222] [2025-04-30 10:34:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:22,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:34:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:22,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:34:22,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:34:22,150 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:22,221 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2025-04-30 10:34:22,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:34:22,222 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:34:22,222 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:22,222 INFO L225 Difference]: With dead ends: 66 [2025-04-30 10:34:22,222 INFO L226 Difference]: Without dead ends: 66 [2025-04-30 10:34:22,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:34:22,223 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:22,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 164 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-30 10:34:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-04-30 10:34:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-04-30 10:34:22,226 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 18 [2025-04-30 10:34:22,226 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:22,226 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-04-30 10:34:22,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:22,226 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-04-30 10:34:22,226 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:34:22,226 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:22,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:22,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:22,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:34:22,431 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:22,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:22,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1129501884, now seen corresponding path program 1 times [2025-04-30 10:34:22,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:22,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272153441] [2025-04-30 10:34:22,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:22,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:22,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:34:22,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:34:22,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:22,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:22,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:22,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272153441] [2025-04-30 10:34:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272153441] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:22,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292345560] [2025-04-30 10:34:22,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:22,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:22,524 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-04-30 10:34:22,525 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-04-30 10:34:22,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:34:22,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:34:22,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:22,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:22,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:34:22,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:22,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:22,673 INFO L354 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 20 treesize of output 16 [2025-04-30 10:34:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292345560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:22,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-30 10:34:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220594461] [2025-04-30 10:34:22,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:22,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:34:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:22,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:34:22,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:34:22,683 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:22,748 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2025-04-30 10:34:22,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:34:22,748 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-30 10:34:22,748 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:22,749 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:34:22,749 INFO L226 Difference]: Without dead ends: 72 [2025-04-30 10:34:22,749 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:34:22,749 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:22,750 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-30 10:34:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2025-04-30 10:34:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2025-04-30 10:34:22,751 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 18 [2025-04-30 10:34:22,751 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:22,751 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-04-30 10:34:22,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:22,751 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2025-04-30 10:34:22,752 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:34:22,752 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:22,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:22,759 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-04-30 10:34:22,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:22,952 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:22,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -362893059, now seen corresponding path program 1 times [2025-04-30 10:34:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:22,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880274391] [2025-04-30 10:34:22,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:22,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:22,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:34:22,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:34:22,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:22,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:23,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:23,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880274391] [2025-04-30 10:34:23,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880274391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:23,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411890341] [2025-04-30 10:34:23,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:23,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:23,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:23,143 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-04-30 10:34:23,144 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-04-30 10:34:23,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:34:23,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:34:23,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:23,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:23,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:34:23,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:23,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:23,332 INFO L354 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 20 treesize of output 16 [2025-04-30 10:34:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411890341] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:23,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:23,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2025-04-30 10:34:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409171816] [2025-04-30 10:34:23,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:23,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:34:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:23,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:34:23,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:34:23,349 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:23,465 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2025-04-30 10:34:23,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:34:23,466 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-30 10:34:23,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:23,466 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:34:23,466 INFO L226 Difference]: Without dead ends: 59 [2025-04-30 10:34:23,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:34:23,467 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:23,467 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 189 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-30 10:34:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-04-30 10:34:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 56 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2025-04-30 10:34:23,468 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 23 [2025-04-30 10:34:23,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:23,468 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2025-04-30 10:34:23,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:23,468 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2025-04-30 10:34:23,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:34:23,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:23,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:23,479 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-04-30 10:34:23,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:34:23,673 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:23,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash -362893060, now seen corresponding path program 1 times [2025-04-30 10:34:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:23,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829748157] [2025-04-30 10:34:23,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:23,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:34:23,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:34:23,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:23,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:23,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829748157] [2025-04-30 10:34:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829748157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:23,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911928922] [2025-04-30 10:34:23,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:23,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:34:23,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:23,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:34:23,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:23,716 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:23,762 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-04-30 10:34:23,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:23,762 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-30 10:34:23,763 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:23,763 INFO L225 Difference]: With dead ends: 61 [2025-04-30 10:34:23,763 INFO L226 Difference]: Without dead ends: 61 [2025-04-30 10:34:23,763 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:34:23,763 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:23,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-30 10:34:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2025-04-30 10:34:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-04-30 10:34:23,765 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 23 [2025-04-30 10:34:23,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:23,765 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-04-30 10:34:23,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:23,766 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2025-04-30 10:34:23,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:34:23,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:23,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:23,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:34:23,766 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:23,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash -362807724, now seen corresponding path program 1 times [2025-04-30 10:34:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:23,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71258813] [2025-04-30 10:34:23,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:23,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:34:23,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:34:23,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:23,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:23,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:23,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71258813] [2025-04-30 10:34:23,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71258813] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:23,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:23,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:34:23,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335802924] [2025-04-30 10:34:23,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:23,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:23,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:23,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:23,855 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:23,867 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2025-04-30 10:34:23,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:23,868 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-30 10:34:23,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:23,868 INFO L225 Difference]: With dead ends: 55 [2025-04-30 10:34:23,868 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:34:23,868 INFO L436 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-04-30 10:34:23,869 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:23,869 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 52 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:34:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-30 10:34:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-04-30 10:34:23,872 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 23 [2025-04-30 10:34:23,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:23,872 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-04-30 10:34:23,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:23,873 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-04-30 10:34:23,873 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:34:23,873 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:23,873 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:23,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:34:23,873 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:23,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1232491555, now seen corresponding path program 1 times [2025-04-30 10:34:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:23,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786072118] [2025-04-30 10:34:23,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:23,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:23,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:34:23,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:34:23,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:23,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:24,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786072118] [2025-04-30 10:34:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786072118] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:24,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290009425] [2025-04-30 10:34:24,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:24,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:24,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:24,027 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-04-30 10:34:24,028 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-04-30 10:34:24,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:34:24,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:34:24,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:24,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:24,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:34:24,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:24,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:34:24,183 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:34:24,185 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:24,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2025-04-30 10:34:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:34:24,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:34:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290009425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:24,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:34:24,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 14 [2025-04-30 10:34:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84581543] [2025-04-30 10:34:24,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:24,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:34:24,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:24,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:34:24,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:34:24,191 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:24,240 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-04-30 10:34:24,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:34:24,241 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-30 10:34:24,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:24,241 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:34:24,241 INFO L226 Difference]: Without dead ends: 41 [2025-04-30 10:34:24,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:34:24,242 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:24,242 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-30 10:34:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-04-30 10:34:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-04-30 10:34:24,243 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 27 [2025-04-30 10:34:24,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:24,243 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-04-30 10:34:24,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:24,243 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-04-30 10:34:24,244 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:34:24,244 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:24,244 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:24,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:34:24,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:24,446 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:24,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1373040165, now seen corresponding path program 1 times [2025-04-30 10:34:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:24,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26878278] [2025-04-30 10:34:24,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:24,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:34:24,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:34:24,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:24,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:24,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:24,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26878278] [2025-04-30 10:34:24,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26878278] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:24,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692535072] [2025-04-30 10:34:24,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:24,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:24,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:24,618 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-04-30 10:34:24,620 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-04-30 10:34:24,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:34:24,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:34:24,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:24,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:24,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:34:24,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:24,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:34:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:24,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:24,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-30 10:34:24,749 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-04-30 10:34:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692535072] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:24,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-04-30 10:34:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699640892] [2025-04-30 10:34:24,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:24,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:34:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:24,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:34:24,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:34:24,793 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:24,887 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2025-04-30 10:34:24,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:34:24,890 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-30 10:34:24,890 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:24,890 INFO L225 Difference]: With dead ends: 66 [2025-04-30 10:34:24,891 INFO L226 Difference]: Without dead ends: 51 [2025-04-30 10:34:24,891 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:34:24,892 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:24,892 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 192 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-30 10:34:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-04-30 10:34:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-04-30 10:34:24,893 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 27 [2025-04-30 10:34:24,893 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:24,893 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-04-30 10:34:24,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:24,893 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-04-30 10:34:24,893 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:34:24,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:24,894 INFO L218 NwaCegarLoop]: trace histogram [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-04-30 10:34:24,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:34:25,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-30 10:34:25,095 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:25,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1286146155, now seen corresponding path program 2 times [2025-04-30 10:34:25,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:25,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54234672] [2025-04-30 10:34:25,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:25,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:25,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-30 10:34:25,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:34:25,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:25,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:25,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:25,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54234672] [2025-04-30 10:34:25,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54234672] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:25,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294987952] [2025-04-30 10:34:25,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:25,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:25,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:25,321 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-04-30 10:34:25,324 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-04-30 10:34:25,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-30 10:34:25,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:34:25,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:25,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:25,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:34:25,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:25,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:25,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294987952] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:25,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:25,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-30 10:34:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464063031] [2025-04-30 10:34:25,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:25,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:34:25,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:25,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:34:25,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:34:25,645 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:25,788 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2025-04-30 10:34:25,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:34:25,788 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-30 10:34:25,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:25,788 INFO L225 Difference]: With dead ends: 62 [2025-04-30 10:34:25,789 INFO L226 Difference]: Without dead ends: 62 [2025-04-30 10:34:25,789 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:34:25,789 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:25,789 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 185 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-30 10:34:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2025-04-30 10:34:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-04-30 10:34:25,790 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 30 [2025-04-30 10:34:25,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:25,790 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-04-30 10:34:25,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:25,791 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-04-30 10:34:25,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:34:25,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:25,791 INFO L218 NwaCegarLoop]: trace histogram [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-04-30 10:34:25,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:25,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-30 10:34:25,991 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:25,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1215794825, now seen corresponding path program 1 times [2025-04-30 10:34:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:25,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008389518] [2025-04-30 10:34:25,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:25,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:34:26,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:34:26,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:26,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:34:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:26,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008389518] [2025-04-30 10:34:26,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008389518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:26,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:26,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:34:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536192319] [2025-04-30 10:34:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:26,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:34:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:26,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:34:26,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:34:26,152 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:26,216 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2025-04-30 10:34:26,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:34:26,216 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-30 10:34:26,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:26,217 INFO L225 Difference]: With dead ends: 83 [2025-04-30 10:34:26,217 INFO L226 Difference]: Without dead ends: 83 [2025-04-30 10:34:26,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:34:26,217 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:26,217 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-30 10:34:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-04-30 10:34:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.125) internal successors, (90), 81 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-04-30 10:34:26,219 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 31 [2025-04-30 10:34:26,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:26,219 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-04-30 10:34:26,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:26,219 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-04-30 10:34:26,220 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:34:26,220 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:26,220 INFO L218 NwaCegarLoop]: trace histogram [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-04-30 10:34:26,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:34:26,220 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:26,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 706321735, now seen corresponding path program 1 times [2025-04-30 10:34:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:26,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254680760] [2025-04-30 10:34:26,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:26,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:26,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:34:26,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:34:26,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:26,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:26,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254680760] [2025-04-30 10:34:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254680760] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:26,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651289021] [2025-04-30 10:34:26,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:26,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:26,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:26,421 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-04-30 10:34:26,422 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-04-30 10:34:26,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:34:26,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:34:26,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:26,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:26,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-30 10:34:26,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:26,539 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:34:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:26,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:26,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-30 10:34:26,576 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-04-30 10:34:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651289021] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:26,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2025-04-30 10:34:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701502136] [2025-04-30 10:34:26,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:26,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:34:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:26,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:34:26,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:34:26,625 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:26,760 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2025-04-30 10:34:26,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:34:26,761 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-30 10:34:26,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:26,761 INFO L225 Difference]: With dead ends: 111 [2025-04-30 10:34:26,761 INFO L226 Difference]: Without dead ends: 111 [2025-04-30 10:34:26,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:34:26,762 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:26,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 208 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-30 10:34:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2025-04-30 10:34:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 84 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2025-04-30 10:34:26,763 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 31 [2025-04-30 10:34:26,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:26,763 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2025-04-30 10:34:26,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:26,764 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2025-04-30 10:34:26,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:34:26,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:26,764 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-04-30 10:34:26,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:26,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-30 10:34:26,968 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:26,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 863188717, now seen corresponding path program 2 times [2025-04-30 10:34:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:26,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650918604] [2025-04-30 10:34:26,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:26,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:26,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-30 10:34:26,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:34:26,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:26,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:27,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:27,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650918604] [2025-04-30 10:34:27,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650918604] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:27,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688277895] [2025-04-30 10:34:27,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:27,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:27,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:27,185 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-04-30 10:34:27,187 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-04-30 10:34:27,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-30 10:34:27,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:34:27,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:27,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:27,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-30 10:34:27,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:27,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:27,494 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:27,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688277895] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:27,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:27,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2025-04-30 10:34:27,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295282421] [2025-04-30 10:34:27,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:27,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:34:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:27,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:34:27,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:34:27,525 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:27,774 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2025-04-30 10:34:27,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:34:27,775 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-30 10:34:27,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:27,775 INFO L225 Difference]: With dead ends: 105 [2025-04-30 10:34:27,775 INFO L226 Difference]: Without dead ends: 105 [2025-04-30 10:34:27,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:34:27,776 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:27,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 363 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-30 10:34:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2025-04-30 10:34:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.1397849462365592) internal successors, (106), 94 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:27,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2025-04-30 10:34:27,778 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 34 [2025-04-30 10:34:27,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:27,779 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2025-04-30 10:34:27,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:27,779 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2025-04-30 10:34:27,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:34:27,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:27,779 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:27,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:27,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-30 10:34:27,983 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:27,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash 150892374, now seen corresponding path program 3 times [2025-04-30 10:34:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:27,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891886061] [2025-04-30 10:34:27,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:27,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-04-30 10:34:28,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:34:28,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:28,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:28,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:28,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891886061] [2025-04-30 10:34:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891886061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:28,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447749628] [2025-04-30 10:34:28,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:28,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:28,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:28,209 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-04-30 10:34:28,210 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-04-30 10:34:28,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-04-30 10:34:28,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:34:28,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:28,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:28,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-30 10:34:28,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:28,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:28,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:28,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:28,412 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:34:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:34:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447749628] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:28,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:28,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 23 [2025-04-30 10:34:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143734105] [2025-04-30 10:34:28,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:28,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:34:28,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:28,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:34:28,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:34:28,461 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:28,586 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2025-04-30 10:34:28,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:34:28,586 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-30 10:34:28,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:28,587 INFO L225 Difference]: With dead ends: 157 [2025-04-30 10:34:28,587 INFO L226 Difference]: Without dead ends: 133 [2025-04-30 10:34:28,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:34:28,587 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:28,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 341 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-04-30 10:34:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2025-04-30 10:34:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.126984126984127) internal successors, (142), 127 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2025-04-30 10:34:28,591 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 39 [2025-04-30 10:34:28,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:28,592 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2025-04-30 10:34:28,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:28,592 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2025-04-30 10:34:28,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:34:28,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:28,592 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-04-30 10:34:28,599 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-04-30 10:34:28,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:28,797 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:28,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1227527711, now seen corresponding path program 3 times [2025-04-30 10:34:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:28,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865525705] [2025-04-30 10:34:28,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:28,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-04-30 10:34:28,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:34:28,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:28,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:29,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865525705] [2025-04-30 10:34:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865525705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:29,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645807078] [2025-04-30 10:34:29,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:29,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:29,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:29,146 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-04-30 10:34:29,147 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-04-30 10:34:29,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-04-30 10:34:29,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:34:29,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:29,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:29,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-30 10:34:29,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:29,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:29,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:29,405 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:29,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:34:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645807078] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:29,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:29,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 29 [2025-04-30 10:34:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636646606] [2025-04-30 10:34:29,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:29,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-30 10:34:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:29,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-30 10:34:29,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:34:29,458 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:29,741 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2025-04-30 10:34:29,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:34:29,741 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-30 10:34:29,741 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:29,742 INFO L225 Difference]: With dead ends: 197 [2025-04-30 10:34:29,742 INFO L226 Difference]: Without dead ends: 180 [2025-04-30 10:34:29,742 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2025-04-30 10:34:29,742 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:29,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 508 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-04-30 10:34:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2025-04-30 10:34:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.121212121212121) internal successors, (185), 166 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2025-04-30 10:34:29,750 INFO L79 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 39 [2025-04-30 10:34:29,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:29,750 INFO L485 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2025-04-30 10:34:29,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:29,750 INFO L278 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2025-04-30 10:34:29,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-30 10:34:29,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:29,750 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:29,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:29,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-30 10:34:29,955 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:29,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:29,955 INFO L85 PathProgramCache]: Analyzing trace with hash -548581220, now seen corresponding path program 4 times [2025-04-30 10:34:29,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:29,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651285041] [2025-04-30 10:34:29,955 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:29,961 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:34:29,967 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 42 statements. [2025-04-30 10:34:29,967 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:29,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:34:30,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:30,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651285041] [2025-04-30 10:34:30,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651285041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:30,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580067777] [2025-04-30 10:34:30,513 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:30,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:30,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:30,515 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-04-30 10:34:30,516 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-04-30 10:34:30,568 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:34:30,584 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 42 statements. [2025-04-30 10:34:30,584 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:30,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:30,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-30 10:34:30,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:30,669 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-30 10:34:31,069 INFO L325 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2025-04-30 10:34:31,069 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2025-04-30 10:34:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:34:31,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:31,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-04-30 10:34:31,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2025-04-30 10:34:31,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:34:31,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580067777] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:31,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:31,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 43 [2025-04-30 10:34:31,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494452142] [2025-04-30 10:34:31,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:31,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-30 10:34:31,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:31,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-30 10:34:31,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1707, Unknown=0, NotChecked=0, Total=1892 [2025-04-30 10:34:31,760 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:32,159 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2025-04-30 10:34:32,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:34:32,159 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-30 10:34:32,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:32,160 INFO L225 Difference]: With dead ends: 167 [2025-04-30 10:34:32,160 INFO L226 Difference]: Without dead ends: 96 [2025-04-30 10:34:32,160 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=265, Invalid=2185, Unknown=0, NotChecked=0, Total=2450 [2025-04-30 10:34:32,160 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:32,161 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 277 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-30 10:34:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2025-04-30 10:34:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 75 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2025-04-30 10:34:32,162 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 42 [2025-04-30 10:34:32,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:32,162 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2025-04-30 10:34:32,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:32,163 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2025-04-30 10:34:32,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-30 10:34:32,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:32,163 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:32,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-30 10:34:32,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:34:32,364 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:32,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1642462599, now seen corresponding path program 4 times [2025-04-30 10:34:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:32,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154484434] [2025-04-30 10:34:32,364 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:32,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:32,370 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:34:32,372 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 35 of 42 statements. [2025-04-30 10:34:32,372 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:32,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:32,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154484434] [2025-04-30 10:34:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154484434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:32,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018495038] [2025-04-30 10:34:32,516 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:32,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:32,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:32,518 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:32,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:34:32,572 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:34:32,588 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 35 of 42 statements. [2025-04-30 10:34:32,588 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:32,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:32,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-30 10:34:32,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:32,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:32,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-30 10:34:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:32,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018495038] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:32,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:32,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2025-04-30 10:34:32,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288440656] [2025-04-30 10:34:32,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:32,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:34:32,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:32,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:34:32,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:34:32,800 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 21 states, 20 states have (on average 3.4) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:32,994 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2025-04-30 10:34:32,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:34:32,994 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.4) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-30 10:34:32,994 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:32,995 INFO L225 Difference]: With dead ends: 98 [2025-04-30 10:34:32,995 INFO L226 Difference]: Without dead ends: 98 [2025-04-30 10:34:32,995 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:34:32,995 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:32,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 269 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-30 10:34:32,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2025-04-30 10:34:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2025-04-30 10:34:32,997 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 42 [2025-04-30 10:34:32,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:32,997 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2025-04-30 10:34:32,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.4) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:32,997 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2025-04-30 10:34:33,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:34:33,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:33,001 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:33,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:33,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:33,205 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:33,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:33,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1510427769, now seen corresponding path program 5 times [2025-04-30 10:34:33,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:33,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941020903] [2025-04-30 10:34:33,205 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:33,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:33,211 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 4 equivalence classes. [2025-04-30 10:34:33,219 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:34:33,219 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-30 10:34:33,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:33,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:33,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941020903] [2025-04-30 10:34:33,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941020903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:33,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859953049] [2025-04-30 10:34:33,924 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:33,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:33,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:33,926 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:33,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-30 10:34:33,979 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 4 equivalence classes. [2025-04-30 10:34:34,000 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:34:34,000 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-30 10:34:34,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:34,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-30 10:34:34,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:34,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:34,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:34,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:34,236 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:34:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:34,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859953049] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:34,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:34,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 16] total 34 [2025-04-30 10:34:34,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228032404] [2025-04-30 10:34:34,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:34,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:34:34,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:34,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:34:34,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:34:34,298 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:35,061 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2025-04-30 10:34:35,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-30 10:34:35,061 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-30 10:34:35,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:35,062 INFO L225 Difference]: With dead ends: 152 [2025-04-30 10:34:35,062 INFO L226 Difference]: Without dead ends: 98 [2025-04-30 10:34:35,063 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=2969, Unknown=0, NotChecked=0, Total=3192 [2025-04-30 10:34:35,063 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 57 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:35,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 555 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-30 10:34:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2025-04-30 10:34:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.098901098901099) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2025-04-30 10:34:35,068 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 47 [2025-04-30 10:34:35,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:35,068 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2025-04-30 10:34:35,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:35,068 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2025-04-30 10:34:35,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:34:35,069 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:35,069 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:35,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-30 10:34:35,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:35,270 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:35,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1322893011, now seen corresponding path program 6 times [2025-04-30 10:34:35,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:35,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942232755] [2025-04-30 10:34:35,270 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:35,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:35,276 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 5 equivalence classes. [2025-04-30 10:34:35,288 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:34:35,288 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:34:35,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:35,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942232755] [2025-04-30 10:34:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942232755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:35,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464973930] [2025-04-30 10:34:35,517 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:35,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:35,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:35,518 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:35,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-30 10:34:35,574 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 5 equivalence classes. [2025-04-30 10:34:35,657 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:34:35,657 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:34:35,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:35,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-30 10:34:35,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:35,664 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-30 10:34:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:35,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:36,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464973930] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:36,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:36,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2025-04-30 10:34:36,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812067426] [2025-04-30 10:34:36,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:36,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-30 10:34:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:36,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-30 10:34:36,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:34:36,170 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 37 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 37 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:36,463 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2025-04-30 10:34:36,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:34:36,464 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 37 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-04-30 10:34:36,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:36,464 INFO L225 Difference]: With dead ends: 119 [2025-04-30 10:34:36,464 INFO L226 Difference]: Without dead ends: 119 [2025-04-30 10:34:36,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=1939, Unknown=0, NotChecked=0, Total=2256 [2025-04-30 10:34:36,465 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:36,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 398 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-30 10:34:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2025-04-30 10:34:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.099009900990099) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2025-04-30 10:34:36,468 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 50 [2025-04-30 10:34:36,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:36,468 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2025-04-30 10:34:36,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 37 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:36,468 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2025-04-30 10:34:36,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-30 10:34:36,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:36,469 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:36,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-30 10:34:36,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:36,669 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:36,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1320077217, now seen corresponding path program 7 times [2025-04-30 10:34:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:36,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508005286] [2025-04-30 10:34:36,669 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:36,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:34:36,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:34:36,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:36,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:36,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:36,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508005286] [2025-04-30 10:34:36,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508005286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:36,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096734137] [2025-04-30 10:34:36,970 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:36,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:36,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:36,972 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:36,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-30 10:34:37,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:34:37,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:34:37,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:37,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:37,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-30 10:34:37,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:37,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:37,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:37,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:37,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:34:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:37,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096734137] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:37,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 32 [2025-04-30 10:34:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264991320] [2025-04-30 10:34:37,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:37,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:34:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:37,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:34:37,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:34:37,287 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:37,627 INFO L93 Difference]: Finished difference Result 181 states and 194 transitions. [2025-04-30 10:34:37,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:34:37,627 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-04-30 10:34:37,627 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:37,628 INFO L225 Difference]: With dead ends: 181 [2025-04-30 10:34:37,628 INFO L226 Difference]: Without dead ends: 112 [2025-04-30 10:34:37,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1888, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:34:37,628 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 84 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:37,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 725 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-30 10:34:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-04-30 10:34:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0934579439252337) internal successors, (117), 107 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2025-04-30 10:34:37,630 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 55 [2025-04-30 10:34:37,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:37,630 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2025-04-30 10:34:37,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:37,631 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2025-04-30 10:34:37,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:34:37,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:37,631 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:37,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-30 10:34:37,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-30 10:34:37,831 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:37,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1302376633, now seen corresponding path program 8 times [2025-04-30 10:34:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:37,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384042184] [2025-04-30 10:34:37,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:37,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-04-30 10:34:37,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:34:37,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:37,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 61 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:38,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:38,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384042184] [2025-04-30 10:34:38,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384042184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:38,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527289606] [2025-04-30 10:34:38,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:38,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:38,180 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:38,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-30 10:34:38,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-04-30 10:34:38,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:34:38,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:38,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:38,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:34:38,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 51 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:38,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:38,641 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 51 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527289606] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:38,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 36 [2025-04-30 10:34:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324396693] [2025-04-30 10:34:38,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:38,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-30 10:34:38,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:38,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-30 10:34:38,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:34:38,706 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 37 states, 36 states have (on average 3.1944444444444446) internal successors, (115), 37 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:39,138 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2025-04-30 10:34:39,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:34:39,139 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.1944444444444446) internal successors, (115), 37 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-04-30 10:34:39,139 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:39,139 INFO L225 Difference]: With dead ends: 140 [2025-04-30 10:34:39,139 INFO L226 Difference]: Without dead ends: 140 [2025-04-30 10:34:39,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=284, Invalid=2166, Unknown=0, NotChecked=0, Total=2450 [2025-04-30 10:34:39,140 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 124 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:39,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 648 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-04-30 10:34:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2025-04-30 10:34:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.0940170940170941) internal successors, (128), 117 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2025-04-30 10:34:39,142 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 58 [2025-04-30 10:34:39,142 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:39,142 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2025-04-30 10:34:39,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.1944444444444446) internal successors, (115), 37 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:39,143 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2025-04-30 10:34:39,143 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-30 10:34:39,143 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:39,143 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:39,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:39,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-30 10:34:39,345 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:39,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash 961313223, now seen corresponding path program 9 times [2025-04-30 10:34:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:39,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172834970] [2025-04-30 10:34:39,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:39,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:39,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 6 equivalence classes. [2025-04-30 10:34:39,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:34:39,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:34:39,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:39,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172834970] [2025-04-30 10:34:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172834970] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:39,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767057567] [2025-04-30 10:34:39,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:39,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:39,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:39,924 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:39,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-30 10:34:39,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 6 equivalence classes. [2025-04-30 10:34:40,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:34:40,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:34:40,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:40,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-04-30 10:34:40,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:40,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:34:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:40,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:40,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:40,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:34:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:40,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767057567] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:40,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:40,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 58 [2025-04-30 10:34:40,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40110757] [2025-04-30 10:34:40,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:40,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-30 10:34:40,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:40,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-30 10:34:40,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3120, Unknown=0, NotChecked=0, Total=3306 [2025-04-30 10:34:40,890 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 58 states, 58 states have (on average 2.8793103448275863) internal successors, (167), 58 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:42,840 INFO L93 Difference]: Finished difference Result 242 states and 258 transitions. [2025-04-30 10:34:42,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-30 10:34:42,841 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.8793103448275863) internal successors, (167), 58 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-04-30 10:34:42,841 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:42,841 INFO L225 Difference]: With dead ends: 242 [2025-04-30 10:34:42,842 INFO L226 Difference]: Without dead ends: 158 [2025-04-30 10:34:42,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2237 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=718, Invalid=8984, Unknown=0, NotChecked=0, Total=9702 [2025-04-30 10:34:42,843 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 414 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:42,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1158 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:34:42,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-04-30 10:34:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2025-04-30 10:34:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.0902255639097744) internal successors, (145), 133 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2025-04-30 10:34:42,846 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 63 [2025-04-30 10:34:42,846 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:42,846 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2025-04-30 10:34:42,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.8793103448275863) internal successors, (167), 58 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:42,846 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2025-04-30 10:34:42,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-30 10:34:42,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:42,846 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:42,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:43,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:43,047 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:43,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash 166294881, now seen corresponding path program 10 times [2025-04-30 10:34:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:43,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96398994] [2025-04-30 10:34:43,047 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:43,053 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-04-30 10:34:43,062 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 61 of 71 statements. [2025-04-30 10:34:43,062 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 9 proven. 129 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:44,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96398994] [2025-04-30 10:34:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96398994] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:44,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573234477] [2025-04-30 10:34:44,803 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:44,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:44,805 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:44,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-30 10:34:44,873 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-04-30 10:34:44,896 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 61 of 71 statements. [2025-04-30 10:34:44,896 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:44,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:44,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-04-30 10:34:44,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:45,172 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-30 10:34:56,272 INFO L325 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2025-04-30 10:34:56,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 50 [2025-04-30 10:34:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 39 proven. 66 refuted. 33 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:56,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:58,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2025-04-30 10:34:58,410 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:58,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 67 [2025-04-30 10:34:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 87 proven. 51 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:58,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573234477] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:58,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:58,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37, 37] total 105 [2025-04-30 10:34:58,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932021673] [2025-04-30 10:34:58,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:58,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2025-04-30 10:34:58,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:58,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2025-04-30 10:34:58,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=10301, Unknown=34, NotChecked=0, Total=10920 [2025-04-30 10:34:58,945 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 105 states, 105 states have (on average 1.7333333333333334) internal successors, (182), 105 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:35:12,252 INFO L93 Difference]: Finished difference Result 228 states and 246 transitions. [2025-04-30 10:35:12,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-04-30 10:35:12,252 INFO L79 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.7333333333333334) internal successors, (182), 105 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-04-30 10:35:12,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:35:12,252 INFO L225 Difference]: With dead ends: 228 [2025-04-30 10:35:12,253 INFO L226 Difference]: Without dead ends: 154 [2025-04-30 10:35:12,255 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 8477 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=1552, Invalid=30276, Unknown=34, NotChecked=0, Total=31862 [2025-04-30 10:35:12,255 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 140 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 3192 mSolverCounterSat, 5 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3192 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:35:12,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 537 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3192 Invalid, 15 Unknown, 0 Unchecked, 6.5s Time] [2025-04-30 10:35:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-30 10:35:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2025-04-30 10:35:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.087248322147651) internal successors, (162), 149 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2025-04-30 10:35:12,257 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 71 [2025-04-30 10:35:12,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:35:12,257 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2025-04-30 10:35:12,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.7333333333333334) internal successors, (182), 105 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:12,257 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2025-04-30 10:35:12,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-04-30 10:35:12,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:35:12,258 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:12,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-30 10:35:12,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:12,458 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:35:12,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1762070521, now seen corresponding path program 11 times [2025-04-30 10:35:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:12,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488086383] [2025-04-30 10:35:12,459 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:35:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:12,465 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 8 equivalence classes. [2025-04-30 10:35:12,475 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:35:12,475 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-30 10:35:12,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 20 proven. 169 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:12,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:12,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488086383] [2025-04-30 10:35:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488086383] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:12,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105583334] [2025-04-30 10:35:12,921 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:35:12,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:12,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:12,923 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:12,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-30 10:35:12,991 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 8 equivalence classes. [2025-04-30 10:35:13,047 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:35:13,047 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-30 10:35:13,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:13,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-04-30 10:35:13,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:13,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:35:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 20 proven. 169 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:13,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:13,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:35:13,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:35:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 20 proven. 169 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:13,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105583334] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:13,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:13,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 28 [2025-04-30 10:35:13,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703839812] [2025-04-30 10:35:13,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:13,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:35:13,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:13,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:35:13,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:35:13,247 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:35:13,750 INFO L93 Difference]: Finished difference Result 274 states and 293 transitions. [2025-04-30 10:35:13,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-30 10:35:13,751 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-04-30 10:35:13,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:35:13,751 INFO L225 Difference]: With dead ends: 274 [2025-04-30 10:35:13,751 INFO L226 Difference]: Without dead ends: 160 [2025-04-30 10:35:13,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1844, Unknown=0, NotChecked=0, Total=1980 [2025-04-30 10:35:13,752 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 82 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:35:13,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1286 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:35:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-30 10:35:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2025-04-30 10:35:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.0838709677419356) internal successors, (168), 155 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2025-04-30 10:35:13,754 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 79 [2025-04-30 10:35:13,754 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:35:13,754 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2025-04-30 10:35:13,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:13,755 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2025-04-30 10:35:13,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-04-30 10:35:13,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:35:13,755 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:13,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-30 10:35:13,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-30 10:35:13,956 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:35:13,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash 446064045, now seen corresponding path program 12 times [2025-04-30 10:35:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:13,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902757161] [2025-04-30 10:35:13,956 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:35:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:13,962 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 82 statements into 9 equivalence classes. [2025-04-30 10:35:13,981 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 82 of 82 statements. [2025-04-30 10:35:13,981 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-04-30 10:35:13,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 57 proven. 154 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:14,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:14,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902757161] [2025-04-30 10:35:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902757161] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:14,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145825674] [2025-04-30 10:35:14,533 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:35:14,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:14,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:14,535 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:14,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-30 10:35:14,641 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 82 statements into 9 equivalence classes. [2025-04-30 10:35:14,716 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 82 of 82 statements. [2025-04-30 10:35:14,716 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-04-30 10:35:14,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:14,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-04-30 10:35:14,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 70 proven. 141 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:14,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:15,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-30 10:35:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 70 proven. 141 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:15,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145825674] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:15,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:15,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 22] total 50 [2025-04-30 10:35:15,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107235060] [2025-04-30 10:35:15,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:15,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-30 10:35:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:15,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-30 10:35:15,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2240, Unknown=0, NotChecked=0, Total=2550 [2025-04-30 10:35:15,444 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand has 51 states, 50 states have (on average 3.34) internal successors, (167), 51 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:35:16,010 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2025-04-30 10:35:16,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-30 10:35:16,010 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.34) internal successors, (167), 51 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-04-30 10:35:16,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:35:16,011 INFO L225 Difference]: With dead ends: 203 [2025-04-30 10:35:16,011 INFO L226 Difference]: Without dead ends: 203 [2025-04-30 10:35:16,011 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 129 SyntacticMatches, 9 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1909 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=691, Invalid=4139, Unknown=0, NotChecked=0, Total=4830 [2025-04-30 10:35:16,011 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 309 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:35:16,012 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 317 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:35:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-04-30 10:35:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 166. [2025-04-30 10:35:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.084848484848485) internal successors, (179), 165 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2025-04-30 10:35:16,015 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 82 [2025-04-30 10:35:16,015 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:35:16,015 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2025-04-30 10:35:16,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.34) internal successors, (167), 51 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:16,015 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2025-04-30 10:35:16,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-04-30 10:35:16,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:35:16,016 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:16,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-30 10:35:16,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-30 10:35:16,216 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:35:16,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:16,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1809747167, now seen corresponding path program 13 times [2025-04-30 10:35:16,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:16,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26364485] [2025-04-30 10:35:16,217 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:35:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:16,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-30 10:35:16,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-30 10:35:16,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:16,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 23 proven. 225 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:16,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:16,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26364485] [2025-04-30 10:35:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26364485] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:16,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002394795] [2025-04-30 10:35:16,826 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:35:16,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:16,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:16,829 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:16,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-30 10:35:16,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-30 10:35:16,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-30 10:35:16,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:16,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:16,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-04-30 10:35:16,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:17,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:35:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 23 proven. 225 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:17,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:17,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:35:17,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:35:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 23 proven. 225 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:17,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002394795] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:17,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:17,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 44 [2025-04-30 10:35:17,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274849748] [2025-04-30 10:35:17,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:17,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-30 10:35:17,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:17,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-30 10:35:17,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2025-04-30 10:35:17,366 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:35:18,226 INFO L93 Difference]: Finished difference Result 305 states and 326 transitions. [2025-04-30 10:35:18,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-30 10:35:18,226 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-04-30 10:35:18,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:35:18,227 INFO L225 Difference]: With dead ends: 305 [2025-04-30 10:35:18,227 INFO L226 Difference]: Without dead ends: 176 [2025-04-30 10:35:18,227 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=262, Invalid=4028, Unknown=0, NotChecked=0, Total=4290 [2025-04-30 10:35:18,228 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 99 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:35:18,228 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 2280 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:35:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-30 10:35:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2025-04-30 10:35:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.0818713450292399) internal successors, (185), 171 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2025-04-30 10:35:18,230 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 87 [2025-04-30 10:35:18,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:35:18,230 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2025-04-30 10:35:18,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:18,231 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2025-04-30 10:35:18,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-04-30 10:35:18,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:35:18,231 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:18,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-30 10:35:18,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-30 10:35:18,432 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:35:18,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:18,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1780882745, now seen corresponding path program 14 times [2025-04-30 10:35:18,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:18,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011022448] [2025-04-30 10:35:18,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:18,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-04-30 10:35:18,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-04-30 10:35:18,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:35:18,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 70 proven. 203 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:19,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:19,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011022448] [2025-04-30 10:35:19,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011022448] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:19,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448080294] [2025-04-30 10:35:19,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:35:19,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:19,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:19,004 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:19,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-30 10:35:19,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-04-30 10:35:19,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-04-30 10:35:19,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:35:19,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:19,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-30 10:35:19,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 92 proven. 181 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:19,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:35:19,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:35:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 92 proven. 181 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:19,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448080294] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:35:19,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:35:19,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 52 [2025-04-30 10:35:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414062850] [2025-04-30 10:35:19,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:35:19,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-30 10:35:19,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:19,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-30 10:35:19,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2465, Unknown=0, NotChecked=0, Total=2756 [2025-04-30 10:35:19,970 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 53 states, 52 states have (on average 3.4423076923076925) internal successors, (179), 53 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:35:20,724 INFO L93 Difference]: Finished difference Result 224 states and 238 transitions. [2025-04-30 10:35:20,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-30 10:35:20,725 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.4423076923076925) internal successors, (179), 53 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-04-30 10:35:20,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:35:20,726 INFO L225 Difference]: With dead ends: 224 [2025-04-30 10:35:20,726 INFO L226 Difference]: Without dead ends: 224 [2025-04-30 10:35:20,727 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 142 SyntacticMatches, 10 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1888 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=560, Invalid=4842, Unknown=0, NotChecked=0, Total=5402 [2025-04-30 10:35:20,727 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 183 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:35:20,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1155 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:35:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-04-30 10:35:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 182. [2025-04-30 10:35:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.0828729281767955) internal successors, (196), 181 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2025-04-30 10:35:20,730 INFO L79 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 90 [2025-04-30 10:35:20,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:35:20,730 INFO L485 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2025-04-30 10:35:20,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.4423076923076925) internal successors, (179), 53 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:35:20,730 INFO L278 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2025-04-30 10:35:20,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-04-30 10:35:20,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:35:20,731 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:20,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-30 10:35:20,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-30 10:35:20,932 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:35:20,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 618796615, now seen corresponding path program 15 times [2025-04-30 10:35:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:20,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971520229] [2025-04-30 10:35:20,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:35:20,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:20,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 10 equivalence classes. [2025-04-30 10:35:20,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 95 of 95 statements. [2025-04-30 10:35:20,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-04-30 10:35:20,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-04-30 10:35:21,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:21,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971520229] [2025-04-30 10:35:21,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971520229] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:21,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876828227] [2025-04-30 10:35:21,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:35:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:21,401 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:21,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-30 10:35:21,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 10 equivalence classes. [2025-04-30 10:35:21,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 95 of 95 statements. [2025-04-30 10:35:21,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-04-30 10:35:21,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:21,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-04-30 10:35:21,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:35:21,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:35:22,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-30 10:35:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 26 proven. 289 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:35:22,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15