./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-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 86c4ccee9690ccdd33683565314ba095e56520aa142914bd8063fc7c4c92940d --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:33:56,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:33:56,537 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:56,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:33:56,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:33:56,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:33:56,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:33:56,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:33:56,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:33:56,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:33:56,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:33:56,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:33:56,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:33:56,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:33:56,558 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:33:56,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:33:56,559 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:33:56,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:33:56,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:33:56,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:33:56,559 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:33:56,559 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:33:56,559 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:33:56,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:33:56,560 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:33:56,560 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:33:56,560 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:33:56,560 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:33:56,560 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:33:56,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:33:56,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:33:56,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:33:56,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:56,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:56,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:33:56,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:33:56,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:33:56,562 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 -> 86c4ccee9690ccdd33683565314ba095e56520aa142914bd8063fc7c4c92940d [2025-04-30 10:33:56,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:33:56,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:33:56,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:33:56,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:33:56,791 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:33:56,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca-2.i [2025-04-30 10:33:58,029 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dbe219d/25d13916e64b497ab527e9189204454d/FLAGe19fe3d57 [2025-04-30 10:33:58,235 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:33:58,235 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca-2.i [2025-04-30 10:33:58,243 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dbe219d/25d13916e64b497ab527e9189204454d/FLAGe19fe3d57 [2025-04-30 10:33:59,029 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dbe219d/25d13916e64b497ab527e9189204454d [2025-04-30 10:33:59,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:33:59,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:33:59,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:59,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:33:59,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:33:59,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:59" (1/1) ... [2025-04-30 10:33:59,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52305516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:59, skipping insertion in model container [2025-04-30 10:33:59,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:59" (1/1) ... [2025-04-30 10:33:59,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:33:59,327 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:59,327 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:59,332 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:59,339 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:33:59,376 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:59,393 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:33:59,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:59 WrapperNode [2025-04-30 10:33:59,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:59,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:59,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:33:59,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:33:59,399 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:59" (1/1) ... [2025-04-30 10:33:59,409 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:59" (1/1) ... [2025-04-30 10:33:59,423 INFO L138 Inliner]: procedures = 117, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2025-04-30 10:33:59,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:59,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:33:59,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:33:59,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:33:59,431 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:59" (1/1) ... [2025-04-30 10:33:59,431 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:59" (1/1) ... [2025-04-30 10:33:59,433 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:59" (1/1) ... [2025-04-30 10:33:59,443 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-04-30 10:33:59,443 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:59" (1/1) ... [2025-04-30 10:33:59,444 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:59" (1/1) ... [2025-04-30 10:33:59,448 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:59" (1/1) ... [2025-04-30 10:33:59,448 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:59" (1/1) ... [2025-04-30 10:33:59,450 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:59" (1/1) ... [2025-04-30 10:33:59,451 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:59" (1/1) ... [2025-04-30 10:33:59,451 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:59" (1/1) ... [2025-04-30 10:33:59,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:33:59,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:33:59,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:33:59,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:33:59,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:59" (1/1) ... [2025-04-30 10:33:59,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:59,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:59,481 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:59,486 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:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:33:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:33:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:33:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:33:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:33:59,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:33:59,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:33:59,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:33:59,579 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:33:59,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:33:59,719 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-04-30 10:33:59,719 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:33:59,725 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:33:59,725 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:33:59,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:59 BoogieIcfgContainer [2025-04-30 10:33:59,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:33:59,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:33:59,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:33:59,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:33:59,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:33:59" (1/3) ... [2025-04-30 10:33:59,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486b2e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:59, skipping insertion in model container [2025-04-30 10:33:59,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:59" (2/3) ... [2025-04-30 10:33:59,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486b2e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:59, skipping insertion in model container [2025-04-30 10:33:59,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:59" (3/3) ... [2025-04-30 10:33:59,732 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca-2.i [2025-04-30 10:33:59,741 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:33:59,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrcspn-alloca-2.i that has 1 procedures, 39 locations, 46 edges, 1 initial locations, 4 loop locations, and 13 error locations. [2025-04-30 10:33:59,775 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:33:59,784 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;@6eb0fc39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:33:59,784 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-30 10:33:59,788 INFO L278 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.84) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:59,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:59,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:59,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:59,792 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:33:59,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-30 10:33:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:59,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695809935] [2025-04-30 10:33:59,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:59,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:59,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:59,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:59,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:59,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:00,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:00,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695809935] [2025-04-30 10:34:00,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695809935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:00,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:00,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040317369] [2025-04-30 10:34:00,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:00,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:00,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:00,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:00,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:00,023 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.84) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:34:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:00,066 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-04-30 10:34:00,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:00,068 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:34:00,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:00,073 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:34:00,073 INFO L226 Difference]: Without dead ends: 47 [2025-04-30 10:34:00,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:00,079 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 84 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:34:00,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-04-30 10:34:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2025-04-30 10:34:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-04-30 10:34:00,108 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 7 [2025-04-30 10:34:00,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:00,108 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-04-30 10:34:00,109 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:34:00,109 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-04-30 10:34:00,109 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:00,109 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:00,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:00,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:34:00,110 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:00,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:00,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876010, now seen corresponding path program 1 times [2025-04-30 10:34:00,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:00,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553121810] [2025-04-30 10:34:00,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:00,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:00,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:00,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:00,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:00,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:00,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553121810] [2025-04-30 10:34:00,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553121810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:00,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:34:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534259380] [2025-04-30 10:34:00,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:00,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:34:00,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:00,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:34:00,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:00,283 INFO L87 Difference]: Start difference. First operand 40 states and 46 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:34:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:00,315 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-04-30 10:34:00,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:34:00,315 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:34:00,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:00,316 INFO L225 Difference]: With dead ends: 38 [2025-04-30 10:34:00,316 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:34:00,317 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:00,317 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:00,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 45 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:34:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-30 10:34:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-04-30 10:34:00,320 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 7 [2025-04-30 10:34:00,320 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:00,320 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-04-30 10:34:00,320 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:00,320 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-04-30 10:34:00,320 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:34:00,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:00,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:00,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:34:00,321 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:00,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876011, now seen corresponding path program 1 times [2025-04-30 10:34:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:00,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392540003] [2025-04-30 10:34:00,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:00,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:34:00,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:34:00,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:00,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:00,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392540003] [2025-04-30 10:34:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392540003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:00,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:00,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944641669] [2025-04-30 10:34:00,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:00,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:00,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:00,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:00,516 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:00,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:00,595 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-04-30 10:34:00,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:00,597 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:34:00,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:00,598 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:34:00,598 INFO L226 Difference]: Without dead ends: 41 [2025-04-30 10:34:00,598 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:34:00,599 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:00,599 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-30 10:34:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-04-30 10:34:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 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:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-04-30 10:34:00,602 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 7 [2025-04-30 10:34:00,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:00,602 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-04-30 10:34:00,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:00,602 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-04-30 10:34:00,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:34:00,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:00,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:00,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:34:00,604 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:00,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash 121329398, now seen corresponding path program 1 times [2025-04-30 10:34:00,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:00,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890775107] [2025-04-30 10:34:00,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:00,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:34:00,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:34:00,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:00,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:00,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890775107] [2025-04-30 10:34:00,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890775107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:00,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:00,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:34:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462747004] [2025-04-30 10:34:00,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:00,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:00,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:00,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:00,731 INFO L87 Difference]: Start difference. First operand 40 states and 47 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:34:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:00,752 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-04-30 10:34:00,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:00,752 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:34:00,752 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:00,753 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:34:00,753 INFO L226 Difference]: Without dead ends: 46 [2025-04-30 10:34:00,753 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:34:00,753 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 69 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:34:00,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 69 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-30 10:34:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-04-30 10:34:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-04-30 10:34:00,758 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 8 [2025-04-30 10:34:00,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:00,758 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-04-30 10:34:00,758 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:34:00,758 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-04-30 10:34:00,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:34:00,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:00,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:00,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:34:00,759 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:00,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:00,759 INFO L85 PathProgramCache]: Analyzing trace with hash 121329206, now seen corresponding path program 1 times [2025-04-30 10:34:00,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:00,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067242941] [2025-04-30 10:34:00,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:00,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:00,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:34:00,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:34:00,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:00,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:00,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067242941] [2025-04-30 10:34:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067242941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:00,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:00,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:00,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715803331] [2025-04-30 10:34:00,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:00,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:00,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:00,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:00,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:00,794 INFO L87 Difference]: Start difference. First operand 44 states and 54 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:34:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:00,810 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2025-04-30 10:34:00,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:00,810 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:34:00,811 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:00,811 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:34:00,811 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:34:00,811 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:00,812 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 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:34:00,812 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:34:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2025-04-30 10:34:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.558139534883721) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-04-30 10:34:00,815 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 8 [2025-04-30 10:34:00,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:00,815 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-04-30 10:34:00,815 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:34:00,815 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-04-30 10:34:00,816 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:34:00,816 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:00,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:00,816 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:34:00,816 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:00,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash 123176248, now seen corresponding path program 1 times [2025-04-30 10:34:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:00,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564306519] [2025-04-30 10:34:00,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:00,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:34:00,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:34:00,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:00,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:00,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564306519] [2025-04-30 10:34:00,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564306519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:00,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:00,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763080315] [2025-04-30 10:34:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:00,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:34:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:00,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:34:00,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:00,936 INFO L87 Difference]: Start difference. First operand 54 states and 67 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:34:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:01,009 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2025-04-30 10:34:01,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:01,010 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:34:01,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:01,010 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:34:01,010 INFO L226 Difference]: Without dead ends: 60 [2025-04-30 10:34:01,010 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:34:01,011 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 65 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.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:01,011 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 65 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-30 10:34:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-04-30 10:34:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 57 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2025-04-30 10:34:01,018 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 8 [2025-04-30 10:34:01,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:01,018 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2025-04-30 10:34:01,018 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:34:01,018 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2025-04-30 10:34:01,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:34:01,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:01,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:01,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:34:01,018 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:01,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash 123176247, now seen corresponding path program 1 times [2025-04-30 10:34:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:01,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642020839] [2025-04-30 10:34:01,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:01,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:34:01,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:34:01,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:01,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:01,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:01,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642020839] [2025-04-30 10:34:01,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642020839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:01,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:01,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:34:01,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695560294] [2025-04-30 10:34:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:01,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:34:01,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:01,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:34:01,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:01,057 INFO L87 Difference]: Start difference. First operand 58 states and 75 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:34:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:01,075 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2025-04-30 10:34:01,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:34:01,075 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:34:01,076 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:01,076 INFO L225 Difference]: With dead ends: 56 [2025-04-30 10:34:01,076 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:34:01,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:34:01,077 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:01,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:34:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-30 10:34:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 55 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:34:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-04-30 10:34:01,083 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 8 [2025-04-30 10:34:01,083 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:01,083 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-04-30 10:34:01,083 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:34:01,083 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-04-30 10:34:01,083 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:34:01,083 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:01,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:01,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:34:01,084 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:01,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash 178587700, now seen corresponding path program 1 times [2025-04-30 10:34:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:01,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069587565] [2025-04-30 10:34:01,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:01,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:01,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:34:01,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:34:01,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:01,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:01,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069587565] [2025-04-30 10:34:01,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069587565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:01,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:01,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759209407] [2025-04-30 10:34:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:01,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:01,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:01,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:01,191 INFO L87 Difference]: Start difference. First operand 56 states and 70 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:34:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:01,217 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-04-30 10:34:01,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:01,217 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:34:01,217 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:01,218 INFO L225 Difference]: With dead ends: 55 [2025-04-30 10:34:01,218 INFO L226 Difference]: Without dead ends: 55 [2025-04-30 10:34:01,218 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:34:01,219 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:01,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-30 10:34:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2025-04-30 10:34:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.475) internal successors, (59), 47 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2025-04-30 10:34:01,224 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 8 [2025-04-30 10:34:01,224 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:01,224 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2025-04-30 10:34:01,224 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:34:01,225 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2025-04-30 10:34:01,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:34:01,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:01,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:01,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:34:01,225 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:01,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash -533755979, now seen corresponding path program 1 times [2025-04-30 10:34:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:01,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238944825] [2025-04-30 10:34:01,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:01,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:34:01,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:34:01,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:01,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:01,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238944825] [2025-04-30 10:34:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238944825] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:01,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:01,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:34:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495628426] [2025-04-30 10:34:01,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:01,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:01,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:01,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:01,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:01,326 INFO L87 Difference]: Start difference. First operand 48 states and 59 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:34:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:01,344 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-04-30 10:34:01,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:01,344 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:34:01,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:01,345 INFO L225 Difference]: With dead ends: 51 [2025-04-30 10:34:01,345 INFO L226 Difference]: Without dead ends: 51 [2025-04-30 10:34:01,346 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:34:01,347 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 60 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:34:01,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-30 10:34:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-04-30 10:34:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-04-30 10:34:01,349 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 9 [2025-04-30 10:34:01,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:01,349 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-04-30 10:34:01,349 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:34:01,349 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-04-30 10:34:01,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:34:01,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:01,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:01,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:34:01,352 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:01,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash -476497677, now seen corresponding path program 1 times [2025-04-30 10:34:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:01,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570368196] [2025-04-30 10:34:01,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:01,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:01,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:34:01,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:34:01,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:01,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:01,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:01,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570368196] [2025-04-30 10:34:01,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570368196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:01,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:01,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:01,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023982504] [2025-04-30 10:34:01,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:01,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:34:01,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:01,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:34:01,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:01,494 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:34:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:01,534 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2025-04-30 10:34:01,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:01,534 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:34:01,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:01,535 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:34:01,535 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:34:01,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:01,535 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:01,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 66 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:01,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:34:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-04-30 10:34:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-04-30 10:34:01,537 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 9 [2025-04-30 10:34:01,537 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:01,537 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-04-30 10:34:01,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:34:01,540 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-04-30 10:34:01,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:34:01,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:01,541 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:01,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:34:01,541 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:01,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:01,541 INFO L85 PathProgramCache]: Analyzing trace with hash -181913935, now seen corresponding path program 1 times [2025-04-30 10:34:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:01,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574302982] [2025-04-30 10:34:01,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:01,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:34:01,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:34:01,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:01,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:01,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:01,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574302982] [2025-04-30 10:34:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574302982] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:01,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107264746] [2025-04-30 10:34:01,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:01,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:01,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:01,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:01,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:34:01,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:34:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:34:01,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:01,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:01,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-30 10:34:01,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:01,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:34:01,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-30 10:34:01,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-30 10:34:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:01,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:02,119 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:34:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:02,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107264746] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:02,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:02,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-30 10:34:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751935904] [2025-04-30 10:34:02,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:02,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:34:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:02,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:34:02,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:34:02,160 INFO L87 Difference]: Start difference. First operand 50 states and 61 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:34:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:02,295 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2025-04-30 10:34:02,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:34:02,296 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 10 [2025-04-30 10:34:02,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:02,296 INFO L225 Difference]: With dead ends: 53 [2025-04-30 10:34:02,296 INFO L226 Difference]: Without dead ends: 53 [2025-04-30 10:34:02,296 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:34:02,297 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:02,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 140 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-30 10:34:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2025-04-30 10:34:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.394736842105263) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-04-30 10:34:02,300 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 10 [2025-04-30 10:34:02,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:02,300 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-04-30 10:34:02,300 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:34:02,300 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-04-30 10:34:02,300 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:34:02,300 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:02,300 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:02,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:34:02,500 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:34:02,501 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:02,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1641506446, now seen corresponding path program 1 times [2025-04-30 10:34:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:02,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541019628] [2025-04-30 10:34:02,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:02,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:02,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:02,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:02,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:02,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:02,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:02,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541019628] [2025-04-30 10:34:02,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541019628] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:02,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286431596] [2025-04-30 10:34:02,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:02,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:02,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:02,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:02,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:34:02,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:34:02,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:34:02,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:02,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:02,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:34:02,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:02,770 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-04-30 10:34:02,776 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 8 treesize of output 1 [2025-04-30 10:34:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:02,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:03,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286431596] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:03,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:03,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-04-30 10:34:03,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026825253] [2025-04-30 10:34:03,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:03,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:34:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:03,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:34:03,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:34:03,077 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:03,252 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-04-30 10:34:03,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:34:03,253 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:34:03,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:03,254 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:34:03,254 INFO L226 Difference]: Without dead ends: 46 [2025-04-30 10:34:03,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:34:03,255 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:03,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 192 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-30 10:34:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-04-30 10:34:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-04-30 10:34:03,257 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 11 [2025-04-30 10:34:03,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:03,257 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-04-30 10:34:03,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,257 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-04-30 10:34:03,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:03,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:03,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:03,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:34:03,462 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,SelfDestructingSolverStorable11 [2025-04-30 10:34:03,463 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:03,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1155458343, now seen corresponding path program 1 times [2025-04-30 10:34:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:03,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097574490] [2025-04-30 10:34:03,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:03,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:03,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:03,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:03,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:03,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:03,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097574490] [2025-04-30 10:34:03,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097574490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:03,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:03,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:34:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811113035] [2025-04-30 10:34:03,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:03,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:34:03,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:03,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:34:03,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:34:03,529 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:03,561 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-04-30 10:34:03,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:34:03,562 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-30 10:34:03,562 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:03,562 INFO L225 Difference]: With dead ends: 42 [2025-04-30 10:34:03,562 INFO L226 Difference]: Without dead ends: 42 [2025-04-30 10:34:03,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:03,562 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:03,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-30 10:34:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-04-30 10:34:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-04-30 10:34:03,564 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 12 [2025-04-30 10:34:03,564 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:03,564 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-04-30 10:34:03,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,564 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-04-30 10:34:03,564 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:03,564 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:03,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:03,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:34:03,565 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:03,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1155458342, now seen corresponding path program 1 times [2025-04-30 10:34:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:03,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541036784] [2025-04-30 10:34:03,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:03,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:03,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:03,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:03,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:03,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541036784] [2025-04-30 10:34:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541036784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:03,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:34:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409451753] [2025-04-30 10:34:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:03,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:34:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:03,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:34:03,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:03,684 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:03,739 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-04-30 10:34:03,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:34:03,739 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-30 10:34:03,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:03,739 INFO L225 Difference]: With dead ends: 55 [2025-04-30 10:34:03,739 INFO L226 Difference]: Without dead ends: 55 [2025-04-30 10:34:03,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:34:03,740 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:03,740 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 103 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-30 10:34:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2025-04-30 10:34:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-04-30 10:34:03,745 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 12 [2025-04-30 10:34:03,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:03,745 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-04-30 10:34:03,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,745 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-04-30 10:34:03,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:34:03,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:03,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:03,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:34:03,745 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:03,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:03,746 INFO L85 PathProgramCache]: Analyzing trace with hash -652901795, now seen corresponding path program 1 times [2025-04-30 10:34:03,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:03,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691956910] [2025-04-30 10:34:03,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:03,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:03,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:34:03,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:34:03,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:03,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:03,897 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:34:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:03,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691956910] [2025-04-30 10:34:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691956910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:03,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:03,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:34:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289847336] [2025-04-30 10:34:03,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:03,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:34:03,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:03,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:34:03,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:34:03,899 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:03,924 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-04-30 10:34:03,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:34:03,924 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-30 10:34:03,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:03,925 INFO L225 Difference]: With dead ends: 43 [2025-04-30 10:34:03,925 INFO L226 Difference]: Without dead ends: 43 [2025-04-30 10:34:03,925 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:34:03,925 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:03,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-30 10:34:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2025-04-30 10:34:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 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:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-04-30 10:34:03,927 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 12 [2025-04-30 10:34:03,927 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:03,927 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-04-30 10:34:03,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:03,927 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-04-30 10:34:03,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:34:03,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:03,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:03,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:34:03,928 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:03,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1903401116, now seen corresponding path program 1 times [2025-04-30 10:34:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:03,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983411916] [2025-04-30 10:34:03,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:03,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:34:03,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:34:03,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:03,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:03,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:03,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983411916] [2025-04-30 10:34:03,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983411916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:03,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:03,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:34:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117717241] [2025-04-30 10:34:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:03,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:34:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:03,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:34:03,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:34:03,976 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:04,021 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-04-30 10:34:04,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:34:04,022 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:34:04,022 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:04,022 INFO L225 Difference]: With dead ends: 40 [2025-04-30 10:34:04,022 INFO L226 Difference]: Without dead ends: 40 [2025-04-30 10:34:04,022 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:34:04,023 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:04,023 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 71 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-30 10:34:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-04-30 10:34:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-04-30 10:34:04,024 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 15 [2025-04-30 10:34:04,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:04,025 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-04-30 10:34:04,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,025 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-04-30 10:34:04,025 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:34:04,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:04,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:04,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:34:04,025 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:04,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:04,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1903401117, now seen corresponding path program 1 times [2025-04-30 10:34:04,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:04,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165403643] [2025-04-30 10:34:04,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:04,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:04,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:34:04,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:34:04,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:04,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:04,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165403643] [2025-04-30 10:34:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165403643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:04,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:04,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:34:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840338740] [2025-04-30 10:34:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:04,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:34:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:04,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:34:04,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:34:04,151 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:04,229 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-04-30 10:34:04,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:34:04,229 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:34:04,229 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:04,229 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:34:04,229 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:34:04,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:34:04,230 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:04,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:34:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-04-30 10:34:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 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:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-04-30 10:34:04,231 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 15 [2025-04-30 10:34:04,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:04,231 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-04-30 10:34:04,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,231 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-04-30 10:34:04,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:34:04,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:04,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:04,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:34:04,232 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:04,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash -427090144, now seen corresponding path program 1 times [2025-04-30 10:34:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:04,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215909791] [2025-04-30 10:34:04,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:04,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:34:04,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:34:04,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:04,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:04,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215909791] [2025-04-30 10:34:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215909791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:34:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494348670] [2025-04-30 10:34:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:04,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:34:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:04,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:34:04,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:04,328 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:04,346 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-04-30 10:34:04,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:34:04,347 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-04-30 10:34:04,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:04,347 INFO L225 Difference]: With dead ends: 40 [2025-04-30 10:34:04,347 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:34:04,347 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:34:04,348 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:04,348 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:34:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-30 10:34:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-04-30 10:34:04,350 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2025-04-30 10:34:04,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:04,350 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-04-30 10:34:04,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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:04,350 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-04-30 10:34:04,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:34:04,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:04,351 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:04,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:34:04,351 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:04,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash -354843291, now seen corresponding path program 1 times [2025-04-30 10:34:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:04,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840391446] [2025-04-30 10:34:04,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:04,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:34:04,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:34:04,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:04,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:04,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:04,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840391446] [2025-04-30 10:34:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840391446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:34:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555648436] [2025-04-30 10:34:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:04,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:34:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:04,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:34:04,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:34:04,498 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:04,565 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-04-30 10:34:04,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:34:04,566 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-30 10:34:04,566 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:04,566 INFO L225 Difference]: With dead ends: 52 [2025-04-30 10:34:04,566 INFO L226 Difference]: Without dead ends: 52 [2025-04-30 10:34:04,567 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:34:04,567 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:04,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 145 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-30 10:34:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-04-30 10:34:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.2040816326530612) 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:34:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-04-30 10:34:04,570 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 20 [2025-04-30 10:34:04,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:04,570 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-04-30 10:34:04,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,571 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-04-30 10:34:04,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:34:04,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:04,571 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:04,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:34:04,571 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:04,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash -354841625, now seen corresponding path program 1 times [2025-04-30 10:34:04,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:04,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487687007] [2025-04-30 10:34:04,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:04,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:04,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:34:04,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:34:04,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:04,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:04,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:04,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487687007] [2025-04-30 10:34:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487687007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:04,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:04,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:34:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616179446] [2025-04-30 10:34:04,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:04,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:34:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:04,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:34:04,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:34:04,708 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:04,753 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2025-04-30 10:34:04,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:34:04,754 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-30 10:34:04,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:04,754 INFO L225 Difference]: With dead ends: 80 [2025-04-30 10:34:04,754 INFO L226 Difference]: Without dead ends: 66 [2025-04-30 10:34:04,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:34:04,754 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:04,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 152 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:34:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-30 10:34:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-04-30 10:34:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 64 states have internal predecessors, (74), 0 states have call successors, (0), 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:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-04-30 10:34:04,756 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2025-04-30 10:34:04,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:04,757 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-04-30 10:34:04,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,757 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-04-30 10:34:04,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:34:04,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:04,757 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:04,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:34:04,757 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:04,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1943191193, now seen corresponding path program 1 times [2025-04-30 10:34:04,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:04,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432575064] [2025-04-30 10:34:04,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:04,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:04,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:34:04,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:34:04,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:04,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:04,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432575064] [2025-04-30 10:34:04,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432575064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:04,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:04,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-30 10:34:04,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885662787] [2025-04-30 10:34:04,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:04,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:34:04,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:04,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:34:04,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:34:04,919 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:04,998 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2025-04-30 10:34:04,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:34:04,998 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-30 10:34:04,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:04,999 INFO L225 Difference]: With dead ends: 96 [2025-04-30 10:34:04,999 INFO L226 Difference]: Without dead ends: 85 [2025-04-30 10:34:04,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:34:04,999 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:05,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 130 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-30 10:34:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2025-04-30 10:34:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 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:34:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-04-30 10:34:05,001 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 20 [2025-04-30 10:34:05,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:05,002 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-04-30 10:34:05,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:05,002 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-04-30 10:34:05,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:34:05,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:05,002 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:05,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:34:05,003 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:05,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:05,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1945980965, now seen corresponding path program 1 times [2025-04-30 10:34:05,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:05,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954895545] [2025-04-30 10:34:05,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:05,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:05,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:34:05,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:34:05,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:05,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:05,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:05,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954895545] [2025-04-30 10:34:05,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954895545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:34:05,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:34:05,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:34:05,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126746408] [2025-04-30 10:34:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:34:05,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:34:05,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:05,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:34:05,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:34:05,140 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:05,200 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-04-30 10:34:05,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:34:05,201 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-30 10:34:05,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:05,201 INFO L225 Difference]: With dead ends: 103 [2025-04-30 10:34:05,201 INFO L226 Difference]: Without dead ends: 91 [2025-04-30 10:34:05,201 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:34:05,202 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:05,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 144 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-30 10:34:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2025-04-30 10:34:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 68 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:34:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-04-30 10:34:05,204 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 20 [2025-04-30 10:34:05,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:05,204 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-04-30 10:34:05,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:05,205 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2025-04-30 10:34:05,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:34:05,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:05,205 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:05,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:34:05,205 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:05,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1760022973, now seen corresponding path program 1 times [2025-04-30 10:34:05,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:05,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715273580] [2025-04-30 10:34:05,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:05,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:05,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:34:05,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:34:05,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:05,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:05,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:05,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715273580] [2025-04-30 10:34:05,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715273580] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:05,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284582198] [2025-04-30 10:34:05,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:05,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:05,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:05,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:05,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:34:05,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:34:05,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:34:05,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:05,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:05,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:34:05,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:05,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:05,706 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:05,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284582198] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:05,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:05,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-04-30 10:34:05,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364137666] [2025-04-30 10:34:05,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:05,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:34:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:05,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:34:05,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:34:05,729 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:05,969 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2025-04-30 10:34:05,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:34:05,970 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 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) Word has length 23 [2025-04-30 10:34:05,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:05,970 INFO L225 Difference]: With dead ends: 88 [2025-04-30 10:34:05,970 INFO L226 Difference]: Without dead ends: 88 [2025-04-30 10:34:05,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:34:05,971 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:05,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 281 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-30 10:34:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2025-04-30 10:34:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 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:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2025-04-30 10:34:05,973 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 23 [2025-04-30 10:34:05,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:05,973 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2025-04-30 10:34:05,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:05,973 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2025-04-30 10:34:05,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:34:05,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:05,973 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:05,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:06,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:06,178 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:06,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1201248415, now seen corresponding path program 1 times [2025-04-30 10:34:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:06,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450418016] [2025-04-30 10:34:06,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:06,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:34:06,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:34:06,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:06,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:06,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:06,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450418016] [2025-04-30 10:34:06,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450418016] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:06,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006163257] [2025-04-30 10:34:06,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:06,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:06,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:06,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:06,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:34:06,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:34:06,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:34:06,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:06,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:06,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:34:06,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:06,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:06,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:06,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006163257] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:06,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-30 10:34:06,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993232932] [2025-04-30 10:34:06,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:06,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:34:06,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:06,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:34:06,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:34:06,609 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 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:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:06,760 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2025-04-30 10:34:06,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:34:06,761 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-30 10:34:06,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:06,761 INFO L225 Difference]: With dead ends: 107 [2025-04-30 10:34:06,761 INFO L226 Difference]: Without dead ends: 107 [2025-04-30 10:34:06,762 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:34:06,762 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:06,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 312 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-30 10:34:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2025-04-30 10:34:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.17) internal successors, (117), 101 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2025-04-30 10:34:06,764 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 23 [2025-04-30 10:34:06,764 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:06,764 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2025-04-30 10:34:06,764 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 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:06,764 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2025-04-30 10:34:06,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:34:06,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:06,765 INFO L218 NwaCegarLoop]: trace histogram [3, 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:34:06,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:34:06,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:06,970 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:06,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:06,970 INFO L85 PathProgramCache]: Analyzing trace with hash -155451323, now seen corresponding path program 2 times [2025-04-30 10:34:06,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:06,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699807815] [2025-04-30 10:34:06,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:06,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:06,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:34:06,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:34:06,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:06,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:07,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699807815] [2025-04-30 10:34:07,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699807815] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:07,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991710896] [2025-04-30 10:34:07,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:07,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:07,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:07,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:07,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:34:07,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:34:07,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:34:07,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:07,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:07,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-30 10:34:07,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:07,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:07,760 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:34:07,762 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:07,763 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 17 treesize of output 10 [2025-04-30 10:34:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:07,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:07,920 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:07,922 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 24 treesize of output 20 [2025-04-30 10:34:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:08,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991710896] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:08,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:08,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 36 [2025-04-30 10:34:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167581058] [2025-04-30 10:34:08,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:08,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-30 10:34:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:08,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-30 10:34:08,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1139, Unknown=0, NotChecked=0, Total=1260 [2025-04-30 10:34:08,087 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:08,633 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2025-04-30 10:34:08,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:34:08,634 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 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) Word has length 28 [2025-04-30 10:34:08,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:08,634 INFO L225 Difference]: With dead ends: 167 [2025-04-30 10:34:08,634 INFO L226 Difference]: Without dead ends: 151 [2025-04-30 10:34:08,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=2489, Unknown=0, NotChecked=0, Total=2756 [2025-04-30 10:34:08,636 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 86 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:08,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 412 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-30 10:34:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 139. [2025-04-30 10:34:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 138 states have internal predecessors, (158), 0 states have call successors, (0), 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,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2025-04-30 10:34:08,639 INFO L79 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 28 [2025-04-30 10:34:08,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:08,639 INFO L485 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2025-04-30 10:34:08,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:08,639 INFO L278 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2025-04-30 10:34:08,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:34:08,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:08,639 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:08,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:34:08,844 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,SelfDestructingSolverStorable24 [2025-04-30 10:34:08,844 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:08,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash -958145893, now seen corresponding path program 3 times [2025-04-30 10:34:08,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:08,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150242936] [2025-04-30 10:34:08,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:08,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:08,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-04-30 10:34:08,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:34:08,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:08,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:09,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150242936] [2025-04-30 10:34:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150242936] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:09,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154241985] [2025-04-30 10:34:09,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:09,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:09,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:09,094 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:09,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:34:09,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 3 equivalence classes. [2025-04-30 10:34:09,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:34:09,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:09,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:09,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-30 10:34:09,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:09,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:09,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:09,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154241985] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:09,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:09,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2025-04-30 10:34:09,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487044178] [2025-04-30 10:34:09,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:09,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-30 10:34:09,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:09,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-30 10:34:09,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:34:09,452 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 28 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:09,756 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2025-04-30 10:34:09,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:34:09,757 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 28 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-30 10:34:09,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:09,757 INFO L225 Difference]: With dead ends: 167 [2025-04-30 10:34:09,757 INFO L226 Difference]: Without dead ends: 167 [2025-04-30 10:34:09,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:34:09,758 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:09,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 409 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-30 10:34:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2025-04-30 10:34:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 0 states have call successors, (0), 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:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2025-04-30 10:34:09,761 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 31 [2025-04-30 10:34:09,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:09,762 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2025-04-30 10:34:09,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 28 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:09,762 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2025-04-30 10:34:09,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:34:09,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:09,762 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:09,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:34:09,963 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,SelfDestructingSolverStorable25 [2025-04-30 10:34:09,963 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:09,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash 36598956, now seen corresponding path program 2 times [2025-04-30 10:34:09,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:09,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541666979] [2025-04-30 10:34:09,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:09,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:09,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-30 10:34:09,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:34:09,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:09,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:10,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541666979] [2025-04-30 10:34:10,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541666979] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:10,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925160097] [2025-04-30 10:34:10,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:10,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:10,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:10,368 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:10,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:34:10,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-30 10:34:10,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:34:10,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:10,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:10,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-30 10:34:10,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:10,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:10,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:10,629 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:10,630 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:34:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925160097] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:10,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 33 [2025-04-30 10:34:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753681376] [2025-04-30 10:34:10,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:10,690 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:34:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:10,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:34:10,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:34:10,691 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:10,956 INFO L93 Difference]: Finished difference Result 278 states and 304 transitions. [2025-04-30 10:34:10,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:34:10,956 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-30 10:34:10,956 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:10,957 INFO L225 Difference]: With dead ends: 278 [2025-04-30 10:34:10,957 INFO L226 Difference]: Without dead ends: 216 [2025-04-30 10:34:10,957 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2025-04-30 10:34:10,958 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:10,958 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 402 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-04-30 10:34:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2025-04-30 10:34:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 1.148936170212766) internal successors, (216), 189 states have internal predecessors, (216), 0 states have call successors, (0), 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:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2025-04-30 10:34:10,961 INFO L79 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 31 [2025-04-30 10:34:10,961 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:10,961 INFO L485 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2025-04-30 10:34:10,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:10,961 INFO L278 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2025-04-30 10:34:10,961 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:34:10,961 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:10,962 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:10,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:11,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:11,162 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:11,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1237451790, now seen corresponding path program 3 times [2025-04-30 10:34:11,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:11,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464365513] [2025-04-30 10:34:11,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:11,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-04-30 10:34:11,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:34:11,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:11,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:11,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:11,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464365513] [2025-04-30 10:34:11,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464365513] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:11,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917075594] [2025-04-30 10:34:11,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:11,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:11,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:11,415 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:11,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:34:11,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 3 equivalence classes. [2025-04-30 10:34:11,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:34:11,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:34:11,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:11,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-30 10:34:11,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:11,512 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:34:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:11,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:11,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917075594] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:11,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-04-30 10:34:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944014811] [2025-04-30 10:34:11,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:11,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:34:11,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:11,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:34:11,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:34:11,837 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:12,013 INFO L93 Difference]: Finished difference Result 233 states and 262 transitions. [2025-04-30 10:34:12,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:34:12,014 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 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 34 [2025-04-30 10:34:12,014 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:12,014 INFO L225 Difference]: With dead ends: 233 [2025-04-30 10:34:12,015 INFO L226 Difference]: Without dead ends: 233 [2025-04-30 10:34:12,015 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:34:12,015 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:12,015 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 253 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:34:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-30 10:34:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2025-04-30 10:34:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 229 states have (on average 1.1441048034934498) internal successors, (262), 230 states have internal predecessors, (262), 0 states have call successors, (0), 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:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 262 transitions. [2025-04-30 10:34:12,019 INFO L79 Accepts]: Start accepts. Automaton has 231 states and 262 transitions. Word has length 34 [2025-04-30 10:34:12,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:12,019 INFO L485 AbstractCegarLoop]: Abstraction has 231 states and 262 transitions. [2025-04-30 10:34:12,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:12,019 INFO L278 IsEmpty]: Start isEmpty. Operand 231 states and 262 transitions. [2025-04-30 10:34:12,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:34:12,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:12,020 INFO L218 NwaCegarLoop]: trace histogram [4, 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:34:12,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:34:12,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-30 10:34:12,224 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:12,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash 400085543, now seen corresponding path program 4 times [2025-04-30 10:34:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:12,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060368228] [2025-04-30 10:34:12,225 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:12,231 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:34:12,237 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 36 statements. [2025-04-30 10:34:12,238 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:12,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:12,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:12,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060368228] [2025-04-30 10:34:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060368228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:12,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015860234] [2025-04-30 10:34:12,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:12,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:12,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:12,643 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:12,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:34:12,692 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:34:12,707 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 36 statements. [2025-04-30 10:34:12,707 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:12,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:12,712 WARN L254 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-04-30 10:34:12,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:12,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:34:12,876 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-30 10:34:13,519 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-30 10:34:13,520 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 26 [2025-04-30 10:34:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:13,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:13,794 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 48 treesize of output 42 [2025-04-30 10:34:13,804 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:13,805 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 56 treesize of output 46 [2025-04-30 10:34:13,841 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-30 10:34:13,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-04-30 10:34:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:14,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015860234] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:14,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:14,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 56 [2025-04-30 10:34:14,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051245631] [2025-04-30 10:34:14,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:14,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-30 10:34:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:14,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-30 10:34:14,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2841, Unknown=0, NotChecked=0, Total=3080 [2025-04-30 10:34:14,067 INFO L87 Difference]: Start difference. First operand 231 states and 262 transitions. Second operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 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:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:15,623 INFO L93 Difference]: Finished difference Result 395 states and 436 transitions. [2025-04-30 10:34:15,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-30 10:34:15,624 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 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:34:15,624 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:15,624 INFO L225 Difference]: With dead ends: 395 [2025-04-30 10:34:15,624 INFO L226 Difference]: Without dead ends: 325 [2025-04-30 10:34:15,626 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=741, Invalid=9359, Unknown=0, NotChecked=0, Total=10100 [2025-04-30 10:34:15,627 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 116 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:15,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 354 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:34:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-04-30 10:34:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 299. [2025-04-30 10:34:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 297 states have (on average 1.138047138047138) internal successors, (338), 298 states have internal predecessors, (338), 0 states have call successors, (0), 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:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 338 transitions. [2025-04-30 10:34:15,635 INFO L79 Accepts]: Start accepts. Automaton has 299 states and 338 transitions. Word has length 36 [2025-04-30 10:34:15,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:15,637 INFO L485 AbstractCegarLoop]: Abstraction has 299 states and 338 transitions. [2025-04-30 10:34:15,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 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:15,637 INFO L278 IsEmpty]: Start isEmpty. Operand 299 states and 338 transitions. [2025-04-30 10:34:15,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:34:15,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:15,637 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:15,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:34:15,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-30 10:34:15,842 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:15,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash -427559299, now seen corresponding path program 5 times [2025-04-30 10:34:15,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:15,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654873775] [2025-04-30 10:34:15,842 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:15,848 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-04-30 10:34:15,852 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:34:15,852 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-30 10:34:15,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:16,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:16,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654873775] [2025-04-30 10:34:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654873775] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:16,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261616451] [2025-04-30 10:34:16,123 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:16,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:16,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:16,125 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:16,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:34:16,174 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-04-30 10:34:16,197 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:34:16,197 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-30 10:34:16,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:16,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-30 10:34:16,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:16,204 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:34:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:16,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:16,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261616451] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:16,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:16,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 39 [2025-04-30 10:34:16,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455786099] [2025-04-30 10:34:16,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:16,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-30 10:34:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:16,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-30 10:34:16,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1406, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:34:16,742 INFO L87 Difference]: Start difference. First operand 299 states and 338 transitions. Second operand has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:17,222 INFO L93 Difference]: Finished difference Result 373 states and 418 transitions. [2025-04-30 10:34:17,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:34:17,222 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-30 10:34:17,222 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:17,223 INFO L225 Difference]: With dead ends: 373 [2025-04-30 10:34:17,223 INFO L226 Difference]: Without dead ends: 373 [2025-04-30 10:34:17,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=2551, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:34:17,224 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 120 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:17,224 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 475 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-04-30 10:34:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 324. [2025-04-30 10:34:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 322 states have (on average 1.139751552795031) internal successors, (367), 323 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 367 transitions. [2025-04-30 10:34:17,230 INFO L79 Accepts]: Start accepts. Automaton has 324 states and 367 transitions. Word has length 39 [2025-04-30 10:34:17,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:17,230 INFO L485 AbstractCegarLoop]: Abstraction has 324 states and 367 transitions. [2025-04-30 10:34:17,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.769230769230769) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:17,231 INFO L278 IsEmpty]: Start isEmpty. Operand 324 states and 367 transitions. [2025-04-30 10:34:17,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-30 10:34:17,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:17,231 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:17,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:17,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:17,432 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:17,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash 368039167, now seen corresponding path program 4 times [2025-04-30 10:34:17,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:17,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141782318] [2025-04-30 10:34:17,432 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:17,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:34:17,451 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 42 statements. [2025-04-30 10:34:17,451 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:17,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:18,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:18,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141782318] [2025-04-30 10:34:18,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141782318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:18,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454968296] [2025-04-30 10:34:18,074 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:18,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:18,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:18,076 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:18,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:34:18,124 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-30 10:34:18,140 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 42 statements. [2025-04-30 10:34:18,140 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:18,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:18,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-30 10:34:18,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:18,153 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-30 10:34:19,154 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-30 10:34:19,154 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 40 treesize of output 39 [2025-04-30 10:34:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:19,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:20,140 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:34:20,146 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 68 treesize of output 58 [2025-04-30 10:34:20,153 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:34:20,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454968296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:20,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:20,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 54 [2025-04-30 10:34:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847549183] [2025-04-30 10:34:20,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:20,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-30 10:34:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:20,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-30 10:34:20,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2675, Unknown=0, NotChecked=0, Total=2970 [2025-04-30 10:34:20,164 INFO L87 Difference]: Start difference. First operand 324 states and 367 transitions. Second operand has 55 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 55 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:20,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:20,825 INFO L93 Difference]: Finished difference Result 350 states and 389 transitions. [2025-04-30 10:34:20,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:34:20,826 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 55 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-30 10:34:20,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:20,826 INFO L225 Difference]: With dead ends: 350 [2025-04-30 10:34:20,827 INFO L226 Difference]: Without dead ends: 209 [2025-04-30 10:34:20,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=486, Invalid=3546, Unknown=0, NotChecked=0, Total=4032 [2025-04-30 10:34:20,828 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:20,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 400 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-30 10:34:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 130. [2025-04-30 10:34:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.1317829457364341) internal successors, (146), 129 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:34:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2025-04-30 10:34:20,831 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 42 [2025-04-30 10:34:20,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:20,831 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2025-04-30 10:34:20,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 55 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:20,831 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2025-04-30 10:34:20,831 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:34:20,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:20,831 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:20,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:34:21,032 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,SelfDestructingSolverStorable30 [2025-04-30 10:34:21,033 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:21,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1354290053, now seen corresponding path program 6 times [2025-04-30 10:34:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:21,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680194817] [2025-04-30 10:34:21,033 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:21,041 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 5 equivalence classes. [2025-04-30 10:34:21,058 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:34:21,058 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:34:21,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:21,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:21,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680194817] [2025-04-30 10:34:21,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680194817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:21,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494771177] [2025-04-30 10:34:21,489 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:21,491 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:21,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:34:21,542 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 5 equivalence classes. [2025-04-30 10:34:21,568 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:34:21,569 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:34:21,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:21,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-04-30 10:34:21,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:21,740 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:34:21,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:22,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:22,153 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 19 treesize of output 17 [2025-04-30 10:34:22,155 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 28 treesize of output 24 [2025-04-30 10:34:22,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-30 10:34:22,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-04-30 10:34:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:22,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494771177] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:22,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:22,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 21] total 54 [2025-04-30 10:34:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649810327] [2025-04-30 10:34:22,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:22,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-30 10:34:22,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:22,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-30 10:34:22,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2669, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:34:22,340 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand has 54 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:22,806 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2025-04-30 10:34:22,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-30 10:34:22,806 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 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 44 [2025-04-30 10:34:22,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:22,807 INFO L225 Difference]: With dead ends: 171 [2025-04-30 10:34:22,807 INFO L226 Difference]: Without dead ends: 146 [2025-04-30 10:34:22,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=3765, Unknown=0, NotChecked=0, Total=4032 [2025-04-30 10:34:22,808 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:22,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 427 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:22,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-04-30 10:34:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2025-04-30 10:34:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.128787878787879) internal successors, (149), 132 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2025-04-30 10:34:22,811 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 44 [2025-04-30 10:34:22,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:22,811 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2025-04-30 10:34:22,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:22,811 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2025-04-30 10:34:22,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:34:22,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:22,811 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:22,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:23,012 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,SelfDestructingSolverStorable31 [2025-04-30 10:34:23,012 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:23,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1602436547, now seen corresponding path program 1 times [2025-04-30 10:34:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:23,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266971626] [2025-04-30 10:34:23,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:23,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:34:23,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:34:23,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:23,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:23,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:23,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266971626] [2025-04-30 10:34:23,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266971626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:23,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214319689] [2025-04-30 10:34:23,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:34:23,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:23,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:23,294 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:23,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:34:23,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:34:23,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:34:23,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:23,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:23,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-04-30 10:34:23,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:23,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-30 10:34:23,557 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:23,666 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:34:23,668 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:23,668 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 10 [2025-04-30 10:34:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:23,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:24,124 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 19 treesize of output 17 [2025-04-30 10:34:24,125 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 28 treesize of output 24 [2025-04-30 10:34:24,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-30 10:34:24,156 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-04-30 10:34:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:24,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214319689] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:24,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:24,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 57 [2025-04-30 10:34:24,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116388450] [2025-04-30 10:34:24,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:24,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-30 10:34:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:24,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-30 10:34:24,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=3037, Unknown=0, NotChecked=0, Total=3192 [2025-04-30 10:34:24,399 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 57 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:25,700 INFO L93 Difference]: Finished difference Result 270 states and 292 transitions. [2025-04-30 10:34:25,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-30 10:34:25,701 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 57 states have internal predecessors, (119), 0 states have call successors, (0), 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 44 [2025-04-30 10:34:25,701 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:25,701 INFO L225 Difference]: With dead ends: 270 [2025-04-30 10:34:25,702 INFO L226 Difference]: Without dead ends: 155 [2025-04-30 10:34:25,703 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=385, Invalid=7987, Unknown=0, NotChecked=0, Total=8372 [2025-04-30 10:34:25,703 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 82 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:25,703 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 773 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:34:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-30 10:34:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 139. [2025-04-30 10:34:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 138 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2025-04-30 10:34:25,705 INFO L79 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 44 [2025-04-30 10:34:25,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:25,706 INFO L485 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2025-04-30 10:34:25,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 57 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:25,706 INFO L278 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2025-04-30 10:34:25,706 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:34:25,706 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:25,706 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:25,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:25,906 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,SelfDestructingSolverStorable32 [2025-04-30 10:34:25,907 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:25,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:25,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1292025381, now seen corresponding path program 7 times [2025-04-30 10:34:25,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:25,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604555795] [2025-04-30 10:34:25,907 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:25,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:34:25,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:34:25,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:25,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:26,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:26,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604555795] [2025-04-30 10:34:26,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604555795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:26,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956708219] [2025-04-30 10:34:26,198 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:26,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:26,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:26,200 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:26,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:34:26,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-30 10:34:26,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-30 10:34:26,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:26,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:26,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-30 10:34:26,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:26,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:26,610 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956708219] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:26,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:26,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 34 [2025-04-30 10:34:26,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24001848] [2025-04-30 10:34:26,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:26,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:34:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:26,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:34:26,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:34:26,679 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 35 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:34:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:27,082 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2025-04-30 10:34:27,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:34:27,083 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 35 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 47 [2025-04-30 10:34:27,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:27,083 INFO L225 Difference]: With dead ends: 175 [2025-04-30 10:34:27,083 INFO L226 Difference]: Without dead ends: 175 [2025-04-30 10:34:27,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=1832, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:34:27,085 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:27,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 489 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-04-30 10:34:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2025-04-30 10:34:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 153 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2025-04-30 10:34:27,087 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 47 [2025-04-30 10:34:27,087 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:27,087 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2025-04-30 10:34:27,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 35 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:34:27,088 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2025-04-30 10:34:27,088 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-30 10:34:27,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:27,088 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:27,095 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:34:27,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:27,289 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:27,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 62780135, now seen corresponding path program 8 times [2025-04-30 10:34:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:27,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726284499] [2025-04-30 10:34:27,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:27,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-30 10:34:27,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:34:27,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:27,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:27,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726284499] [2025-04-30 10:34:27,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726284499] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:27,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705178509] [2025-04-30 10:34:27,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:27,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:27,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:27,562 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:27,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:34:27,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-30 10:34:27,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:34:27,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:27,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:27,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-04-30 10:34:27,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:27,718 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:27,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:27,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:27,806 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:34:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705178509] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:27,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:27,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 33 [2025-04-30 10:34:27,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12133111] [2025-04-30 10:34:27,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:27,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:34:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:27,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:34:27,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:34:27,863 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand has 33 states, 33 states have (on average 2.393939393939394) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:28,277 INFO L93 Difference]: Finished difference Result 283 states and 310 transitions. [2025-04-30 10:34:28,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:34:28,277 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.393939393939394) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-04-30 10:34:28,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:28,278 INFO L225 Difference]: With dead ends: 283 [2025-04-30 10:34:28,278 INFO L226 Difference]: Without dead ends: 169 [2025-04-30 10:34:28,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=1978, Unknown=0, NotChecked=0, Total=2162 [2025-04-30 10:34:28,278 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 90 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:28,278 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 804 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-04-30 10:34:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2025-04-30 10:34:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.117283950617284) internal successors, (181), 162 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:34:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2025-04-30 10:34:28,281 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 52 [2025-04-30 10:34:28,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:28,281 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2025-04-30 10:34:28,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.393939393939394) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:28,281 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2025-04-30 10:34:28,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-30 10:34:28,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:28,282 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:28,289 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:34:28,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:28,483 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:28,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 414296893, now seen corresponding path program 9 times [2025-04-30 10:34:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:28,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69093506] [2025-04-30 10:34:28,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:28,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 6 equivalence classes. [2025-04-30 10:34:28,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:34:28,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:34:28,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:28,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:28,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69093506] [2025-04-30 10:34:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69093506] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:28,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152307249] [2025-04-30 10:34:28,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:28,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:28,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:28,798 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:28,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:34:28,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 6 equivalence classes. [2025-04-30 10:34:28,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:34:28,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:34:28,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:28,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:34:28,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:29,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:29,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-30 10:34:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 22 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:29,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152307249] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:29,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:29,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 40 [2025-04-30 10:34:29,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665950945] [2025-04-30 10:34:29,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:29,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-30 10:34:29,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:29,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-30 10:34:29,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2025-04-30 10:34:29,314 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 41 states, 40 states have (on average 2.925) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:29,677 INFO L93 Difference]: Finished difference Result 205 states and 225 transitions. [2025-04-30 10:34:29,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:34:29,677 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.925) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-04-30 10:34:29,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:29,678 INFO L225 Difference]: With dead ends: 205 [2025-04-30 10:34:29,678 INFO L226 Difference]: Without dead ends: 205 [2025-04-30 10:34:29,678 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 83 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=407, Invalid=2455, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:34:29,678 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 102 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:29,678 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 271 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-04-30 10:34:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 178. [2025-04-30 10:34:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.11864406779661) internal successors, (198), 177 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2025-04-30 10:34:29,681 INFO L79 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 55 [2025-04-30 10:34:29,682 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:29,682 INFO L485 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2025-04-30 10:34:29,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.925) internal successors, (117), 41 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:29,682 INFO L278 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2025-04-30 10:34:29,682 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-04-30 10:34:29,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:29,682 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:29,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-30 10:34:29,883 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,SelfDestructingSolverStorable35 [2025-04-30 10:34:29,883 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:29,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash -492955963, now seen corresponding path program 10 times [2025-04-30 10:34:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:29,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760395828] [2025-04-30 10:34:29,883 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:29,889 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-04-30 10:34:29,894 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 53 of 60 statements. [2025-04-30 10:34:29,895 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:29,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 87 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:30,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:30,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760395828] [2025-04-30 10:34:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760395828] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:30,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211601728] [2025-04-30 10:34:30,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:30,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:30,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:30,934 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:30,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:34:30,991 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-04-30 10:34:31,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 53 of 60 statements. [2025-04-30 10:34:31,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:31,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:31,013 WARN L254 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-04-30 10:34:31,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:31,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:34:31,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-04-30 10:34:38,636 INFO L325 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2025-04-30 10:34:38,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 50 [2025-04-30 10:34:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 34 proven. 67 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:38,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:39,823 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 97 treesize of output 85 [2025-04-30 10:34:39,826 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:34:39,826 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 113 treesize of output 91 [2025-04-30 10:34:39,898 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 35 treesize of output 31 [2025-04-30 10:34:39,899 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 37 treesize of output 33 [2025-04-30 10:34:40,573 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-30 10:34:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 38 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:40,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211601728] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:40,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:40,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 40, 40] total 105 [2025-04-30 10:34:40,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010384339] [2025-04-30 10:34:40,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:40,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2025-04-30 10:34:40,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:40,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2025-04-30 10:34:40,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=10163, Unknown=20, NotChecked=0, Total=10920 [2025-04-30 10:34:40,579 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand has 105 states, 105 states have (on average 1.5523809523809524) internal successors, (163), 105 states have internal predecessors, (163), 0 states have call successors, (0), 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:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:46,179 INFO L93 Difference]: Finished difference Result 426 states and 463 transitions. [2025-04-30 10:34:46,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-04-30 10:34:46,179 INFO L79 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.5523809523809524) internal successors, (163), 105 states have internal predecessors, (163), 0 states have call successors, (0), 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 60 [2025-04-30 10:34:46,179 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:46,180 INFO L225 Difference]: With dead ends: 426 [2025-04-30 10:34:46,180 INFO L226 Difference]: Without dead ends: 215 [2025-04-30 10:34:46,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13804 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=2729, Invalid=35471, Unknown=20, NotChecked=0, Total=38220 [2025-04-30 10:34:46,182 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 129 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 3125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:46,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 609 Invalid, 3144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3125 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-30 10:34:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-04-30 10:34:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 187. [2025-04-30 10:34:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.1129032258064515) internal successors, (207), 186 states have internal predecessors, (207), 0 states have call successors, (0), 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:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2025-04-30 10:34:46,185 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 60 [2025-04-30 10:34:46,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:46,185 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2025-04-30 10:34:46,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.5523809523809524) internal successors, (163), 105 states have internal predecessors, (163), 0 states have call successors, (0), 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:46,185 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2025-04-30 10:34:46,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-30 10:34:46,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:46,186 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:46,192 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:34:46,386 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,SelfDestructingSolverStorable36 [2025-04-30 10:34:46,386 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:46,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:46,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1398216987, now seen corresponding path program 11 times [2025-04-30 10:34:46,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:46,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326964349] [2025-04-30 10:34:46,387 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:46,393 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 7 equivalence classes. [2025-04-30 10:34:46,399 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:34:46,399 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-30 10:34:46,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:46,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326964349] [2025-04-30 10:34:46,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326964349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:46,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194557253] [2025-04-30 10:34:46,674 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:34:46,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:46,675 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:46,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-30 10:34:46,735 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 7 equivalence classes. [2025-04-30 10:34:46,765 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:34:46,766 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-30 10:34:46,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:46,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-04-30 10:34:46,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:46,772 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:34:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:47,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194557253] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:47,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 49 [2025-04-30 10:34:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296171639] [2025-04-30 10:34:47,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:47,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-30 10:34:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:47,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-30 10:34:47,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2190, Unknown=0, NotChecked=0, Total=2450 [2025-04-30 10:34:47,525 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand has 50 states, 49 states have (on average 3.122448979591837) internal successors, (153), 50 states have internal predecessors, (153), 0 states have call successors, (0), 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:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:48,090 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2025-04-30 10:34:48,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-30 10:34:48,090 INFO L79 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.122448979591837) internal successors, (153), 50 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-04-30 10:34:48,090 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:48,091 INFO L225 Difference]: With dead ends: 235 [2025-04-30 10:34:48,091 INFO L226 Difference]: Without dead ends: 235 [2025-04-30 10:34:48,091 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=434, Invalid=3726, Unknown=0, NotChecked=0, Total=4160 [2025-04-30 10:34:48,092 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 96 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:48,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 846 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:34:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-30 10:34:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 202. [2025-04-30 10:34:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.1144278606965174) internal successors, (224), 201 states have internal predecessors, (224), 0 states have call successors, (0), 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:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2025-04-30 10:34:48,095 INFO L79 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 63 [2025-04-30 10:34:48,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:48,095 INFO L485 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2025-04-30 10:34:48,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.122448979591837) internal successors, (153), 50 states have internal predecessors, (153), 0 states have call successors, (0), 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:48,095 INFO L278 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2025-04-30 10:34:48,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-30 10:34:48,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:48,096 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:48,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-30 10:34:48,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-30 10:34:48,296 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:48,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash 36217767, now seen corresponding path program 12 times [2025-04-30 10:34:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:48,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336120953] [2025-04-30 10:34:48,296 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:48,306 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 8 equivalence classes. [2025-04-30 10:34:48,320 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:34:48,320 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-30 10:34:48,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 20 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:48,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:48,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336120953] [2025-04-30 10:34:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336120953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:48,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580738648] [2025-04-30 10:34:48,916 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:34:48,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:48,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:48,918 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:48,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-30 10:34:48,984 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 8 equivalence classes. [2025-04-30 10:34:49,027 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:34:49,027 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-04-30 10:34:49,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:49,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-04-30 10:34:49,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:49,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:49,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:49,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:49,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:34:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:49,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580738648] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:49,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:49,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23, 23] total 53 [2025-04-30 10:34:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216491933] [2025-04-30 10:34:49,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:49,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-30 10:34:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:49,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-30 10:34:49,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2606, Unknown=0, NotChecked=0, Total=2756 [2025-04-30 10:34:49,571 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 53 states, 53 states have (on average 2.5660377358490565) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 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:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:50,843 INFO L93 Difference]: Finished difference Result 438 states and 474 transitions. [2025-04-30 10:34:50,843 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-30 10:34:50,844 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.5660377358490565) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 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 68 [2025-04-30 10:34:50,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:50,844 INFO L225 Difference]: With dead ends: 438 [2025-04-30 10:34:50,844 INFO L226 Difference]: Without dead ends: 242 [2025-04-30 10:34:50,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=368, Invalid=7822, Unknown=0, NotChecked=0, Total=8190 [2025-04-30 10:34:50,845 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 124 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:50,845 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1425 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:34:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-04-30 10:34:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 211. [2025-04-30 10:34:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.1095238095238096) internal successors, (233), 210 states have internal predecessors, (233), 0 states have call successors, (0), 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:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 233 transitions. [2025-04-30 10:34:50,847 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 233 transitions. Word has length 68 [2025-04-30 10:34:50,847 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:50,847 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 233 transitions. [2025-04-30 10:34:50,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.5660377358490565) internal successors, (136), 53 states have internal predecessors, (136), 0 states have call successors, (0), 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:50,848 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 233 transitions. [2025-04-30 10:34:50,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-30 10:34:50,848 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:50,848 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:50,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-30 10:34:51,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:51,049 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:51,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash 29159421, now seen corresponding path program 13 times [2025-04-30 10:34:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:51,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617611564] [2025-04-30 10:34:51,049 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:51,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:34:51,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:34:51,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:51,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 35 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:51,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:51,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617611564] [2025-04-30 10:34:51,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617611564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:51,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579212260] [2025-04-30 10:34:51,439 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:34:51,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:51,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:51,441 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:51,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-30 10:34:51,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-30 10:34:51,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-30 10:34:51,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:34:51,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:51,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-30 10:34:51,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 51 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:51,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:52,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-30 10:34:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 51 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:52,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579212260] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:52,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 46 [2025-04-30 10:34:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475326240] [2025-04-30 10:34:52,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:52,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-30 10:34:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:52,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-30 10:34:52,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1939, Unknown=0, NotChecked=0, Total=2162 [2025-04-30 10:34:52,134 INFO L87 Difference]: Start difference. First operand 211 states and 233 transitions. Second operand has 47 states, 46 states have (on average 3.152173913043478) internal successors, (145), 47 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:52,747 INFO L93 Difference]: Finished difference Result 265 states and 289 transitions. [2025-04-30 10:34:52,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:34:52,747 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.152173913043478) internal successors, (145), 47 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) Word has length 71 [2025-04-30 10:34:52,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:52,748 INFO L225 Difference]: With dead ends: 265 [2025-04-30 10:34:52,748 INFO L226 Difference]: Without dead ends: 265 [2025-04-30 10:34:52,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=422, Invalid=3610, Unknown=0, NotChecked=0, Total=4032 [2025-04-30 10:34:52,749 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 159 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:52,749 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1026 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:34:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-04-30 10:34:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 226. [2025-04-30 10:34:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.1111111111111112) internal successors, (250), 225 states have internal predecessors, (250), 0 states have call successors, (0), 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:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 250 transitions. [2025-04-30 10:34:52,752 INFO L79 Accepts]: Start accepts. Automaton has 226 states and 250 transitions. Word has length 71 [2025-04-30 10:34:52,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:52,752 INFO L485 AbstractCegarLoop]: Abstraction has 226 states and 250 transitions. [2025-04-30 10:34:52,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.152173913043478) internal successors, (145), 47 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:52,752 INFO L278 IsEmpty]: Start isEmpty. Operand 226 states and 250 transitions. [2025-04-30 10:34:52,752 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-04-30 10:34:52,752 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:52,752 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:52,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-30 10:34:52,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-30 10:34:52,953 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:52,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 966773253, now seen corresponding path program 14 times [2025-04-30 10:34:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:52,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356220682] [2025-04-30 10:34:52,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:52,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:52,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-04-30 10:34:52,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-04-30 10:34:52,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:52,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:53,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356220682] [2025-04-30 10:34:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356220682] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:53,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778669645] [2025-04-30 10:34:53,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:34:53,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:53,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:53,424 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:53,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-30 10:34:53,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-04-30 10:34:53,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-04-30 10:34:53,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:34:53,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:53,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-04-30 10:34:53,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:53,729 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:34:53,749 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:34:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:53,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:53,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-04-30 10:34:53,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-04-30 10:34:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:54,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778669645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:54,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:54,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29, 25] total 56 [2025-04-30 10:34:54,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929890772] [2025-04-30 10:34:54,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:54,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-04-30 10:34:54,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:54,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-04-30 10:34:54,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2906, Unknown=0, NotChecked=0, Total=3080 [2025-04-30 10:34:54,221 INFO L87 Difference]: Start difference. First operand 226 states and 250 transitions. Second operand has 56 states, 56 states have (on average 2.5) internal successors, (140), 56 states have internal predecessors, (140), 0 states have call successors, (0), 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:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:55,495 INFO L93 Difference]: Finished difference Result 452 states and 493 transitions. [2025-04-30 10:34:55,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-30 10:34:55,495 INFO L79 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.5) internal successors, (140), 56 states have internal predecessors, (140), 0 states have call successors, (0), 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:34:55,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:55,496 INFO L225 Difference]: With dead ends: 452 [2025-04-30 10:34:55,496 INFO L226 Difference]: Without dead ends: 269 [2025-04-30 10:34:55,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=512, Invalid=9190, Unknown=0, NotChecked=0, Total=9702 [2025-04-30 10:34:55,497 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 168 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:55,497 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1712 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:34:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-04-30 10:34:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 235. [2025-04-30 10:34:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.106837606837607) internal successors, (259), 234 states have internal predecessors, (259), 0 states have call successors, (0), 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:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 259 transitions. [2025-04-30 10:34:55,500 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 259 transitions. Word has length 76 [2025-04-30 10:34:55,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:55,500 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 259 transitions. [2025-04-30 10:34:55,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.5) internal successors, (140), 56 states have internal predecessors, (140), 0 states have call successors, (0), 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:55,500 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 259 transitions. [2025-04-30 10:34:55,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-04-30 10:34:55,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:55,501 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:55,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-30 10:34:55,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:55,701 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:55,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2061148069, now seen corresponding path program 15 times [2025-04-30 10:34:55,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:55,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000133014] [2025-04-30 10:34:55,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:55,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 9 equivalence classes. [2025-04-30 10:34:55,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:34:55,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-30 10:34:55,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 51 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:56,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:34:56,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000133014] [2025-04-30 10:34:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000133014] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:34:56,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804130145] [2025-04-30 10:34:56,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:34:56,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:34:56,393 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:34:56,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-30 10:34:56,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 9 equivalence classes. [2025-04-30 10:34:56,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 79 of 79 statements. [2025-04-30 10:34:56,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-30 10:34:56,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:34:56,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-04-30 10:34:56,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:34:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:56,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:57,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-30 10:34:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 70 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:34:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804130145] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:57,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 53 [2025-04-30 10:34:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74191082] [2025-04-30 10:34:57,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:57,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-30 10:34:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:57,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-30 10:34:57,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2533, Unknown=0, NotChecked=0, Total=2862 [2025-04-30 10:34:57,297 INFO L87 Difference]: Start difference. First operand 235 states and 259 transitions. Second operand has 54 states, 53 states have (on average 3.150943396226415) internal successors, (167), 54 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:57,998 INFO L93 Difference]: Finished difference Result 295 states and 321 transitions. [2025-04-30 10:34:57,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-30 10:34:57,999 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 3.150943396226415) internal successors, (167), 54 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-04-30 10:34:57,999 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:57,999 INFO L225 Difference]: With dead ends: 295 [2025-04-30 10:34:57,999 INFO L226 Difference]: Without dead ends: 295 [2025-04-30 10:34:58,000 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 122 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=859, Invalid=5621, Unknown=0, NotChecked=0, Total=6480 [2025-04-30 10:34:58,000 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 264 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:58,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 298 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:34:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-04-30 10:34:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 250. [2025-04-30 10:34:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.108433734939759) internal successors, (276), 249 states have internal predecessors, (276), 0 states have call successors, (0), 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:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 276 transitions. [2025-04-30 10:34:58,004 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 276 transitions. Word has length 79 [2025-04-30 10:34:58,004 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:58,004 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 276 transitions. [2025-04-30 10:34:58,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 3.150943396226415) internal successors, (167), 54 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:58,004 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 276 transitions. [2025-04-30 10:34:58,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-04-30 10:34:58,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:34:58,004 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:58,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-30 10:34:58,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:34:58,205 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2025-04-30 10:34:58,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:34:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1449452647, now seen corresponding path program 16 times [2025-04-30 10:34:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:34:58,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954012056] [2025-04-30 10:34:58,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:34:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:34:58,212 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 84 statements into 2 equivalence classes. [2025-04-30 10:34:58,221 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 84 statements. [2025-04-30 10:34:58,221 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:34:58,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 198 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:35:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:00,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954012056] [2025-04-30 10:35:00,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954012056] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:35:00,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270494812] [2025-04-30 10:35:00,451 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:35:00,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:35:00,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:00,453 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:35:00,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-30 10:35:00,525 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 84 statements into 2 equivalence classes. [2025-04-30 10:35:00,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 74 of 84 statements. [2025-04-30 10:35:00,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:35:00,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:00,563 WARN L254 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 164 conjuncts are in the unsatisfiable core [2025-04-30 10:35:00,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... Killed by 15