./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/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/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 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:33:01,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:33:01,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:33:01,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:33:01,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:33:01,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:33:01,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:33:01,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:33:01,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:33:01,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:33:01,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:33:01,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:33:01,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:33:01,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:33:01,936 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:33:01,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:33:01,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:33:01,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:33:01,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:33:01,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:33:01,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:33:01,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:33:01,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:33:01,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:33:01,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:01,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:33:01,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:33:01,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:33:01,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:33:01,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:01,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:33:01,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:33:01,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:33:01,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:33:01,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:33:01,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:33:01,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:33:01,939 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 -> 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 [2025-04-30 10:33:02,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:33:02,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:33:02,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:33:02,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:33:02,149 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:33:02,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca-2.i [2025-04-30 10:33:03,388 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df36c3df0/432b6d8bebee494f9e29e7f69b0bd85c/FLAG973e59ee2 [2025-04-30 10:33:03,643 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:33:03,643 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca-2.i [2025-04-30 10:33:03,653 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df36c3df0/432b6d8bebee494f9e29e7f69b0bd85c/FLAG973e59ee2 [2025-04-30 10:33:04,439 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df36c3df0/432b6d8bebee494f9e29e7f69b0bd85c [2025-04-30 10:33:04,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:33:04,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:33:04,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:04,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:33:04,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:33:04,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,448 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:33:04, skipping insertion in model container [2025-04-30 10:33:04,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:33:04,736 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:33:04,737 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:33:04,741 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:04,748 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:33:04,784 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:04,800 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:33:04,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04 WrapperNode [2025-04-30 10:33:04,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:04,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:04,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:33:04,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:33:04,806 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:33:04" (1/1) ... [2025-04-30 10:33:04,818 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:33:04" (1/1) ... [2025-04-30 10:33:04,831 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2025-04-30 10:33:04,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:04,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:33:04,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:33:04,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:33:04,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,857 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 56 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:33:04,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:33:04,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:33:04,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:33:04,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:33:04,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (1/1) ... [2025-04-30 10:33:04,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:04,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:04,899 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:33:04,901 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:33:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:33:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:33:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:33:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:33:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:33:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:33:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:33:04,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:33:04,995 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:33:04,996 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:33:05,167 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-04-30 10:33:05,167 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:33:05,176 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:33:05,177 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:33:05,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:05 BoogieIcfgContainer [2025-04-30 10:33:05,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:33:05,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:33:05,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:33:05,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:33:05,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:33:04" (1/3) ... [2025-04-30 10:33:05,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6cc7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:05, skipping insertion in model container [2025-04-30 10:33:05,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:04" (2/3) ... [2025-04-30 10:33:05,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6cc7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:05, skipping insertion in model container [2025-04-30 10:33:05,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:05" (3/3) ... [2025-04-30 10:33:05,187 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2025-04-30 10:33:05,198 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:33:05,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrpbrk-alloca-2.i that has 1 procedures, 52 locations, 61 edges, 1 initial locations, 4 loop locations, and 19 error locations. [2025-04-30 10:33:05,231 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:33:05,242 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;@676798c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:33:05,243 INFO L341 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-04-30 10:33:05,247 INFO L278 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.90625) internal successors, (61), 51 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:33:05,250 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:05,250 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:05,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:05,251 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:05,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-30 10:33:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:05,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254689860] [2025-04-30 10:33:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:05,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:05,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:05,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:05,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:05,440 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:33:05,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:05,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254689860] [2025-04-30 10:33:05,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254689860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:05,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:05,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:05,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340941897] [2025-04-30 10:33:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:05,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:05,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:05,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:05,464 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.90625) internal successors, (61), 51 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) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:33:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:05,507 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-04-30 10:33:05,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:05,509 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:33:05,509 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:05,513 INFO L225 Difference]: With dead ends: 62 [2025-04-30 10:33:05,513 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:33:05,515 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:33:05,517 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:05,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:33:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2025-04-30 10:33:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.7941176470588236) 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:33:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-04-30 10:33:05,540 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 7 [2025-04-30 10:33:05,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:05,541 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-04-30 10:33:05,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:33:05,541 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-04-30 10:33:05,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:05,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:05,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:05,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:33:05,541 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:05,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876010, now seen corresponding path program 1 times [2025-04-30 10:33:05,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:05,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438720783] [2025-04-30 10:33:05,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:05,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:05,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:05,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:05,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:05,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:05,655 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:33:05,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:05,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438720783] [2025-04-30 10:33:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438720783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:05,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:05,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:33:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029716142] [2025-04-30 10:33:05,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:05,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:33:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:05,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:33:05,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:33:05,657 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:05,712 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2025-04-30 10:33:05,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:33:05,713 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:33:05,713 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:05,713 INFO L225 Difference]: With dead ends: 51 [2025-04-30 10:33:05,713 INFO L226 Difference]: Without dead ends: 51 [2025-04-30 10:33:05,715 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:33:05,716 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:05,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 69 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-30 10:33:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-30 10:33:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 50 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:33:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-04-30 10:33:05,720 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 7 [2025-04-30 10:33:05,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:05,720 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-04-30 10:33:05,720 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:33:05,720 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-04-30 10:33:05,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:05,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:05,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:05,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:33:05,722 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:05,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:05,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876011, now seen corresponding path program 1 times [2025-04-30 10:33:05,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:05,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340891865] [2025-04-30 10:33:05,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:05,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:05,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:05,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:05,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:05,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:05,955 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:33:05,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:05,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340891865] [2025-04-30 10:33:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340891865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986072581] [2025-04-30 10:33:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:05,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:05,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:05,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:05,958 INFO L87 Difference]: Start difference. First operand 51 states and 59 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:33:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,040 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-04-30 10:33:06,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:06,044 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:33:06,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,045 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:33:06,045 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:33:06,045 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:06,046 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:33:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-04-30 10:33:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 52 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:33:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-04-30 10:33:06,053 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 7 [2025-04-30 10:33:06,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,053 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-04-30 10:33:06,053 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:33:06,054 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-04-30 10:33:06,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:33:06,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:33:06,054 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:06,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,054 INFO L85 PathProgramCache]: Analyzing trace with hash 121329398, now seen corresponding path program 1 times [2025-04-30 10:33:06,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655550523] [2025-04-30 10:33:06,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:33:06,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:33:06,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,194 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:33:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655550523] [2025-04-30 10:33:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655550523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056061167] [2025-04-30 10:33:06,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,196 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:06,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:06,197 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,226 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-04-30 10:33:06,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:06,228 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-30 10:33:06,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,229 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:33:06,229 INFO L226 Difference]: Without dead ends: 59 [2025-04-30 10:33:06,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:33:06,229 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-30 10:33:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-04-30 10:33:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.725) internal successors, (69), 56 states have internal predecessors, (69), 0 states have call successors, (0), 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:33:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-04-30 10:33:06,236 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 8 [2025-04-30 10:33:06,237 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,237 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-04-30 10:33:06,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,237 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-04-30 10:33:06,237 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:33:06,237 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:33:06,238 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:06,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash 121329206, now seen corresponding path program 1 times [2025-04-30 10:33:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991098452] [2025-04-30 10:33:06,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:33:06,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:33:06,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,277 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:33:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991098452] [2025-04-30 10:33:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991098452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:06,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367887982] [2025-04-30 10:33:06,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:06,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:06,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:06,280 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,306 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2025-04-30 10:33:06,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:06,306 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-30 10:33:06,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,307 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:33:06,308 INFO L226 Difference]: Without dead ends: 73 [2025-04-30 10:33:06,308 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:33:06,308 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,309 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 141 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-30 10:33:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-04-30 10:33:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.64) internal successors, (82), 66 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:33:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-04-30 10:33:06,316 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 8 [2025-04-30 10:33:06,316 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,316 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-04-30 10:33:06,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,317 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-04-30 10:33:06,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:33:06,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:33:06,318 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:06,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash 123176248, now seen corresponding path program 1 times [2025-04-30 10:33:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760008827] [2025-04-30 10:33:06,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:33:06,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:33:06,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,444 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:33:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760008827] [2025-04-30 10:33:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760008827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:06,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435905442] [2025-04-30 10:33:06,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:06,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:06,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:06,446 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,505 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2025-04-30 10:33:06,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:33:06,506 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-30 10:33:06,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,507 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:33:06,507 INFO L226 Difference]: Without dead ends: 73 [2025-04-30 10:33:06,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:06,509 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,509 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 102 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-30 10:33:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-04-30 10:33:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 70 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:33:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2025-04-30 10:33:06,512 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 8 [2025-04-30 10:33:06,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,512 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2025-04-30 10:33:06,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,512 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2025-04-30 10:33:06,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:33:06,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:33:06,513 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:06,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,513 INFO L85 PathProgramCache]: Analyzing trace with hash 123176247, now seen corresponding path program 1 times [2025-04-30 10:33:06,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864381314] [2025-04-30 10:33:06,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:33:06,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:33:06,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,533 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:33:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864381314] [2025-04-30 10:33:06,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864381314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:33:06,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733324458] [2025-04-30 10:33:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:33:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:33:06,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:33:06,534 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,557 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-04-30 10:33:06,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:33:06,557 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-30 10:33:06,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,558 INFO L225 Difference]: With dead ends: 69 [2025-04-30 10:33:06,558 INFO L226 Difference]: Without dead ends: 69 [2025-04-30 10:33:06,558 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:33:06,559 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,559 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 69 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-30 10:33:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-04-30 10:33:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 68 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:33:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-04-30 10:33:06,562 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2025-04-30 10:33:06,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,562 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-04-30 10:33:06,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,562 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-04-30 10:33:06,562 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:33:06,562 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:33:06,563 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:06,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash 178587700, now seen corresponding path program 1 times [2025-04-30 10:33:06,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524054958] [2025-04-30 10:33:06,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:33:06,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:33:06,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,702 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:33:06,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524054958] [2025-04-30 10:33:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524054958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:06,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164148597] [2025-04-30 10:33:06,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:06,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:06,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:06,705 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,754 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2025-04-30 10:33:06,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:06,754 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-04-30 10:33:06,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,755 INFO L225 Difference]: With dead ends: 79 [2025-04-30 10:33:06,755 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:33:06,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:06,756 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 106 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:33:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2025-04-30 10:33:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 68 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:33:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-04-30 10:33:06,761 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2025-04-30 10:33:06,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,761 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-04-30 10:33:06,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:06,761 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-04-30 10:33:06,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:33:06,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:33:06,762 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:06,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash -533755979, now seen corresponding path program 1 times [2025-04-30 10:33:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006814217] [2025-04-30 10:33:06,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:33:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:33:06,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,848 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:33:06,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006814217] [2025-04-30 10:33:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006814217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161743938] [2025-04-30 10:33:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:06,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:06,850 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,867 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2025-04-30 10:33:06,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:06,867 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:33:06,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,868 INFO L225 Difference]: With dead ends: 74 [2025-04-30 10:33:06,868 INFO L226 Difference]: Without dead ends: 74 [2025-04-30 10:33:06,868 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:33:06,868 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,869 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-30 10:33:06,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-04-30 10:33:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 71 states have internal predecessors, (89), 0 states have call successors, (0), 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:33:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2025-04-30 10:33:06,871 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 9 [2025-04-30 10:33:06,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,872 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2025-04-30 10:33:06,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,872 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2025-04-30 10:33:06,872 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:33:06,872 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:33:06,872 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:06,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash -476497677, now seen corresponding path program 1 times [2025-04-30 10:33:06,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535874986] [2025-04-30 10:33:06,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:33:06,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:33:06,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:06,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:06,948 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:33:06,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:06,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535874986] [2025-04-30 10:33:06,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535874986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:06,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:06,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824459014] [2025-04-30 10:33:06,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:06,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:06,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:06,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:06,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:06,949 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:06,985 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-04-30 10:33:06,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:06,985 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:33:06,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:06,985 INFO L225 Difference]: With dead ends: 71 [2025-04-30 10:33:06,986 INFO L226 Difference]: Without dead ends: 71 [2025-04-30 10:33:06,986 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:06,986 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:06,986 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-30 10:33:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2025-04-30 10:33:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 67 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:33:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2025-04-30 10:33:06,989 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 9 [2025-04-30 10:33:06,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:06,989 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2025-04-30 10:33:06,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:06,990 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2025-04-30 10:33:06,991 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:33:06,991 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:06,991 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:06,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:33:06,991 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:06,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash -181913935, now seen corresponding path program 1 times [2025-04-30 10:33:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:06,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539960902] [2025-04-30 10:33:06,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:06,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:07,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:07,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:07,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:07,154 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:33:07,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:07,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539960902] [2025-04-30 10:33:07,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539960902] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:07,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473901254] [2025-04-30 10:33:07,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:07,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:07,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:07,157 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:33:07,158 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:33:07,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:07,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:07,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:07,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:07,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:33:07,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:07,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:33:07,263 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:33:07,270 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:33:07,398 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:33:07,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:07,536 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:33:07,551 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:33:07,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473901254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:07,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:07,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-30 10:33:07,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871847023] [2025-04-30 10:33:07,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:07,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:33:07,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:07,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:33:07,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:33:07,553 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:07,768 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-04-30 10:33:07,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:07,768 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:33:07,768 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:07,769 INFO L225 Difference]: With dead ends: 71 [2025-04-30 10:33:07,769 INFO L226 Difference]: Without dead ends: 71 [2025-04-30 10:33:07,769 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:33:07,770 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:07,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 326 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-30 10:33:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-04-30 10:33:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 64 states have internal predecessors, (80), 0 states have call successors, (0), 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:33:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-04-30 10:33:07,775 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 10 [2025-04-30 10:33:07,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:07,775 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-04-30 10:33:07,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:07,775 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-04-30 10:33:07,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:07,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:07,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:07,782 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:33:07,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:33:07,976 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:07,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1838388167, now seen corresponding path program 1 times [2025-04-30 10:33:07,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:07,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883656800] [2025-04-30 10:33:07,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:07,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:07,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:07,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:07,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:07,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:08,073 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:33:08,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:08,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883656800] [2025-04-30 10:33:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883656800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:08,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:08,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:08,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116959696] [2025-04-30 10:33:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:08,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:08,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:08,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:08,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:08,074 INFO L87 Difference]: Start difference. First operand 65 states and 80 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:33:08,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:08,146 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2025-04-30 10:33:08,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:33:08,146 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:33:08,147 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:08,147 INFO L225 Difference]: With dead ends: 90 [2025-04-30 10:33:08,147 INFO L226 Difference]: Without dead ends: 90 [2025-04-30 10:33:08,147 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:08,148 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:08,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 110 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-30 10:33:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 69. [2025-04-30 10:33:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 68 states have internal predecessors, (87), 0 states have call successors, (0), 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:33:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2025-04-30 10:33:08,153 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 11 [2025-04-30 10:33:08,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:08,153 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-04-30 10:33:08,153 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:33:08,153 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2025-04-30 10:33:08,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:08,153 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:08,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:08,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:33:08,154 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:08,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1838388168, now seen corresponding path program 1 times [2025-04-30 10:33:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:08,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972932064] [2025-04-30 10:33:08,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:08,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:08,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:08,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:08,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:08,191 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:33:08,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:08,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972932064] [2025-04-30 10:33:08,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972932064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:08,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:08,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852627393] [2025-04-30 10:33:08,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:08,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:08,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:08,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:08,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:08,193 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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:33:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:08,230 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2025-04-30 10:33:08,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:08,230 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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:33:08,231 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:08,231 INFO L225 Difference]: With dead ends: 68 [2025-04-30 10:33:08,231 INFO L226 Difference]: Without dead ends: 68 [2025-04-30 10:33:08,231 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:08,232 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 32 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:08,232 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 60 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-30 10:33:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-04-30 10:33:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 66 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:33:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2025-04-30 10:33:08,233 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 11 [2025-04-30 10:33:08,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:08,234 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2025-04-30 10:33:08,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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:33:08,234 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2025-04-30 10:33:08,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:08,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:08,234 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:08,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:33:08,234 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:08,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:08,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1641506446, now seen corresponding path program 1 times [2025-04-30 10:33:08,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:08,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876333510] [2025-04-30 10:33:08,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:08,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:08,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:08,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:08,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:08,408 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:33:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:08,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876333510] [2025-04-30 10:33:08,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876333510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:08,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099703451] [2025-04-30 10:33:08,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:08,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:08,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:08,410 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:33:08,413 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:33:08,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:08,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:08,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:08,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:08,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:33:08,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:08,481 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:33:08,489 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:33:08,632 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:33:08,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:08,771 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:33:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099703451] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:08,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:08,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-04-30 10:33:08,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864322825] [2025-04-30 10:33:08,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:08,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:33:08,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:08,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:33:08,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:33:08,773 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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:33:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:08,968 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2025-04-30 10:33:08,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:33:08,969 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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 11 [2025-04-30 10:33:08,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:08,969 INFO L225 Difference]: With dead ends: 70 [2025-04-30 10:33:08,970 INFO L226 Difference]: Without dead ends: 70 [2025-04-30 10:33:08,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:33:08,970 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:08,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 234 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-30 10:33:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2025-04-30 10:33:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 61 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:33:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2025-04-30 10:33:08,973 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 11 [2025-04-30 10:33:08,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:08,973 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2025-04-30 10:33:08,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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:33:08,973 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2025-04-30 10:33:08,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:33:08,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:08,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:08,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:09,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-30 10:33:09,176 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:09,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1344358482, now seen corresponding path program 1 times [2025-04-30 10:33:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:09,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098130924] [2025-04-30 10:33:09,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:09,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:33:09,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:33:09,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:09,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:09,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098130924] [2025-04-30 10:33:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098130924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:09,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:09,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:33:09,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067267618] [2025-04-30 10:33:09,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:09,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:33:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:09,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:33:09,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:09,327 INFO L87 Difference]: Start difference. First operand 62 states and 75 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:33:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:09,344 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2025-04-30 10:33:09,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:33:09,345 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:33:09,345 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:09,345 INFO L225 Difference]: With dead ends: 61 [2025-04-30 10:33:09,346 INFO L226 Difference]: Without dead ends: 61 [2025-04-30 10:33:09,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:09,346 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:09,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 76 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-30 10:33:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2025-04-30 10:33:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 53 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:33:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-04-30 10:33:09,349 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 11 [2025-04-30 10:33:09,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:09,349 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-04-30 10:33:09,349 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:33:09,349 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-04-30 10:33:09,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:33:09,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:09,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:09,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:33:09,349 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:09,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1903627462, now seen corresponding path program 1 times [2025-04-30 10:33:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:09,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388514914] [2025-04-30 10:33:09,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:09,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:33:09,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:33:09,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:09,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:09,430 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:33:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:09,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388514914] [2025-04-30 10:33:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388514914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:09,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:09,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:09,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107492289] [2025-04-30 10:33:09,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:09,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:09,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:09,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:09,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:09,431 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:33:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:09,452 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-04-30 10:33:09,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:09,452 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:33:09,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:09,452 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:33:09,453 INFO L226 Difference]: Without dead ends: 50 [2025-04-30 10:33:09,453 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:33:09,453 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:09,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-30 10:33:09,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-30 10:33:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.380952380952381) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 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:33:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-04-30 10:33:09,456 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 15 [2025-04-30 10:33:09,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:09,456 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-04-30 10:33:09,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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:33:09,456 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-04-30 10:33:09,457 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:09,457 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:09,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:09,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:33:09,457 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:09,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1120262430, now seen corresponding path program 1 times [2025-04-30 10:33:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:09,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802088965] [2025-04-30 10:33:09,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:09,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:09,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:09,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:09,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:09,500 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:33:09,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:09,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802088965] [2025-04-30 10:33:09,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802088965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:09,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:09,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110510048] [2025-04-30 10:33:09,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:09,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:09,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:09,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:09,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:09,501 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:09,534 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-04-30 10:33:09,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:09,535 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:33:09,535 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:09,535 INFO L225 Difference]: With dead ends: 47 [2025-04-30 10:33:09,535 INFO L226 Difference]: Without dead ends: 47 [2025-04-30 10:33:09,535 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:33:09,536 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:09,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:09,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-30 10:33:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-04-30 10:33:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 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:33:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-04-30 10:33:09,537 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 16 [2025-04-30 10:33:09,537 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:09,537 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-04-30 10:33:09,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,537 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-04-30 10:33:09,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:09,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:09,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:09,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:33:09,538 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:09,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1120262429, now seen corresponding path program 1 times [2025-04-30 10:33:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:09,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604674780] [2025-04-30 10:33:09,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:09,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:09,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:09,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:09,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:09,648 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:33:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:09,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604674780] [2025-04-30 10:33:09,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604674780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:09,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:09,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:33:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829748157] [2025-04-30 10:33:09,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:09,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:33:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:09,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:33:09,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:09,649 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:09,723 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-04-30 10:33:09,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:09,723 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:33:09,723 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:09,724 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:33:09,724 INFO L226 Difference]: Without dead ends: 59 [2025-04-30 10:33:09,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:33:09,724 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 54 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:09,724 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 76 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-30 10:33:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2025-04-30 10:33:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 53 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:33:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-04-30 10:33:09,725 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 16 [2025-04-30 10:33:09,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:09,725 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-04-30 10:33:09,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,726 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-04-30 10:33:09,726 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:33:09,726 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:09,726 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] [2025-04-30 10:33:09,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:33:09,726 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:09,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash -756721741, now seen corresponding path program 1 times [2025-04-30 10:33:09,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:09,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756202430] [2025-04-30 10:33:09,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:09,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:33:09,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:33:09,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:09,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:09,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756202430] [2025-04-30 10:33:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756202430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:09,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:09,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985438429] [2025-04-30 10:33:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:09,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:33:09,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:09,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:33:09,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:33:09,753 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:09,758 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-04-30 10:33:09,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:33:09,758 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-30 10:33:09,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:09,759 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:33:09,759 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:33:09,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:33:09,759 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:09,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:33:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-30 10:33:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 55 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:33:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-04-30 10:33:09,762 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2025-04-30 10:33:09,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:09,762 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-04-30 10:33:09,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,763 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-04-30 10:33:09,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:33:09,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:09,763 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] [2025-04-30 10:33:09,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:33:09,763 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:09,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1983473118, now seen corresponding path program 1 times [2025-04-30 10:33:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:09,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301991013] [2025-04-30 10:33:09,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:09,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:33:09,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:33:09,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:09,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:09,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301991013] [2025-04-30 10:33:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301991013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:09,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:09,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:33:09,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727535214] [2025-04-30 10:33:09,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:09,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:33:09,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:09,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:33:09,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:33:09,860 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:09,962 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-04-30 10:33:09,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:33:09,963 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-30 10:33:09,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:09,963 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:33:09,963 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:33:09,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:33:09,964 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:09,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:33:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-30 10:33:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 55 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:33:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-04-30 10:33:09,968 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 22 [2025-04-30 10:33:09,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:09,969 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-04-30 10:33:09,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:09,969 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-04-30 10:33:09,969 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:33:09,969 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:09,969 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:33:09,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:33:09,969 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:09,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1540488490, now seen corresponding path program 1 times [2025-04-30 10:33:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:09,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11084406] [2025-04-30 10:33:09,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:09,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:09,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:33:09,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:33:09,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:09,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:10,079 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:33:10,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:10,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11084406] [2025-04-30 10:33:10,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11084406] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:33:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17033180] [2025-04-30 10:33:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:10,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:33:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:10,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:33:10,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:10,081 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:33:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:10,109 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-04-30 10:33:10,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:33:10,109 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:33:10,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:10,110 INFO L225 Difference]: With dead ends: 65 [2025-04-30 10:33:10,110 INFO L226 Difference]: Without dead ends: 51 [2025-04-30 10:33:10,110 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:33:10,110 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:10,110 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 159 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-30 10:33:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-30 10:33:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 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:33:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-04-30 10:33:10,112 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 23 [2025-04-30 10:33:10,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:10,112 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-04-30 10:33:10,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:33:10,112 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-04-30 10:33:10,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:33:10,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:10,113 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:33:10,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:33:10,113 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:10,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1117786664, now seen corresponding path program 1 times [2025-04-30 10:33:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:10,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334901635] [2025-04-30 10:33:10,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:10,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:33:10,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:33:10,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:10,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:10,265 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:33:10,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:10,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334901635] [2025-04-30 10:33:10,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334901635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:10,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:10,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:33:10,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792925731] [2025-04-30 10:33:10,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:10,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:33:10,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:10,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:33:10,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:33:10,267 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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:33:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:10,303 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2025-04-30 10:33:10,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:10,303 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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:33:10,303 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:10,303 INFO L225 Difference]: With dead ends: 66 [2025-04-30 10:33:10,303 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:33:10,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:33:10,305 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:10,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 141 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:33:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-04-30 10:33:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.25) internal successors, (60), 52 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:33:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-04-30 10:33:10,306 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 23 [2025-04-30 10:33:10,306 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:10,306 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-04-30 10:33:10,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 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:33:10,307 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-04-30 10:33:10,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:33:10,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:10,307 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, 1, 1, 1] [2025-04-30 10:33:10,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:33:10,307 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:10,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 355867422, now seen corresponding path program 1 times [2025-04-30 10:33:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:10,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607294087] [2025-04-30 10:33:10,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:10,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:10,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:33:10,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:33:10,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:10,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:10,441 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:33:10,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:10,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607294087] [2025-04-30 10:33:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607294087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:10,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:10,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:33:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54539469] [2025-04-30 10:33:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:10,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:33:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:10,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:33:10,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:33:10,443 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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:33:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:10,503 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2025-04-30 10:33:10,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:33:10,504 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-30 10:33:10,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:10,504 INFO L225 Difference]: With dead ends: 64 [2025-04-30 10:33:10,504 INFO L226 Difference]: Without dead ends: 47 [2025-04-30 10:33:10,504 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:33:10,505 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:10,505 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 194 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-30 10:33:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-04-30 10:33:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) 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:33:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-04-30 10:33:10,506 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2025-04-30 10:33:10,506 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:10,506 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-04-30 10:33:10,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 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:33:10,506 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-04-30 10:33:10,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:33:10,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:10,507 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, 1, 1, 1] [2025-04-30 10:33:10,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:33:10,507 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:10,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1449570912, now seen corresponding path program 1 times [2025-04-30 10:33:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:10,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991951027] [2025-04-30 10:33:10,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:10,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:33:10,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:33:10,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:10,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:10,668 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:33:10,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:10,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991951027] [2025-04-30 10:33:10,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991951027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:10,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:10,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:33:10,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019902844] [2025-04-30 10:33:10,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:10,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:33:10,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:10,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:33:10,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:33:10,669 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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:33:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:10,741 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2025-04-30 10:33:10,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:33:10,742 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-30 10:33:10,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:10,742 INFO L225 Difference]: With dead ends: 61 [2025-04-30 10:33:10,742 INFO L226 Difference]: Without dead ends: 50 [2025-04-30 10:33:10,742 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:33:10,743 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:10,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 191 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-30 10:33:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-04-30 10:33:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 47 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:33:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-04-30 10:33:10,744 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 26 [2025-04-30 10:33:10,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:10,745 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-04-30 10:33:10,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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:33:10,745 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-04-30 10:33:10,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:33:10,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:10,745 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, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:10,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:33:10,745 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:10,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash -228241934, now seen corresponding path program 1 times [2025-04-30 10:33:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:10,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238302130] [2025-04-30 10:33:10,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:10,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:33:10,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:33:10,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:10,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:10,904 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:33:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:10,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238302130] [2025-04-30 10:33:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238302130] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:10,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268797456] [2025-04-30 10:33:10,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:10,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:10,907 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:33:10,908 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:33:10,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:33:10,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:33:10,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:10,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:10,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:33:10,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:10,976 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 1 [2025-04-30 10:33:11,097 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:33:11,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:11,305 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:33:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268797456] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:11,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-04-30 10:33:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596461846] [2025-04-30 10:33:11,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:11,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:33:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:11,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:33:11,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:33:11,308 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 23 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 23 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:33:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:11,458 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-04-30 10:33:11,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:33:11,459 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 23 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) Word has length 29 [2025-04-30 10:33:11,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:11,460 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:33:11,460 INFO L226 Difference]: Without dead ends: 55 [2025-04-30 10:33:11,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:33:11,460 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 72 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:11,460 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 188 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-30 10:33:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2025-04-30 10:33:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 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:33:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-04-30 10:33:11,461 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 29 [2025-04-30 10:33:11,461 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:11,461 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-04-30 10:33:11,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 23 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:33:11,462 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-04-30 10:33:11,462 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:33:11,462 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:11,462 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:11,468 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:33:11,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:11,662 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:11,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1514499011, now seen corresponding path program 1 times [2025-04-30 10:33:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:11,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20994726] [2025-04-30 10:33:11,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:11,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:33:11,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:33:11,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:11,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:11,779 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:33:11,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:11,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20994726] [2025-04-30 10:33:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20994726] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:11,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604979213] [2025-04-30 10:33:11,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:11,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:11,782 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:33:11,783 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:33:11,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:33:11,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:33:11,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:11,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:11,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-30 10:33:11,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:11,931 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:33:11,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:12,065 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:33:12,084 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:33:12,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604979213] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:12,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:12,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-30 10:33:12,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552242113] [2025-04-30 10:33:12,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:12,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:33:12,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:12,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:33:12,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:33:12,086 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 16 states have (on average 4.5) internal successors, (72), 17 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:33:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:12,204 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2025-04-30 10:33:12,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:33:12,205 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.5) internal successors, (72), 17 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) Word has length 30 [2025-04-30 10:33:12,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:12,205 INFO L225 Difference]: With dead ends: 88 [2025-04-30 10:33:12,205 INFO L226 Difference]: Without dead ends: 88 [2025-04-30 10:33:12,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:33:12,205 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 43 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:12,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 225 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-30 10:33:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 63. [2025-04-30 10:33:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 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:33:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2025-04-30 10:33:12,207 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 30 [2025-04-30 10:33:12,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:12,207 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2025-04-30 10:33:12,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.5) internal successors, (72), 17 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:33:12,207 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2025-04-30 10:33:12,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:33:12,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:12,207 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, 1, 1] [2025-04-30 10:33:12,217 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:33:12,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-30 10:33:12,412 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:12,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1129669401, now seen corresponding path program 2 times [2025-04-30 10:33:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:12,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138149424] [2025-04-30 10:33:12,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:12,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:33:12,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:33:12,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:12,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:12,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:12,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138149424] [2025-04-30 10:33:12,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138149424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:12,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561521571] [2025-04-30 10:33:12,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:12,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:12,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:12,718 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:33:12,719 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:33:12,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:33:12,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:33:12,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:12,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:12,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-30 10:33:12,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:12,845 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:33:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:12,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:12,953 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:33:12,955 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:33:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561521571] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:12,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:12,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 26 [2025-04-30 10:33:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758837644] [2025-04-30 10:33:12,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:12,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:33:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:12,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:33:12,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:33:12,996 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 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:33:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:13,167 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2025-04-30 10:33:13,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:33:13,167 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 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 36 [2025-04-30 10:33:13,168 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:13,168 INFO L225 Difference]: With dead ends: 107 [2025-04-30 10:33:13,168 INFO L226 Difference]: Without dead ends: 99 [2025-04-30 10:33:13,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:33:13,169 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:13,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 264 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-30 10:33:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-04-30 10:33:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 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:33:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-04-30 10:33:13,171 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 36 [2025-04-30 10:33:13,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:13,171 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-04-30 10:33:13,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 26 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:33:13,171 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-04-30 10:33:13,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:33:13,172 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:13,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:13,178 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:33:13,375 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,SelfDestructingSolverStorable26 [2025-04-30 10:33:13,376 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:13,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash 666361529, now seen corresponding path program 3 times [2025-04-30 10:33:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:13,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518587714] [2025-04-30 10:33:13,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:13,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-04-30 10:33:13,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:33:13,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:33:13,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:13,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:13,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518587714] [2025-04-30 10:33:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518587714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:13,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210335625] [2025-04-30 10:33:13,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:13,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:13,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:13,588 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:33:13,589 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:33:13,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-04-30 10:33:13,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:33:13,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:33:13,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:13,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-30 10:33:13,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:13,699 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 1 [2025-04-30 10:33:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:13,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210335625] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:13,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-04-30 10:33:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124293864] [2025-04-30 10:33:13,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:13,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:33:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:13,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:33:13,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:33:13,975 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 27 states, 26 states have (on average 3.730769230769231) internal successors, (97), 27 states have internal predecessors, (97), 0 states have call successors, (0), 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:33:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:14,182 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2025-04-30 10:33:14,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:33:14,182 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.730769230769231) internal successors, (97), 27 states have internal predecessors, (97), 0 states have call successors, (0), 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:33:14,182 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:14,183 INFO L225 Difference]: With dead ends: 129 [2025-04-30 10:33:14,183 INFO L226 Difference]: Without dead ends: 129 [2025-04-30 10:33:14,183 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:33:14,184 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 117 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:14,184 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 285 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-30 10:33:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2025-04-30 10:33:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 1.1203703703703705) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 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:33:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2025-04-30 10:33:14,186 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 39 [2025-04-30 10:33:14,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:14,187 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2025-04-30 10:33:14,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.730769230769231) internal successors, (97), 27 states have internal predecessors, (97), 0 states have call successors, (0), 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:33:14,187 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2025-04-30 10:33:14,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:33:14,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:14,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1] [2025-04-30 10:33:14,208 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:33:14,387 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,SelfDestructingSolverStorable27 [2025-04-30 10:33:14,388 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:14,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1176462357, now seen corresponding path program 2 times [2025-04-30 10:33:14,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:14,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884069272] [2025-04-30 10:33:14,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:14,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:33:14,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:33:14,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:14,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:14,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884069272] [2025-04-30 10:33:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884069272] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:14,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236773050] [2025-04-30 10:33:14,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:14,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:14,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:14,629 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:33:14,631 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:33:14,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:33:14,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:33:14,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:14,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:14,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-30 10:33:14,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:14,754 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:33:14,768 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 8 treesize of output 1 [2025-04-30 10:33:15,009 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:33:15,009 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 31 treesize of output 15 [2025-04-30 10:33:15,063 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 16 treesize of output 8 [2025-04-30 10:33:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:15,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:15,453 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 23 treesize of output 19 [2025-04-30 10:33:15,487 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 40 treesize of output 34 [2025-04-30 10:33:15,490 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:33:15,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2025-04-30 10:33:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:15,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236773050] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:15,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:15,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 20] total 46 [2025-04-30 10:33:15,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193703277] [2025-04-30 10:33:15,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:15,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-30 10:33:15,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:15,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-30 10:33:15,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1874, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:33:15,625 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 46 states have internal predecessors, (121), 0 states have call successors, (0), 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:33:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:16,081 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2025-04-30 10:33:16,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:33:16,081 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 46 states have internal predecessors, (121), 0 states have call successors, (0), 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 43 [2025-04-30 10:33:16,081 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:16,082 INFO L225 Difference]: With dead ends: 179 [2025-04-30 10:33:16,082 INFO L226 Difference]: Without dead ends: 153 [2025-04-30 10:33:16,083 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=2886, Unknown=0, NotChecked=0, Total=3192 [2025-04-30 10:33:16,084 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:16,084 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 386 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-04-30 10:33:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2025-04-30 10:33:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 148 states have (on average 1.1081081081081081) internal successors, (164), 149 states have internal predecessors, (164), 0 states have call successors, (0), 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:33:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2025-04-30 10:33:16,088 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 43 [2025-04-30 10:33:16,089 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:16,089 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2025-04-30 10:33:16,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 46 states have internal predecessors, (121), 0 states have call successors, (0), 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:33:16,089 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2025-04-30 10:33:16,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:33:16,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:16,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:33:16,096 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:33:16,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:16,290 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:16,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:16,291 INFO L85 PathProgramCache]: Analyzing trace with hash -935907809, now seen corresponding path program 3 times [2025-04-30 10:33:16,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:16,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140263682] [2025-04-30 10:33:16,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:16,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:16,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 3 equivalence classes. [2025-04-30 10:33:16,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:33:16,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:33:16,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:16,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:16,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140263682] [2025-04-30 10:33:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140263682] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:16,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248425591] [2025-04-30 10:33:16,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:16,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:16,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:16,545 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:33:16,547 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:33:16,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 3 equivalence classes. [2025-04-30 10:33:16,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:33:16,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:33:16,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:16,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:33:16,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:16,642 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:33:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:16,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248425591] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:17,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:17,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-04-30 10:33:17,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981700979] [2025-04-30 10:33:17,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:17,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:33:17,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:17,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:33:17,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:33:17,037 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 25 states, 24 states have (on average 5.416666666666667) internal successors, (130), 25 states have internal predecessors, (130), 0 states have call successors, (0), 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:33:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:17,193 INFO L93 Difference]: Finished difference Result 235 states and 254 transitions. [2025-04-30 10:33:17,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:33:17,193 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.416666666666667) internal successors, (130), 25 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-04-30 10:33:17,194 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:17,194 INFO L225 Difference]: With dead ends: 235 [2025-04-30 10:33:17,194 INFO L226 Difference]: Without dead ends: 235 [2025-04-30 10:33:17,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:33:17,195 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:17,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 293 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-30 10:33:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 192. [2025-04-30 10:33:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 1.105263157894737) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 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:33:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2025-04-30 10:33:17,198 INFO L79 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 46 [2025-04-30 10:33:17,198 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:17,199 INFO L485 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2025-04-30 10:33:17,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.416666666666667) internal successors, (130), 25 states have internal predecessors, (130), 0 states have call successors, (0), 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:33:17,199 INFO L278 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2025-04-30 10:33:17,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-30 10:33:17,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:17,199 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-04-30 10:33:17,206 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:33:17,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:17,400 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:17,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1335890368, now seen corresponding path program 4 times [2025-04-30 10:33:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:17,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591321755] [2025-04-30 10:33:17,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:17,407 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-30 10:33:17,414 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 46 statements. [2025-04-30 10:33:17,414 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:33:17,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:17,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:17,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591321755] [2025-04-30 10:33:17,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591321755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:17,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643972645] [2025-04-30 10:33:17,848 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:17,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:17,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:17,851 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:33:17,852 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:33:17,918 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-30 10:33:17,937 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 46 statements. [2025-04-30 10:33:17,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:33:17,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:17,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-30 10:33:17,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:18,046 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:33:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:18,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:18,394 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 44 treesize of output 38 [2025-04-30 10:33:18,398 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:33:18,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-04-30 10:33:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643972645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:18,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:18,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 34 [2025-04-30 10:33:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630035114] [2025-04-30 10:33:18,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:18,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:33:18,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:18,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:33:18,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:33:18,522 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 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:33:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:18,888 INFO L93 Difference]: Finished difference Result 307 states and 329 transitions. [2025-04-30 10:33:18,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:33:18,888 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-04-30 10:33:18,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:18,889 INFO L225 Difference]: With dead ends: 307 [2025-04-30 10:33:18,889 INFO L226 Difference]: Without dead ends: 270 [2025-04-30 10:33:18,890 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=1947, Unknown=0, NotChecked=0, Total=2256 [2025-04-30 10:33:18,890 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:18,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 259 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-30 10:33:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262. [2025-04-30 10:33:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 260 states have (on average 1.0961538461538463) internal successors, (285), 261 states have internal predecessors, (285), 0 states have call successors, (0), 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:33:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 285 transitions. [2025-04-30 10:33:18,898 INFO L79 Accepts]: Start accepts. Automaton has 262 states and 285 transitions. Word has length 46 [2025-04-30 10:33:18,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:18,898 INFO L485 AbstractCegarLoop]: Abstraction has 262 states and 285 transitions. [2025-04-30 10:33:18,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 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:33:18,898 INFO L278 IsEmpty]: Start isEmpty. Operand 262 states and 285 transitions. [2025-04-30 10:33:18,899 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:33:18,899 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:18,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:18,909 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:33:19,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:19,099 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:19,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1540714094, now seen corresponding path program 5 times [2025-04-30 10:33:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:19,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511115476] [2025-04-30 10:33:19,100 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:33:19,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:19,108 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 4 equivalence classes. [2025-04-30 10:33:19,114 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:33:19,114 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-30 10:33:19,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:19,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511115476] [2025-04-30 10:33:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511115476] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:19,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440290119] [2025-04-30 10:33:19,339 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:33:19,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:19,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:19,340 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:33:19,342 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:33:19,399 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 4 equivalence classes. [2025-04-30 10:33:19,421 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:33:19,422 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-30 10:33:19,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:19,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-30 10:33:19,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:19,430 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 1 [2025-04-30 10:33:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:19,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440290119] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:19,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-04-30 10:33:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764843732] [2025-04-30 10:33:19,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:19,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:33:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:19,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:33:19,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:33:19,826 INFO L87 Difference]: Start difference. First operand 262 states and 285 transitions. Second operand has 32 states, 31 states have (on average 4.0) internal successors, (124), 32 states have internal predecessors, (124), 0 states have call successors, (0), 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:33:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:20,153 INFO L93 Difference]: Finished difference Result 327 states and 355 transitions. [2025-04-30 10:33:20,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:33:20,153 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.0) internal successors, (124), 32 states have internal predecessors, (124), 0 states have call successors, (0), 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 49 [2025-04-30 10:33:20,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:20,154 INFO L225 Difference]: With dead ends: 327 [2025-04-30 10:33:20,154 INFO L226 Difference]: Without dead ends: 327 [2025-04-30 10:33:20,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2025-04-30 10:33:20,155 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 132 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:20,155 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 504 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-04-30 10:33:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 290. [2025-04-30 10:33:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 288 states have (on average 1.0972222222222223) internal successors, (316), 289 states have internal predecessors, (316), 0 states have call successors, (0), 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:33:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 316 transitions. [2025-04-30 10:33:20,163 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 316 transitions. Word has length 49 [2025-04-30 10:33:20,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:20,163 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 316 transitions. [2025-04-30 10:33:20,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.0) internal successors, (124), 32 states have internal predecessors, (124), 0 states have call successors, (0), 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:33:20,163 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 316 transitions. [2025-04-30 10:33:20,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-30 10:33:20,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:20,164 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:20,174 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:33:20,364 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,SelfDestructingSolverStorable31 [2025-04-30 10:33:20,364 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:20,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1321207111, now seen corresponding path program 6 times [2025-04-30 10:33:20,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:20,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975445865] [2025-04-30 10:33:20,365 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:33:20,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:20,372 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-04-30 10:33:20,402 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:33:20,402 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:33:20,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:20,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:20,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975445865] [2025-04-30 10:33:20,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975445865] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:20,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844281533] [2025-04-30 10:33:20,781 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:33:20,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:20,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:20,783 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:33:20,786 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:33:20,846 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-04-30 10:33:20,894 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:33:20,894 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:33:20,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:20,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-30 10:33:20,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:20,995 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:33:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:21,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:21,136 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:33:21,144 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:33:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:21,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844281533] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:21,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:21,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 30 [2025-04-30 10:33:21,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180612503] [2025-04-30 10:33:21,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:21,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-30 10:33:21,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:21,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-30 10:33:21,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:33:21,193 INFO L87 Difference]: Start difference. First operand 290 states and 316 transitions. Second operand has 30 states, 30 states have (on average 3.1) internal successors, (93), 30 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:33:21,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:21,541 INFO L93 Difference]: Finished difference Result 436 states and 469 transitions. [2025-04-30 10:33:21,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:33:21,541 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.1) internal successors, (93), 30 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 56 [2025-04-30 10:33:21,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:21,542 INFO L225 Difference]: With dead ends: 436 [2025-04-30 10:33:21,542 INFO L226 Difference]: Without dead ends: 392 [2025-04-30 10:33:21,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=1399, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:33:21,543 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 91 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:21,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 771 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-30 10:33:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 381. [2025-04-30 10:33:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 379 states have (on average 1.0949868073878628) internal successors, (415), 380 states have internal predecessors, (415), 0 states have call successors, (0), 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:33:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 415 transitions. [2025-04-30 10:33:21,550 INFO L79 Accepts]: Start accepts. Automaton has 381 states and 415 transitions. Word has length 56 [2025-04-30 10:33:21,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:21,550 INFO L485 AbstractCegarLoop]: Abstraction has 381 states and 415 transitions. [2025-04-30 10:33:21,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.1) internal successors, (93), 30 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:33:21,550 INFO L278 IsEmpty]: Start isEmpty. Operand 381 states and 415 transitions. [2025-04-30 10:33:21,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:33:21,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:21,551 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:21,557 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:33:21,756 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,SelfDestructingSolverStorable32 [2025-04-30 10:33:21,756 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:21,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:21,756 INFO L85 PathProgramCache]: Analyzing trace with hash 105731897, now seen corresponding path program 4 times [2025-04-30 10:33:21,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:21,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811015972] [2025-04-30 10:33:21,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:21,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:21,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-04-30 10:33:21,780 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 59 statements. [2025-04-30 10:33:21,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:33:21,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:33:22,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:22,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811015972] [2025-04-30 10:33:22,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811015972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:22,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129961548] [2025-04-30 10:33:22,680 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:22,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:22,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:22,682 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:33:22,682 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:33:22,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-04-30 10:33:22,757 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 59 statements. [2025-04-30 10:33:22,757 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:33:22,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:22,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-30 10:33:22,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:22,775 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:33:24,376 INFO L325 Elim1Store]: treesize reduction 8, result has 76.5 percent of original size [2025-04-30 10:33:24,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 54 [2025-04-30 10:33:24,586 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:33:24,586 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 24 treesize of output 24 [2025-04-30 10:33:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:33:24,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:25,397 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:33:25,397 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 37 treesize of output 36 [2025-04-30 10:33:25,676 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 57 treesize of output 49 [2025-04-30 10:33:25,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 104 [2025-04-30 10:33:25,688 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:33:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:33:25,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129961548] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:25,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:25,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 60 [2025-04-30 10:33:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749937928] [2025-04-30 10:33:25,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:25,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-04-30 10:33:25,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:25,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-04-30 10:33:25,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=3206, Unknown=0, NotChecked=0, Total=3660 [2025-04-30 10:33:25,700 INFO L87 Difference]: Start difference. First operand 381 states and 415 transitions. Second operand has 61 states, 60 states have (on average 2.35) internal successors, (141), 61 states have internal predecessors, (141), 0 states have call successors, (0), 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:33:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:34,371 INFO L93 Difference]: Finished difference Result 696 states and 747 transitions. [2025-04-30 10:33:34,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-30 10:33:34,371 INFO L79 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.35) internal successors, (141), 61 states have internal predecessors, (141), 0 states have call successors, (0), 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 59 [2025-04-30 10:33:34,372 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:34,372 INFO L225 Difference]: With dead ends: 696 [2025-04-30 10:33:34,372 INFO L226 Difference]: Without dead ends: 317 [2025-04-30 10:33:34,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1859, Invalid=7453, Unknown=0, NotChecked=0, Total=9312 [2025-04-30 10:33:34,374 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 346 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:34,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 605 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-30 10:33:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-04-30 10:33:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 115. [2025-04-30 10:33:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.087719298245614) internal successors, (124), 114 states have internal predecessors, (124), 0 states have call successors, (0), 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:33:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2025-04-30 10:33:34,378 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 59 [2025-04-30 10:33:34,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:34,378 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2025-04-30 10:33:34,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.35) internal successors, (141), 61 states have internal predecessors, (141), 0 states have call successors, (0), 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:33:34,378 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2025-04-30 10:33:34,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-30 10:33:34,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:34,378 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:34,384 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:33:34,578 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,SelfDestructingSolverStorable33 [2025-04-30 10:33:34,579 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:34,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash -585356775, now seen corresponding path program 7 times [2025-04-30 10:33:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:34,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10659879] [2025-04-30 10:33:34,579 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:33:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:33:34,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:33:34,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:34,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:34,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10659879] [2025-04-30 10:33:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10659879] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:34,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898047359] [2025-04-30 10:33:34,878 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:33:34,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:34,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:34,880 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:33:34,881 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:33:34,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:33:34,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:33:34,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:34,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:34,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-30 10:33:34,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 12 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:35,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:35,307 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:33:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 12 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898047359] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:35,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:35,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-04-30 10:33:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653714954] [2025-04-30 10:33:35,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:35,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:33:35,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:35,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:33:35,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:33:35,363 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 32 states, 31 states have (on average 4.129032258064516) internal successors, (128), 32 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:33:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:35,613 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2025-04-30 10:33:35,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:33:35,613 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.129032258064516) internal successors, (128), 32 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 59 [2025-04-30 10:33:35,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:35,614 INFO L225 Difference]: With dead ends: 146 [2025-04-30 10:33:35,614 INFO L226 Difference]: Without dead ends: 146 [2025-04-30 10:33:35,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1290, Unknown=0, NotChecked=0, Total=1482 [2025-04-30 10:33:35,615 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 90 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:35,615 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 440 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-04-30 10:33:35,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2025-04-30 10:33:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 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:33:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2025-04-30 10:33:35,617 INFO L79 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 59 [2025-04-30 10:33:35,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:35,617 INFO L485 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2025-04-30 10:33:35,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.129032258064516) internal successors, (128), 32 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:33:35,617 INFO L278 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2025-04-30 10:33:35,618 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-30 10:33:35,618 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:35,618 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:35,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:33:35,818 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,SelfDestructingSolverStorable34 [2025-04-30 10:33:35,818 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:35,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash -820898080, now seen corresponding path program 8 times [2025-04-30 10:33:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:35,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337644489] [2025-04-30 10:33:35,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:35,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:35,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-04-30 10:33:35,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:33:35,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:35,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 21 proven. 76 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:36,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:36,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337644489] [2025-04-30 10:33:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337644489] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:36,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577646523] [2025-04-30 10:33:36,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:36,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:36,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:36,236 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:33:36,237 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:33:36,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-04-30 10:33:36,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-04-30 10:33:36,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:36,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:36,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-30 10:33:36,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:36,409 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:33:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 21 proven. 76 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:36,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:36,527 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:33:36,528 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:33:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 21 proven. 76 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:36,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577646523] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:36,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2025-04-30 10:33:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587192304] [2025-04-30 10:33:36,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:36,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-30 10:33:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:36,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-30 10:33:36,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:33:36,588 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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:33:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:36,981 INFO L93 Difference]: Finished difference Result 222 states and 236 transitions. [2025-04-30 10:33:36,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:33:36,981 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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 66 [2025-04-30 10:33:36,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:36,982 INFO L225 Difference]: With dead ends: 222 [2025-04-30 10:33:36,982 INFO L226 Difference]: Without dead ends: 139 [2025-04-30 10:33:36,982 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:33:36,983 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 109 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:36,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 598 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-04-30 10:33:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2025-04-30 10:33:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 134 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:33:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2025-04-30 10:33:36,985 INFO L79 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 66 [2025-04-30 10:33:36,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:36,985 INFO L485 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2025-04-30 10:33:36,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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:33:36,985 INFO L278 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2025-04-30 10:33:36,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-30 10:33:36,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:36,986 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:36,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:33:37,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:37,186 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:37,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1730927922, now seen corresponding path program 9 times [2025-04-30 10:33:37,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:37,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282739693] [2025-04-30 10:33:37,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:37,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:37,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 6 equivalence classes. [2025-04-30 10:33:37,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:33:37,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:33:37,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 12 proven. 98 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:37,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:37,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282739693] [2025-04-30 10:33:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282739693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:37,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042503831] [2025-04-30 10:33:37,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:37,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:37,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:37,576 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:33:37,578 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:33:37,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 6 equivalence classes. [2025-04-30 10:33:37,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:33:37,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:33:37,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:37,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-30 10:33:37,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 22 proven. 88 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:37,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:38,054 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:33:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 22 proven. 88 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:38,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042503831] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:38,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 35 [2025-04-30 10:33:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893594795] [2025-04-30 10:33:38,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:38,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-30 10:33:38,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:38,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-30 10:33:38,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2025-04-30 10:33:38,113 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 36 states, 35 states have (on average 4.228571428571429) internal successors, (148), 36 states have internal predecessors, (148), 0 states have call successors, (0), 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:33:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:38,355 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2025-04-30 10:33:38,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:33:38,355 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.228571428571429) internal successors, (148), 36 states have internal predecessors, (148), 0 states have call successors, (0), 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 69 [2025-04-30 10:33:38,355 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:38,356 INFO L225 Difference]: With dead ends: 167 [2025-04-30 10:33:38,356 INFO L226 Difference]: Without dead ends: 167 [2025-04-30 10:33:38,356 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 113 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2025-04-30 10:33:38,357 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 229 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:38,357 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 278 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-30 10:33:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 149. [2025-04-30 10:33:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.0810810810810811) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 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:33:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2025-04-30 10:33:38,360 INFO L79 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 69 [2025-04-30 10:33:38,360 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:38,360 INFO L485 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2025-04-30 10:33:38,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.228571428571429) internal successors, (148), 36 states have internal predecessors, (148), 0 states have call successors, (0), 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:33:38,360 INFO L278 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2025-04-30 10:33:38,360 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-04-30 10:33:38,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:38,360 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:38,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-30 10:33:38,563 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,SelfDestructingSolverStorable36 [2025-04-30 10:33:38,563 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:38,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1031824807, now seen corresponding path program 10 times [2025-04-30 10:33:38,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:38,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372381100] [2025-04-30 10:33:38,564 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:38,571 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-04-30 10:33:38,582 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 62 of 76 statements. [2025-04-30 10:33:38,582 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:33:38,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 111 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:39,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372381100] [2025-04-30 10:33:39,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372381100] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:39,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573353444] [2025-04-30 10:33:39,676 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:39,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:39,678 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:33:39,679 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:33:39,745 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-04-30 10:33:39,767 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 62 of 76 statements. [2025-04-30 10:33:39,768 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:33:39,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:39,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-04-30 10:33:39,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:39,941 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:33:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 101 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:41,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:41,275 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:33:41,281 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:33:41,281 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:33:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 111 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573353444] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:41,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 67 [2025-04-30 10:33:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667490626] [2025-04-30 10:33:41,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:41,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-30 10:33:41,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:41,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-30 10:33:41,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=3873, Unknown=0, NotChecked=0, Total=4422 [2025-04-30 10:33:41,753 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand has 67 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 67 states have internal predecessors, (146), 0 states have call successors, (0), 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:33:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:42,884 INFO L93 Difference]: Finished difference Result 257 states and 273 transitions. [2025-04-30 10:33:42,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-30 10:33:42,884 INFO L79 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 67 states have internal predecessors, (146), 0 states have call successors, (0), 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 76 [2025-04-30 10:33:42,884 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:42,885 INFO L225 Difference]: With dead ends: 257 [2025-04-30 10:33:42,885 INFO L226 Difference]: Without dead ends: 159 [2025-04-30 10:33:42,886 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3143 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1074, Invalid=7856, Unknown=0, NotChecked=0, Total=8930 [2025-04-30 10:33:42,887 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 39 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:42,887 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 452 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:33:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-30 10:33:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2025-04-30 10:33:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.077922077922078) internal successors, (166), 154 states have internal predecessors, (166), 0 states have call successors, (0), 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:33:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2025-04-30 10:33:42,889 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 76 [2025-04-30 10:33:42,889 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:42,889 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2025-04-30 10:33:42,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 67 states have internal predecessors, (146), 0 states have call successors, (0), 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:33:42,889 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2025-04-30 10:33:42,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-04-30 10:33:42,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:42,890 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:42,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:43,090 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,SelfDestructingSolverStorable37 [2025-04-30 10:33:43,090 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:43,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash -572789383, now seen corresponding path program 11 times [2025-04-30 10:33:43,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:43,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058097763] [2025-04-30 10:33:43,091 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:33:43,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:43,099 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 7 equivalence classes. [2025-04-30 10:33:43,107 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:33:43,107 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-30 10:33:43,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 37 proven. 125 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:43,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058097763] [2025-04-30 10:33:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058097763] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:43,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433101027] [2025-04-30 10:33:43,440 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:33:43,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:43,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:43,441 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:33:43,442 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:33:43,510 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 7 equivalence classes. [2025-04-30 10:33:43,543 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:33:43,543 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-30 10:33:43,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:43,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-04-30 10:33:43,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:43,550 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 1 [2025-04-30 10:33:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 35 proven. 127 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:43,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 35 proven. 127 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433101027] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:44,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2025-04-30 10:33:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490199365] [2025-04-30 10:33:44,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:44,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-30 10:33:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:44,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-30 10:33:44,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2025-04-30 10:33:44,275 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand has 47 states, 46 states have (on average 4.195652173913044) internal successors, (193), 47 states have internal predecessors, (193), 0 states have call successors, (0), 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:33:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:44,690 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2025-04-30 10:33:44,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:33:44,691 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.195652173913044) internal successors, (193), 47 states have internal predecessors, (193), 0 states have call successors, (0), 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:33:44,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:44,691 INFO L225 Difference]: With dead ends: 188 [2025-04-30 10:33:44,691 INFO L226 Difference]: Without dead ends: 188 [2025-04-30 10:33:44,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=419, Invalid=2661, Unknown=0, NotChecked=0, Total=3080 [2025-04-30 10:33:44,692 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 118 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:44,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 607 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:33:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-30 10:33:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2025-04-30 10:33:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.0773809523809523) internal successors, (181), 168 states have internal predecessors, (181), 0 states have call successors, (0), 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:33:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2025-04-30 10:33:44,695 INFO L79 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 79 [2025-04-30 10:33:44,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:44,695 INFO L485 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2025-04-30 10:33:44,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.195652173913044) internal successors, (193), 47 states have internal predecessors, (193), 0 states have call successors, (0), 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:33:44,696 INFO L278 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2025-04-30 10:33:44,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-30 10:33:44,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:44,696 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:44,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-30 10:33:44,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-30 10:33:44,897 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-04-30 10:33:44,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1022244992, now seen corresponding path program 12 times [2025-04-30 10:33:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:44,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163749789] [2025-04-30 10:33:44,898 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:33:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:44,905 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 86 statements into 8 equivalence classes. [2025-04-30 10:33:44,927 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:33:44,927 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-30 10:33:44,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 31 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:46,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:46,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163749789] [2025-04-30 10:33:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163749789] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:46,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139691794] [2025-04-30 10:33:46,016 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:33:46,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:46,018 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:33:46,019 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:33:46,094 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 86 statements into 8 equivalence classes. [2025-04-30 10:33:46,144 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 86 of 86 statements. [2025-04-30 10:33:46,144 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-30 10:33:46,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:46,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-04-30 10:33:46,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:46,297 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:33:51,075 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:33:51,076 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 18 treesize of output 19 [2025-04-30 10:33:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 35 proven. 170 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:51,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:52,273 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:33:52,276 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 20 [2025-04-30 10:33:52,279 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:33:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 35 proven. 170 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139691794] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:52,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:52,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22, 22] total 64 [2025-04-30 10:33:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135138316] [2025-04-30 10:33:52,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:52,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-04-30 10:33:52,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:52,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-04-30 10:33:52,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3719, Unknown=0, NotChecked=0, Total=4032 [2025-04-30 10:33:52,413 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 64 states, 64 states have (on average 3.546875) internal successors, (227), 64 states have internal predecessors, (227), 0 states have call successors, (0), 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:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:08,047 INFO L93 Difference]: Finished difference Result 263 states and 277 transitions. [2025-04-30 10:34:08,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-30 10:34:08,048 INFO L79 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.546875) internal successors, (227), 64 states have internal predecessors, (227), 0 states have call successors, (0), 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 86 [2025-04-30 10:34:08,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:08,048 INFO L225 Difference]: With dead ends: 263 [2025-04-30 10:34:08,048 INFO L226 Difference]: Without dead ends: 210 [2025-04-30 10:34:08,049 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 130 SyntacticMatches, 7 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3119 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=1146, Invalid=10843, Unknown=1, NotChecked=0, Total=11990 [2025-04-30 10:34:08,049 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 504 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:08,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 753 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-30 10:34:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-30 10:34:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 186. [2025-04-30 10:34:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.0756756756756756) internal successors, (199), 185 states have internal predecessors, (199), 0 states have call successors, (0), 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:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2025-04-30 10:34:08,052 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 86 [2025-04-30 10:34:08,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:08,052 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2025-04-30 10:34:08,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.546875) internal successors, (227), 64 states have internal predecessors, (227), 0 states have call successors, (0), 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:08,053 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2025-04-30 10:34:08,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-04-30 10:34:08,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:08,053 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 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:08,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 Killed by 15