./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemrchr-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_cmemrchr-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 3a34687129125cc08371e7bb78f7bdb7a4f5274a9b22928fd388f593b6db6995 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:33:35,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:33:35,385 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:35,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:33:35,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:33:35,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:33:35,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:33:35,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:33:35,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:33:35,416 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:33:35,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:33:35,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:33:35,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:33:35,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:33:35,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:33:35,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:33:35,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:35,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:33:35,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:33:35,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:33:35,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:35,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:33:35,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:33:35,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:33:35,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:33:35,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:33:35,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:33:35,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:33:35,419 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 -> 3a34687129125cc08371e7bb78f7bdb7a4f5274a9b22928fd388f593b6db6995 [2025-04-30 10:33:35,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:33:35,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:33:35,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:33:35,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:33:35,663 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:33:35,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemrchr-alloca-2.i [2025-04-30 10:33:36,993 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817df76ed/767a3a1079194858a9e51586af10928d/FLAGa85ccdeac [2025-04-30 10:33:37,241 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:33:37,245 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cmemrchr-alloca-2.i [2025-04-30 10:33:37,257 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817df76ed/767a3a1079194858a9e51586af10928d/FLAGa85ccdeac [2025-04-30 10:33:38,043 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817df76ed/767a3a1079194858a9e51586af10928d [2025-04-30 10:33:38,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:33:38,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:33:38,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:38,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:33:38,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:33:38,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:38" (1/1) ... [2025-04-30 10:33:38,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da696e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:38, skipping insertion in model container [2025-04-30 10:33:38,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:33:38" (1/1) ... [2025-04-30 10:33:38,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:33:38,271 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:38,283 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:38,290 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:38,292 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:38,303 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:33:38,362 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:33:38,386 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:33:38,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:38 WrapperNode [2025-04-30 10:33:38,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:33:38,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:38,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:33:38,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:33:38,392 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:38" (1/1) ... [2025-04-30 10:33:38,401 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:38" (1/1) ... [2025-04-30 10:33:38,420 INFO L138 Inliner]: procedures = 117, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2025-04-30 10:33:38,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:33:38,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:33:38,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:33:38,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:33:38,428 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:38" (1/1) ... [2025-04-30 10:33:38,429 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:38" (1/1) ... [2025-04-30 10:33:38,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:38" (1/1) ... [2025-04-30 10:33:38,449 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-04-30 10:33:38,453 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:38" (1/1) ... [2025-04-30 10:33:38,453 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:38" (1/1) ... [2025-04-30 10:33:38,457 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:38" (1/1) ... [2025-04-30 10:33:38,461 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:38" (1/1) ... [2025-04-30 10:33:38,464 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:38" (1/1) ... [2025-04-30 10:33:38,467 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:38" (1/1) ... [2025-04-30 10:33:38,468 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:38" (1/1) ... [2025-04-30 10:33:38,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:33:38,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:33:38,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:33:38,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:33:38,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:38" (1/1) ... [2025-04-30 10:33:38,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:33:38,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:38,499 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:38,502 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:38,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:33:38,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:33:38,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:33:38,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:33:38,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:33:38,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:33:38,596 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:33:38,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:33:38,712 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-04-30 10:33:38,712 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:33:38,718 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:33:38,718 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:33:38,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:38 BoogieIcfgContainer [2025-04-30 10:33:38,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:33:38,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:33:38,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:33:38,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:33:38,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:33:38" (1/3) ... [2025-04-30 10:33:38,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c97d330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:38, skipping insertion in model container [2025-04-30 10:33:38,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:33:38" (2/3) ... [2025-04-30 10:33:38,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c97d330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:33:38, skipping insertion in model container [2025-04-30 10:33:38,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:38" (3/3) ... [2025-04-30 10:33:38,725 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cmemrchr-alloca-2.i [2025-04-30 10:33:38,737 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:33:38,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cmemrchr-alloca-2.i that has 1 procedures, 23 locations, 29 edges, 1 initial locations, 2 loop locations, and 5 error locations. [2025-04-30 10:33:38,772 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:33:38,783 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;@34dc2db0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:33:38,783 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-30 10:33:38,786 INFO L278 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:38,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:38,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:38,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:38,791 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:38,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028968, now seen corresponding path program 1 times [2025-04-30 10:33:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:38,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070161763] [2025-04-30 10:33:38,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:38,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:38,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:38,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:38,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:39,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:39,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070161763] [2025-04-30 10:33:39,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070161763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:39,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:39,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:39,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18545009] [2025-04-30 10:33:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:39,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:39,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:39,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:39,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:39,184 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:39,245 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2025-04-30 10:33:39,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:39,247 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:33:39,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:39,252 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:33:39,252 INFO L226 Difference]: Without dead ends: 25 [2025-04-30 10:33:39,253 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:39,258 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:39,258 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-30 10:33:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2025-04-30 10:33:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.5625) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-04-30 10:33:39,281 INFO L79 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 7 [2025-04-30 10:33:39,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:39,281 INFO L485 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-04-30 10:33:39,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,282 INFO L278 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-04-30 10:33:39,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:39,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:39,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:39,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:33:39,283 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:39,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028969, now seen corresponding path program 1 times [2025-04-30 10:33:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:39,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43468007] [2025-04-30 10:33:39,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:39,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:39,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:39,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:39,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:39,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:39,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43468007] [2025-04-30 10:33:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43468007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:39,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:39,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035342810] [2025-04-30 10:33:39,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:39,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:39,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:39,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:39,445 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:39,489 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-04-30 10:33:39,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:39,490 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:33:39,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:39,490 INFO L225 Difference]: With dead ends: 28 [2025-04-30 10:33:39,490 INFO L226 Difference]: Without dead ends: 28 [2025-04-30 10:33:39,490 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:39,492 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:39,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-30 10:33:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2025-04-30 10:33:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-04-30 10:33:39,496 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 7 [2025-04-30 10:33:39,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:39,497 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-04-30 10:33:39,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,497 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-04-30 10:33:39,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:33:39,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:39,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:39,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:33:39,498 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:39,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088551, now seen corresponding path program 1 times [2025-04-30 10:33:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:39,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317775797] [2025-04-30 10:33:39,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:39,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:33:39,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:33:39,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:39,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:39,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317775797] [2025-04-30 10:33:39,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317775797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:39,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:39,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:39,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764824114] [2025-04-30 10:33:39,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:39,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:39,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:39,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:39,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:39,666 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:39,700 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-04-30 10:33:39,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:39,701 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:33:39,701 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:39,702 INFO L225 Difference]: With dead ends: 26 [2025-04-30 10:33:39,702 INFO L226 Difference]: Without dead ends: 26 [2025-04-30 10:33:39,702 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:39,702 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:39,703 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:39,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-30 10:33:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-04-30 10:33:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.5) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-04-30 10:33:39,704 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 7 [2025-04-30 10:33:39,704 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:39,706 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-04-30 10:33:39,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,707 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-04-30 10:33:39,707 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:33:39,707 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:39,707 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:39,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:33:39,708 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:39,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash 627432691, now seen corresponding path program 1 times [2025-04-30 10:33:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:39,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524798830] [2025-04-30 10:33:39,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:39,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:39,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:39,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:39,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:39,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524798830] [2025-04-30 10:33:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524798830] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:39,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44601300] [2025-04-30 10:33:39,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:39,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:39,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:39,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:39,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:33:39,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:39,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:39,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:39,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:39,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:33:39,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:39,854 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:33:39,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:33:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44601300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:33:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:33:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977030791] [2025-04-30 10:33:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:39,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:39,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:39,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:39,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:39,855 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:39,876 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-04-30 10:33:39,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:39,877 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:33:39,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:39,877 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:33:39,878 INFO L226 Difference]: Without dead ends: 27 [2025-04-30 10:33:39,878 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:39,879 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:39,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-30 10:33:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-30 10:33:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.391304347826087) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-04-30 10:33:39,883 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 10 [2025-04-30 10:33:39,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:39,884 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-04-30 10:33:39,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:39,884 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-04-30 10:33:39,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:33:39,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:39,884 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:39,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:40,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:40,085 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:40,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1892527243, now seen corresponding path program 1 times [2025-04-30 10:33:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:40,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906384242] [2025-04-30 10:33:40,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:40,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:40,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:40,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:40,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:40,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:40,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:40,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906384242] [2025-04-30 10:33:40,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906384242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:40,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502786275] [2025-04-30 10:33:40,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:40,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:40,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:40,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:33:40,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:33:40,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:33:40,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:40,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:40,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:33:40,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:40,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-30 10:33:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:40,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502786275] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:40,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:40,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2025-04-30 10:33:40,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364261572] [2025-04-30 10:33:40,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:40,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:33:40,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:40,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:33:40,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:33:40,696 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:40,819 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-04-30 10:33:40,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:40,820 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:33:40,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:40,820 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:33:40,820 INFO L226 Difference]: Without dead ends: 27 [2025-04-30 10:33:40,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:33:40,821 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:40,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 73 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-30 10:33:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-04-30 10:33:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call 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:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-04-30 10:33:40,825 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 10 [2025-04-30 10:33:40,825 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:40,825 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-04-30 10:33:40,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:40,825 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-04-30 10:33:40,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:33:40,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:40,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:40,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:41,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:41,029 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:41,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1667580149, now seen corresponding path program 1 times [2025-04-30 10:33:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:41,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759775776] [2025-04-30 10:33:41,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:41,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:33:41,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:33:41,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:41,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:41,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:41,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759775776] [2025-04-30 10:33:41,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759775776] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:41,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:41,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319746879] [2025-04-30 10:33:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:41,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:33:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:41,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:33:41,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:33:41,087 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:33:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:41,130 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-04-30 10:33:41,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:33:41,131 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:33:41,131 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:41,131 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:33:41,132 INFO L226 Difference]: Without dead ends: 27 [2025-04-30 10:33:41,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:33:41,133 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:41,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 55 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-30 10:33:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-04-30 10:33:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-04-30 10:33:41,136 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 12 [2025-04-30 10:33:41,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:41,136 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-04-30 10:33:41,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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:33:41,137 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-04-30 10:33:41,137 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:33:41,138 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:41,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:41,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:33:41,138 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:41,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:41,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1667580150, now seen corresponding path program 1 times [2025-04-30 10:33:41,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:41,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229494578] [2025-04-30 10:33:41,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:41,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:41,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:33:41,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:33:41,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:41,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:41,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:41,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229494578] [2025-04-30 10:33:41,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229494578] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:41,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306276742] [2025-04-30 10:33:41,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:41,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:41,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:41,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:41,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:33:41,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:33:41,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:33:41,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:41,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:41,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-30 10:33:41,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:41,418 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 6 treesize of output 5 [2025-04-30 10:33:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:41,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:41,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306276742] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:41,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:33:41,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 17 [2025-04-30 10:33:41,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292773167] [2025-04-30 10:33:41,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:41,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:33:41,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:41,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:33:41,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:33:41,780 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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:33:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:41,859 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2025-04-30 10:33:41,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:41,859 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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:33:41,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:41,859 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:33:41,859 INFO L226 Difference]: Without dead ends: 27 [2025-04-30 10:33:41,860 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:33:41,860 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:41,860 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 73 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-30 10:33:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-30 10:33:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call 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:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-04-30 10:33:41,862 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 12 [2025-04-30 10:33:41,862 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:41,862 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-04-30 10:33:41,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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:33:41,863 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-04-30 10:33:41,863 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:33:41,863 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:41,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:41,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:33:42,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:42,067 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:42,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:42,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1947328776, now seen corresponding path program 1 times [2025-04-30 10:33:42,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:42,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14289294] [2025-04-30 10:33:42,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:42,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:42,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:33:42,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:33:42,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:42,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:42,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:42,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14289294] [2025-04-30 10:33:42,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14289294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:42,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:42,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:33:42,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209667367] [2025-04-30 10:33:42,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:42,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:33:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:42,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:33:42,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:33:42,250 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 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:33:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:42,305 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-04-30 10:33:42,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:33:42,305 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 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:33:42,305 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:42,305 INFO L225 Difference]: With dead ends: 30 [2025-04-30 10:33:42,305 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:33:42,306 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:33:42,306 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:42,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 68 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:33:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-04-30 10:33:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-04-30 10:33:42,308 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 12 [2025-04-30 10:33:42,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:42,308 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-04-30 10:33:42,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 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:33:42,308 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-04-30 10:33:42,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:33:42,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:42,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:42,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:33:42,308 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:42,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash 156083149, now seen corresponding path program 1 times [2025-04-30 10:33:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:42,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711906738] [2025-04-30 10:33:42,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:42,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:33:42,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:33:42,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:42,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:42,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:42,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711906738] [2025-04-30 10:33:42,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711906738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:42,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:42,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:33:42,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281714563] [2025-04-30 10:33:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:42,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:42,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:42,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:42,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:42,355 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:42,371 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-04-30 10:33:42,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:42,371 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-04-30 10:33:42,371 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:42,371 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:33:42,371 INFO L226 Difference]: Without dead ends: 31 [2025-04-30 10:33:42,372 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:42,373 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:42,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 51 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-04-30 10:33:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-04-30 10:33:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-04-30 10:33:42,374 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 13 [2025-04-30 10:33:42,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:42,375 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-04-30 10:33:42,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,375 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-04-30 10:33:42,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:33:42,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:42,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:42,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:33:42,375 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:42,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:42,375 INFO L85 PathProgramCache]: Analyzing trace with hash -236943861, now seen corresponding path program 1 times [2025-04-30 10:33:42,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:42,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715794582] [2025-04-30 10:33:42,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:42,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:42,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:33:42,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:33:42,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:42,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:42,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:42,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715794582] [2025-04-30 10:33:42,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715794582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:42,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:42,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:42,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066414637] [2025-04-30 10:33:42,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:42,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:42,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:42,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:42,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:42,463 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:42,481 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-04-30 10:33:42,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:42,481 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-04-30 10:33:42,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:42,482 INFO L225 Difference]: With dead ends: 29 [2025-04-30 10:33:42,482 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:33:42,482 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:42,482 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:42,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:33:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2025-04-30 10:33:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-04-30 10:33:42,484 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2025-04-30 10:33:42,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:42,484 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-04-30 10:33:42,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,484 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-04-30 10:33:42,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:33:42,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:42,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:42,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:33:42,484 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:42,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1006485484, now seen corresponding path program 1 times [2025-04-30 10:33:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:42,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704153640] [2025-04-30 10:33:42,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:42,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:42,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:33:42,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:33:42,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:42,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:42,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704153640] [2025-04-30 10:33:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704153640] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:42,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:42,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:33:42,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197802228] [2025-04-30 10:33:42,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:42,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:33:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:42,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:33:42,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:42,543 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:42,553 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-04-30 10:33:42,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:33:42,553 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:33:42,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:42,553 INFO L225 Difference]: With dead ends: 25 [2025-04-30 10:33:42,553 INFO L226 Difference]: Without dead ends: 22 [2025-04-30 10:33:42,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:33:42,554 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:42,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 32 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-30 10:33:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-30 10:33:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-04-30 10:33:42,555 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2025-04-30 10:33:42,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:42,555 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-04-30 10:33:42,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,555 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-04-30 10:33:42,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:42,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:42,556 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:42,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:33:42,556 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:42,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:42,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1136231622, now seen corresponding path program 1 times [2025-04-30 10:33:42,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:42,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279026728] [2025-04-30 10:33:42,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:42,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:42,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:42,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:42,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:33:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:42,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279026728] [2025-04-30 10:33:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279026728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:33:42,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:33:42,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:33:42,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331851811] [2025-04-30 10:33:42,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:33:42,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:33:42,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:42,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:33:42,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:42,629 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:42,647 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-04-30 10:33:42,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:33:42,647 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:33:42,647 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:42,647 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:33:42,647 INFO L226 Difference]: Without dead ends: 17 [2025-04-30 10:33:42,648 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:33:42,648 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:42,648 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-04-30 10:33:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-30 10:33:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:33:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-04-30 10:33:42,649 INFO L79 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2025-04-30 10:33:42,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:42,649 INFO L485 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-04-30 10:33:42,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,649 INFO L278 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-04-30 10:33:42,649 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:33:42,649 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:42,650 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:42,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:33:42,650 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:42,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1723037636, now seen corresponding path program 1 times [2025-04-30 10:33:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:42,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290062921] [2025-04-30 10:33:42,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:42,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:42,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:42,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:42,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:42,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:42,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:42,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290062921] [2025-04-30 10:33:42,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290062921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:42,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204016764] [2025-04-30 10:33:42,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:33:42,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:42,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:42,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:42,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:33:42,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:33:42,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:33:42,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:42,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:42,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:33:42,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:42,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:42,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204016764] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:42,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:42,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-30 10:33:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516348432] [2025-04-30 10:33:42,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:42,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:33:42,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:42,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:33:42,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:33:42,918 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:42,980 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-04-30 10:33:42,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:33:42,982 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-30 10:33:42,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:42,982 INFO L225 Difference]: With dead ends: 27 [2025-04-30 10:33:42,983 INFO L226 Difference]: Without dead ends: 22 [2025-04-30 10:33:42,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:33:42,983 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:42,983 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:33:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-30 10:33:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-04-30 10:33:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-04-30 10:33:42,984 INFO L79 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2025-04-30 10:33:42,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:42,984 INFO L485 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-04-30 10:33:42,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:42,984 INFO L278 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-04-30 10:33:42,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:33:42,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:42,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:42,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:43,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:43,185 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:43,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1854514094, now seen corresponding path program 2 times [2025-04-30 10:33:43,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:43,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747059811] [2025-04-30 10:33:43,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:43,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-30 10:33:43,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:33:43,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:43,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:43,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:43,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747059811] [2025-04-30 10:33:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747059811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:43,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183636418] [2025-04-30 10:33:43,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:43,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:43,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:43,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:43,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:33:43,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-30 10:33:43,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:33:43,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:43,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:43,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-30 10:33:43,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:43,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-30 10:33:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:43,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183636418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:44,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:44,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2025-04-30 10:33:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968935585] [2025-04-30 10:33:44,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:44,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-30 10:33:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:44,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-30 10:33:44,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:33:44,479 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:44,821 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-04-30 10:33:44,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:33:44,822 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 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 19 [2025-04-30 10:33:44,822 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:44,822 INFO L225 Difference]: With dead ends: 33 [2025-04-30 10:33:44,822 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:33:44,823 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2025-04-30 10:33:44,823 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:44,823 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:33:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2025-04-30 10:33:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-04-30 10:33:44,824 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2025-04-30 10:33:44,824 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:44,824 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-04-30 10:33:44,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:44,825 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-04-30 10:33:44,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:33:44,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:44,825 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:44,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:45,025 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,SelfDestructingSolverStorable13 [2025-04-30 10:33:45,025 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:45,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:45,026 INFO L85 PathProgramCache]: Analyzing trace with hash 76202482, now seen corresponding path program 3 times [2025-04-30 10:33:45,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:45,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47133460] [2025-04-30 10:33:45,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:45,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:45,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-04-30 10:33:45,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:33:45,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:33:45,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:45,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:45,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47133460] [2025-04-30 10:33:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47133460] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:45,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769449738] [2025-04-30 10:33:45,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:45,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:45,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:45,575 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:45,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:33:45,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-04-30 10:33:45,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:33:45,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:33:45,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:45,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:33:45,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:45,788 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:33:45,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:45,977 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:33:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769449738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:45,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 32 [2025-04-30 10:33:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161288391] [2025-04-30 10:33:45,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:45,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-30 10:33:45,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:45,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-30 10:33:45,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2025-04-30 10:33:45,978 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:46,450 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-04-30 10:33:46,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-30 10:33:46,451 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-30 10:33:46,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:46,451 INFO L225 Difference]: With dead ends: 42 [2025-04-30 10:33:46,451 INFO L226 Difference]: Without dead ends: 33 [2025-04-30 10:33:46,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=1775, Unknown=0, NotChecked=0, Total=1980 [2025-04-30 10:33:46,452 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:46,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:46,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-30 10:33:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-04-30 10:33:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call 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:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-04-30 10:33:46,454 INFO L79 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2025-04-30 10:33:46,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:46,454 INFO L485 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-04-30 10:33:46,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:46,455 INFO L278 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-04-30 10:33:46,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:33:46,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:46,455 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:46,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:46,659 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,SelfDestructingSolverStorable14 [2025-04-30 10:33:46,659 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:46,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash -121976956, now seen corresponding path program 4 times [2025-04-30 10:33:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:46,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606070515] [2025-04-30 10:33:46,660 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:46,667 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-30 10:33:46,682 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:33:46,682 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:33:46,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:46,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606070515] [2025-04-30 10:33:46,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606070515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:46,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739492092] [2025-04-30 10:33:46,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:33:46,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:46,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:46,803 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:46,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:33:46,842 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-30 10:33:46,861 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:33:46,861 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:33:46,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:46,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-30 10:33:46,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:46,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739492092] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:47,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-04-30 10:33:47,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879552499] [2025-04-30 10:33:47,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:47,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:33:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:47,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:33:47,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:33:47,083 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:47,209 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-04-30 10:33:47,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:33:47,210 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-30 10:33:47,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:47,210 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:33:47,210 INFO L226 Difference]: Without dead ends: 36 [2025-04-30 10:33:47,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:33:47,211 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:47,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 183 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-30 10:33:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-04-30 10:33:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call 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:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2025-04-30 10:33:47,213 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 30 [2025-04-30 10:33:47,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:47,213 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2025-04-30 10:33:47,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:47,213 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2025-04-30 10:33:47,213 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:33:47,213 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:47,213 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:47,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:33:47,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:47,414 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:47,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2027818122, now seen corresponding path program 5 times [2025-04-30 10:33:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:47,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788289055] [2025-04-30 10:33:47,415 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:33:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:47,424 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-30 10:33:47,449 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:33:47,450 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-30 10:33:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:47,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:47,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788289055] [2025-04-30 10:33:47,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788289055] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:47,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306949474] [2025-04-30 10:33:47,858 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:33:47,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:47,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:47,860 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:47,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:33:47,902 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-30 10:33:47,924 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:33:47,924 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-30 10:33:47,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:47,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:33:47,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:47,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:33:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:48,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306949474] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:49,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:49,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-04-30 10:33:49,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056485674] [2025-04-30 10:33:49,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:49,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-30 10:33:49,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:49,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-30 10:33:49,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1670, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:33:49,561 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 43 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 43 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:33:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:50,758 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-04-30 10:33:50,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-30 10:33:50,758 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 43 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) Word has length 33 [2025-04-30 10:33:50,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:50,759 INFO L225 Difference]: With dead ends: 58 [2025-04-30 10:33:50,759 INFO L226 Difference]: Without dead ends: 58 [2025-04-30 10:33:50,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=298, Invalid=3362, Unknown=0, NotChecked=0, Total=3660 [2025-04-30 10:33:50,760 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:50,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 225 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:33:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-30 10:33:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2025-04-30 10:33:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-04-30 10:33:50,763 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2025-04-30 10:33:50,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:50,763 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-04-30 10:33:50,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 43 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:33:50,763 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-04-30 10:33:50,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:33:50,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:50,764 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:50,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:50,964 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,SelfDestructingSolverStorable16 [2025-04-30 10:33:50,964 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:50,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:50,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1969614266, now seen corresponding path program 6 times [2025-04-30 10:33:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:50,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899795973] [2025-04-30 10:33:50,965 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:33:50,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:50,970 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 5 equivalence classes. [2025-04-30 10:33:50,996 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:33:50,996 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:33:50,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:51,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:51,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899795973] [2025-04-30 10:33:51,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899795973] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:51,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958964815] [2025-04-30 10:33:51,412 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:33:51,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:51,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:51,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:51,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:33:51,454 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 5 equivalence classes. [2025-04-30 10:33:51,479 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:33:51,479 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-30 10:33:51,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:51,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:33:51,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:51,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:51,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958964815] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:51,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:51,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 34 [2025-04-30 10:33:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573017108] [2025-04-30 10:33:51,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:51,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:33:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:51,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:33:51,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:33:51,800 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:52,177 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2025-04-30 10:33:52,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:33:52,178 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-30 10:33:52,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:52,178 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:33:52,178 INFO L226 Difference]: Without dead ends: 43 [2025-04-30 10:33:52,179 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2025-04-30 10:33:52,179 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:52,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 257 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:33:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-30 10:33:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-04-30 10:33:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call 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:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2025-04-30 10:33:52,181 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2025-04-30 10:33:52,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:52,181 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2025-04-30 10:33:52,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:52,181 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2025-04-30 10:33:52,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:33:52,182 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:52,182 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:52,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:33:52,386 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,SelfDestructingSolverStorable17 [2025-04-30 10:33:52,386 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:52,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash 981781896, now seen corresponding path program 7 times [2025-04-30 10:33:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:52,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198944988] [2025-04-30 10:33:52,386 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:33:52,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:52,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:33:52,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:33:52,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:52,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:52,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:52,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198944988] [2025-04-30 10:33:52,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198944988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:52,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862807187] [2025-04-30 10:33:52,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:33:52,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:52,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:52,936 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:52,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:33:52,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:33:52,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:33:52,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:33:52,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:52,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-30 10:33:53,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:53,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:33:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:53,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 35 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:54,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862807187] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:54,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:54,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 46 [2025-04-30 10:33:54,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982611704] [2025-04-30 10:33:54,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:54,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-30 10:33:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:54,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-30 10:33:54,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2001, Unknown=0, NotChecked=0, Total=2162 [2025-04-30 10:33:54,357 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 47 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:54,911 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2025-04-30 10:33:54,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-30 10:33:54,911 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 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 40 [2025-04-30 10:33:54,911 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:54,912 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:33:54,912 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:33:54,912 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=244, Invalid=2948, Unknown=0, NotChecked=0, Total=3192 [2025-04-30 10:33:54,913 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:54,913 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 288 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:33:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:33:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-04-30 10:33:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 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:33:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-04-30 10:33:54,916 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 40 [2025-04-30 10:33:54,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:54,916 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-04-30 10:33:54,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 47 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call 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:54,916 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-04-30 10:33:54,917 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:33:54,917 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:54,917 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:54,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:33:55,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:55,117 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:55,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:55,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1463193908, now seen corresponding path program 8 times [2025-04-30 10:33:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:55,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850465284] [2025-04-30 10:33:55,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:55,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:55,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-30 10:33:55,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:33:55,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:55,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:55,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850465284] [2025-04-30 10:33:55,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850465284] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:55,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109021330] [2025-04-30 10:33:55,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:33:55,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:55,318 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:55,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:33:55,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-30 10:33:55,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:33:55,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:33:55,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:55,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:33:55,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:55,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:33:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:33:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109021330] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:33:55,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:33:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-04-30 10:33:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361458334] [2025-04-30 10:33:55,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:33:55,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-30 10:33:55,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:33:55,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-30 10:33:55,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2025-04-30 10:33:55,739 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:33:56,000 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2025-04-30 10:33:56,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:33:56,000 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-30 10:33:56,000 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:33:56,000 INFO L225 Difference]: With dead ends: 71 [2025-04-30 10:33:56,000 INFO L226 Difference]: Without dead ends: 50 [2025-04-30 10:33:56,001 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:33:56,001 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:33:56,001 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 413 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:33:56,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-30 10:33:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-04-30 10:33:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 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:33:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-04-30 10:33:56,004 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 44 [2025-04-30 10:33:56,004 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:33:56,004 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-04-30 10:33:56,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 31 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:33:56,005 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-04-30 10:33:56,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-30 10:33:56,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:33:56,005 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:33:56,011 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:33:56,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:56,206 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-04-30 10:33:56,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:33:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1127467838, now seen corresponding path program 9 times [2025-04-30 10:33:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:33:56,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849959508] [2025-04-30 10:33:56,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:56,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:33:56,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 7 equivalence classes. [2025-04-30 10:33:56,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 44 of 47 statements. [2025-04-30 10:33:56,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:33:56,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-30 10:33:56,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:33:56,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849959508] [2025-04-30 10:33:56,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849959508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:33:56,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830752708] [2025-04-30 10:33:56,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:33:56,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:33:56,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:33:56,827 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:33:56,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:33:56,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 7 equivalence classes. [2025-04-30 10:33:56,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 44 of 47 statements. [2025-04-30 10:33:56,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:33:56,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:33:56,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-30 10:33:56,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:33:56,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:33:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:33:58,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:34:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:34:00,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830752708] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:34:00,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:34:00,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25, 24] total 67 [2025-04-30 10:34:00,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716325015] [2025-04-30 10:34:00,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:34:00,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-04-30 10:34:00,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:34:00,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-04-30 10:34:00,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=4222, Unknown=0, NotChecked=0, Total=4556 [2025-04-30 10:34:00,247 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 68 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 68 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:34:02,665 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2025-04-30 10:34:02,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-30 10:34:02,665 INFO L79 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 68 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-30 10:34:02,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:34:02,665 INFO L225 Difference]: With dead ends: 51 [2025-04-30 10:34:02,665 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:34:02,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=968, Invalid=9538, Unknown=0, NotChecked=0, Total=10506 [2025-04-30 10:34:02,668 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-30 10:34:02,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 121 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-30 10:34:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:34:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:34:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call 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,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:34:02,668 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2025-04-30 10:34:02,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:34:02,668 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:34:02,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 68 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:34:02,668 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:34:02,669 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:34:02,670 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2025-04-30 10:34:02,670 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2025-04-30 10:34:02,670 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2025-04-30 10:34:02,670 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2025-04-30 10:34:02,670 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-04-30 10:34:02,677 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:02,871 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,SelfDestructingSolverStorable20 [2025-04-30 10:34:02,873 INFO L422 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:34:02,874 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:34:02,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:34:02 BoogieIcfgContainer [2025-04-30 10:34:02,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:34:02,876 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:34:02,877 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:34:02,877 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:34:02,877 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:33:38" (3/4) ... [2025-04-30 10:34:02,878 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:34:02,884 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-04-30 10:34:02,885 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:34:02,885 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:34:02,937 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:34:02,937 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:34:02,937 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:34:02,938 INFO L158 Benchmark]: Toolchain (without parser) took 24892.18ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 121.7MB in the beginning and 123.1MB in the end (delta: -1.3MB). Peak memory consumption was 121.4MB. Max. memory is 16.1GB. [2025-04-30 10:34:02,938 INFO L158 Benchmark]: CDTParser took 1.19ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:34:02,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.02ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 101.9MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:34:02,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.71ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 99.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:34:02,938 INFO L158 Benchmark]: Boogie Preprocessor took 49.83ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 98.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:34:02,939 INFO L158 Benchmark]: RCFGBuilder took 247.83ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 84.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:34:02,939 INFO L158 Benchmark]: TraceAbstraction took 24156.35ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 84.3MB in the beginning and 130.0MB in the end (delta: -45.7MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2025-04-30 10:34:02,939 INFO L158 Benchmark]: Witness Printer took 60.92ms. Allocated memory is still 293.6MB. Free memory was 130.0MB in the beginning and 123.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:34:02,940 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.19ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.02ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 101.9MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.71ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 99.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.83ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 98.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 247.83ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 84.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24156.35ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 84.3MB in the beginning and 130.0MB in the end (delta: -45.7MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Witness Printer took 60.92ms. Allocated memory is still 293.6MB. Free memory was 130.0MB in the beginning and 123.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 29 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 24.1s, OverallIterations: 21, TraceHistogramMax: 6, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 2438 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2128 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4917 IncrementalHoareTripleChecker+Invalid, 5011 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 310 mSDtfsCounter, 4917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 923 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4440 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=20, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 78 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 744 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1011 ConstructedInterpolants, 92 QuantifiedInterpolants, 13143 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1766 ConjunctsInSsa, 383 ConjunctsInUnsatCore, 44 InterpolantComputations, 11 PerfectInterpolantSequences, 272/1221 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:34:02,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE