./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label59.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7803525370200aabfab7aff9768b555209ce32125d445cdaf8def0c5a28cd1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:43:42,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:43:42,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:43:42,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:43:42,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:43:42,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:43:42,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:43:42,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:43:42,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:43:42,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:43:42,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:43:42,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:43:42,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:43:42,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:43:42,422 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:43:42,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:43:42,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:43:42,422 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:43:42,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:43:42,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:43:42,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:43:42,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:43:42,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:43:42,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:43:42,423 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:43:42,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:43:42,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:43:42,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:43:42,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:43:42,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:43:42,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:43:42,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:43:42,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:43:42,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:43:42,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:43:42,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:43:42,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:43:42,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:43:42,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:43:42,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:43:42,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:43:42,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:43:42,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:43:42,425 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-jdk21/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 ! call(reach_error())) ) 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 -> c7803525370200aabfab7aff9768b555209ce32125d445cdaf8def0c5a28cd1e [2025-02-05 10:43:42,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:43:42,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:43:42,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:43:42,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:43:42,688 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:43:42,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2025-02-05 10:43:43,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c55d5888e/1b3f2b9563314ec4bf2d61e5a6168911/FLAG6e17ead09 [2025-02-05 10:43:44,336 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:43:44,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label59.c [2025-02-05 10:43:44,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c55d5888e/1b3f2b9563314ec4bf2d61e5a6168911/FLAG6e17ead09 [2025-02-05 10:43:44,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c55d5888e/1b3f2b9563314ec4bf2d61e5a6168911 [2025-02-05 10:43:44,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:43:44,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:43:44,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:43:44,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:43:44,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:43:44,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df8480e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44, skipping insertion in model container [2025-02-05 10:43:44,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:43:44,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label59.c[16624,16637] [2025-02-05 10:43:44,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:43:44,670 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:43:44,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label59.c[16624,16637] [2025-02-05 10:43:44,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:43:44,751 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:43:44,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44 WrapperNode [2025-02-05 10:43:44,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:43:44,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:43:44,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:43:44,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:43:44,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,816 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-02-05 10:43:44,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:43:44,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:43:44,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:43:44,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:43:44,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,852 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 10:43:44,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:43:44,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:43:44,899 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:43:44,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:43:44,900 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (1/1) ... [2025-02-05 10:43:44,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:43:44,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:43:44,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:43:44,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:43:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:43:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:43:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:43:44,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:43:45,040 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:43:45,042 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:43:45,920 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-05 10:43:45,920 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:43:45,933 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:43:45,934 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:43:45,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:45 BoogieIcfgContainer [2025-02-05 10:43:45,934 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:43:45,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:43:45,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:43:45,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:43:45,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:43:44" (1/3) ... [2025-02-05 10:43:45,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e182fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:43:45, skipping insertion in model container [2025-02-05 10:43:45,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:44" (2/3) ... [2025-02-05 10:43:45,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e182fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:43:45, skipping insertion in model container [2025-02-05 10:43:45,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:45" (3/3) ... [2025-02-05 10:43:45,948 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label59.c [2025-02-05 10:43:45,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:43:45,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label59.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:43:46,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:43:46,028 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@7ad2314b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:43:46,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:43:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 10:43:46,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:46,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:46,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:46,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:46,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1929428964, now seen corresponding path program 1 times [2025-02-05 10:43:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:46,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416166229] [2025-02-05 10:43:46,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:46,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:46,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 10:43:46,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 10:43:46,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:46,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416166229] [2025-02-05 10:43:46,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416166229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:46,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:46,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:43:46,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327474584] [2025-02-05 10:43:46,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:46,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:46,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:46,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:46,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:46,559 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:47,211 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-02-05 10:43:47,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:47,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 10:43:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:47,221 INFO L225 Difference]: With dead ends: 528 [2025-02-05 10:43:47,221 INFO L226 Difference]: Without dead ends: 266 [2025-02-05 10:43:47,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:47,227 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 99 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:47,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 51 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:43:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-05 10:43:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-02-05 10:43:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4566037735849056) internal successors, (386), 265 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 386 transitions. [2025-02-05 10:43:47,275 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 386 transitions. Word has length 89 [2025-02-05 10:43:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:47,275 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 386 transitions. [2025-02-05 10:43:47,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 386 transitions. [2025-02-05 10:43:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 10:43:47,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:47,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:47,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:43:47,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash -538695418, now seen corresponding path program 1 times [2025-02-05 10:43:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195072999] [2025-02-05 10:43:47,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:47,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:47,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 10:43:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 10:43:47,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:47,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195072999] [2025-02-05 10:43:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195072999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:47,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:47,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:43:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810695312] [2025-02-05 10:43:47,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:47,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:47,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:47,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:47,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:47,391 INFO L87 Difference]: Start difference. First operand 266 states and 386 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:47,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:47,760 INFO L93 Difference]: Finished difference Result 792 states and 1153 transitions. [2025-02-05 10:43:47,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:47,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 10:43:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:47,763 INFO L225 Difference]: With dead ends: 792 [2025-02-05 10:43:47,763 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 10:43:47,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:47,764 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:47,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 10:43:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-02-05 10:43:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3795066413662238) internal successors, (727), 527 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 727 transitions. [2025-02-05 10:43:47,798 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 727 transitions. Word has length 95 [2025-02-05 10:43:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:47,798 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 727 transitions. [2025-02-05 10:43:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 727 transitions. [2025-02-05 10:43:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 10:43:47,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:47,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:47,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:43:47,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:47,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash -510097499, now seen corresponding path program 1 times [2025-02-05 10:43:47,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:47,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786470097] [2025-02-05 10:43:47,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:47,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 10:43:47,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 10:43:47,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:47,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:47,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786470097] [2025-02-05 10:43:47,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786470097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:47,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:47,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:47,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987468284] [2025-02-05 10:43:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:47,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:47,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:47,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:47,965 INFO L87 Difference]: Start difference. First operand 528 states and 727 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:48,373 INFO L93 Difference]: Finished difference Result 1578 states and 2176 transitions. [2025-02-05 10:43:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:48,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-02-05 10:43:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:48,380 INFO L225 Difference]: With dead ends: 1578 [2025-02-05 10:43:48,380 INFO L226 Difference]: Without dead ends: 1052 [2025-02-05 10:43:48,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:48,385 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 45 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:48,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 211 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:43:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-02-05 10:43:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2025-02-05 10:43:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3404255319148937) internal successors, (882), 658 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 882 transitions. [2025-02-05 10:43:48,410 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 882 transitions. Word has length 96 [2025-02-05 10:43:48,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:48,411 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 882 transitions. [2025-02-05 10:43:48,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 882 transitions. [2025-02-05 10:43:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 10:43:48,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:48,413 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:48,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:43:48,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:48,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1085076875, now seen corresponding path program 1 times [2025-02-05 10:43:48,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:48,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221934658] [2025-02-05 10:43:48,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:48,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:48,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 10:43:48,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 10:43:48,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:48,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:48,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:48,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221934658] [2025-02-05 10:43:48,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221934658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:48,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:48,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:43:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367801858] [2025-02-05 10:43:48,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:48,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:48,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:48,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:48,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:48,602 INFO L87 Difference]: Start difference. First operand 659 states and 882 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:49,048 INFO L93 Difference]: Finished difference Result 1971 states and 2641 transitions. [2025-02-05 10:43:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:49,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 10:43:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:49,052 INFO L225 Difference]: With dead ends: 1971 [2025-02-05 10:43:49,052 INFO L226 Difference]: Without dead ends: 1183 [2025-02-05 10:43:49,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:49,053 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:49,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 53 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:43:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-02-05 10:43:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2025-02-05 10:43:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1827411167512691) internal successors, (1398), 1182 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1398 transitions. [2025-02-05 10:43:49,087 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1398 transitions. Word has length 97 [2025-02-05 10:43:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:49,088 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1398 transitions. [2025-02-05 10:43:49,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1398 transitions. [2025-02-05 10:43:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 10:43:49,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:49,091 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:49,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:43:49,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:49,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash -684006988, now seen corresponding path program 1 times [2025-02-05 10:43:49,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:49,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208838721] [2025-02-05 10:43:49,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:49,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:49,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 10:43:49,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 10:43:49,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:49,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:43:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:49,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208838721] [2025-02-05 10:43:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208838721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:49,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:49,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:49,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421072837] [2025-02-05 10:43:49,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:49,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:49,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:49,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:49,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:49,245 INFO L87 Difference]: Start difference. First operand 1183 states and 1398 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:49,653 INFO L93 Difference]: Finished difference Result 3019 states and 3564 transitions. [2025-02-05 10:43:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:49,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-02-05 10:43:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:49,659 INFO L225 Difference]: With dead ends: 3019 [2025-02-05 10:43:49,659 INFO L226 Difference]: Without dead ends: 1838 [2025-02-05 10:43:49,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:49,661 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:49,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 41 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:43:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-02-05 10:43:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1445. [2025-02-05 10:43:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.1835180055401662) internal successors, (1709), 1444 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1709 transitions. [2025-02-05 10:43:49,703 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1709 transitions. Word has length 110 [2025-02-05 10:43:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:49,703 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1709 transitions. [2025-02-05 10:43:49,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1709 transitions. [2025-02-05 10:43:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 10:43:49,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:49,706 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:49,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:43:49,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:49,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash 568706528, now seen corresponding path program 1 times [2025-02-05 10:43:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:49,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69718903] [2025-02-05 10:43:49,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:49,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 10:43:49,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 10:43:49,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:49,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:43:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:49,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69718903] [2025-02-05 10:43:49,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69718903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:49,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:49,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:43:49,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129958458] [2025-02-05 10:43:49,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:49,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:49,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:49,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:49,896 INFO L87 Difference]: Start difference. First operand 1445 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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-02-05 10:43:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:50,196 INFO L93 Difference]: Finished difference Result 3019 states and 3571 transitions. [2025-02-05 10:43:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:50,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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 112 [2025-02-05 10:43:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:50,201 INFO L225 Difference]: With dead ends: 3019 [2025-02-05 10:43:50,201 INFO L226 Difference]: Without dead ends: 1576 [2025-02-05 10:43:50,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:50,204 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:50,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 55 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-02-05 10:43:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2025-02-05 10:43:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1746031746031746) internal successors, (1850), 1575 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1850 transitions. [2025-02-05 10:43:50,231 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1850 transitions. Word has length 112 [2025-02-05 10:43:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:50,232 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1850 transitions. [2025-02-05 10:43:50,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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-02-05 10:43:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1850 transitions. [2025-02-05 10:43:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 10:43:50,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:50,234 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:50,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:43:50,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash 819768483, now seen corresponding path program 1 times [2025-02-05 10:43:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:50,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597114885] [2025-02-05 10:43:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:50,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 10:43:50,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 10:43:50,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:50,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:43:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597114885] [2025-02-05 10:43:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597114885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:50,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643366518] [2025-02-05 10:43:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:50,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:43:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:50,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:43:50,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:43:50,371 INFO L87 Difference]: Start difference. First operand 1576 states and 1850 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:50,901 INFO L93 Difference]: Finished difference Result 3412 states and 4008 transitions. [2025-02-05 10:43:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:43:50,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 116 [2025-02-05 10:43:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:50,907 INFO L225 Difference]: With dead ends: 3412 [2025-02-05 10:43:50,907 INFO L226 Difference]: Without dead ends: 1707 [2025-02-05 10:43:50,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:43:50,910 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 260 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:50,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 34 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:43:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-02-05 10:43:50,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2025-02-05 10:43:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1014067995310668) internal successors, (1879), 1706 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1879 transitions. [2025-02-05 10:43:50,949 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1879 transitions. Word has length 116 [2025-02-05 10:43:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:50,950 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1879 transitions. [2025-02-05 10:43:50,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1879 transitions. [2025-02-05 10:43:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 10:43:50,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:50,952 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:50,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:43:50,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:50,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2129504385, now seen corresponding path program 1 times [2025-02-05 10:43:50,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:50,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460003762] [2025-02-05 10:43:50,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:50,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 10:43:50,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 10:43:50,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:50,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460003762] [2025-02-05 10:43:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460003762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:51,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:51,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871543425] [2025-02-05 10:43:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:51,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:43:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:51,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:43:51,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:43:51,117 INFO L87 Difference]: Start difference. First operand 1707 states and 1879 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:51,633 INFO L93 Difference]: Finished difference Result 3674 states and 4058 transitions. [2025-02-05 10:43:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:43:51,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-02-05 10:43:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:51,639 INFO L225 Difference]: With dead ends: 3674 [2025-02-05 10:43:51,639 INFO L226 Difference]: Without dead ends: 1969 [2025-02-05 10:43:51,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:43:51,640 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 346 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:51,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 42 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:43:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-02-05 10:43:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2025-02-05 10:43:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.09635274904736) internal successors, (2014), 1837 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2014 transitions. [2025-02-05 10:43:51,669 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2014 transitions. Word has length 122 [2025-02-05 10:43:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:51,670 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2014 transitions. [2025-02-05 10:43:51,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2014 transitions. [2025-02-05 10:43:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 10:43:51,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:51,673 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:51,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:43:51,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:51,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash -590136338, now seen corresponding path program 1 times [2025-02-05 10:43:51,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:51,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841444672] [2025-02-05 10:43:51,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:51,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 10:43:51,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 10:43:51,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:51,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841444672] [2025-02-05 10:43:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841444672] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:43:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269817032] [2025-02-05 10:43:51,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:51,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:43:51,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:43:51,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:43:51,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 10:43:51,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 10:43:51,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:51,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:51,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:43:51,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:43:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 10:43:52,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:43:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269817032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:52,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:43:52,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:43:52,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429328955] [2025-02-05 10:43:52,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:52,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:52,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:52,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:43:52,093 INFO L87 Difference]: Start difference. First operand 1838 states and 2014 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:52,417 INFO L93 Difference]: Finished difference Result 4198 states and 4593 transitions. [2025-02-05 10:43:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:52,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 147 [2025-02-05 10:43:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:52,423 INFO L225 Difference]: With dead ends: 4198 [2025-02-05 10:43:52,423 INFO L226 Difference]: Without dead ends: 1969 [2025-02-05 10:43:52,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 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-02-05 10:43:52,428 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 52 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:52,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 172 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-02-05 10:43:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2025-02-05 10:43:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.0881872618399564) internal successors, (1999), 1837 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1999 transitions. [2025-02-05 10:43:52,456 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1999 transitions. Word has length 147 [2025-02-05 10:43:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:52,456 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 1999 transitions. [2025-02-05 10:43:52,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1999 transitions. [2025-02-05 10:43:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 10:43:52,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:52,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:52,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:43:52,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:52,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:52,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2059147289, now seen corresponding path program 1 times [2025-02-05 10:43:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:52,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846647328] [2025-02-05 10:43:52,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:52,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 10:43:52,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 10:43:52,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:52,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:52,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:52,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846647328] [2025-02-05 10:43:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846647328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:52,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:52,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430416945] [2025-02-05 10:43:52,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:52,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:52,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:52,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:52,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:52,784 INFO L87 Difference]: Start difference. First operand 1838 states and 1999 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:53,158 INFO L93 Difference]: Finished difference Result 3674 states and 4013 transitions. [2025-02-05 10:43:53,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:53,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-02-05 10:43:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:53,166 INFO L225 Difference]: With dead ends: 3674 [2025-02-05 10:43:53,167 INFO L226 Difference]: Without dead ends: 1969 [2025-02-05 10:43:53,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:53,169 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:53,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-02-05 10:43:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2025-02-05 10:43:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.0734893848666305) internal successors, (1972), 1837 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1972 transitions. [2025-02-05 10:43:53,201 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1972 transitions. Word has length 148 [2025-02-05 10:43:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:53,202 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 1972 transitions. [2025-02-05 10:43:53,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1972 transitions. [2025-02-05 10:43:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 10:43:53,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:53,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:53,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:43:53,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:53,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -636357889, now seen corresponding path program 1 times [2025-02-05 10:43:53,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764699795] [2025-02-05 10:43:53,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:53,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 10:43:53,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 10:43:53,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:53,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764699795] [2025-02-05 10:43:53,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764699795] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:43:53,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284193190] [2025-02-05 10:43:53,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:53,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:53,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:43:53,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:43:53,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:43:53,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 10:43:53,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 10:43:53,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:53,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:53,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:43:53,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:43:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:43:53,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:43:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284193190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:43:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 10:43:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127809979] [2025-02-05 10:43:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:53,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:53,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:53,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:53,728 INFO L87 Difference]: Start difference. First operand 1838 states and 1972 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:54,024 INFO L93 Difference]: Finished difference Result 3543 states and 3808 transitions. [2025-02-05 10:43:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-02-05 10:43:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:54,029 INFO L225 Difference]: With dead ends: 3543 [2025-02-05 10:43:54,029 INFO L226 Difference]: Without dead ends: 1838 [2025-02-05 10:43:54,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:54,031 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 57 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:54,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 169 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-02-05 10:43:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2025-02-05 10:43:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.0615133369624388) internal successors, (1950), 1837 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1950 transitions. [2025-02-05 10:43:54,057 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1950 transitions. Word has length 161 [2025-02-05 10:43:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:54,057 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 1950 transitions. [2025-02-05 10:43:54,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1950 transitions. [2025-02-05 10:43:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 10:43:54,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:54,060 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:54,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:43:54,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:54,264 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:54,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash -894679261, now seen corresponding path program 1 times [2025-02-05 10:43:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:54,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851885697] [2025-02-05 10:43:54,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:54,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:54,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 10:43:54,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 10:43:54,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:54,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-05 10:43:54,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:54,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851885697] [2025-02-05 10:43:54,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851885697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:54,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:54,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:43:54,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462963976] [2025-02-05 10:43:54,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:54,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:54,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:54,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:54,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:54,432 INFO L87 Difference]: Start difference. First operand 1838 states and 1950 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:54,726 INFO L93 Difference]: Finished difference Result 3936 states and 4176 transitions. [2025-02-05 10:43:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:54,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2025-02-05 10:43:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:54,729 INFO L225 Difference]: With dead ends: 3936 [2025-02-05 10:43:54,730 INFO L226 Difference]: Without dead ends: 1314 [2025-02-05 10:43:54,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:54,732 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 95 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:54,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 36 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:43:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-02-05 10:43:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2025-02-05 10:43:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.044839255499154) internal successors, (1235), 1182 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1235 transitions. [2025-02-05 10:43:54,748 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1235 transitions. Word has length 190 [2025-02-05 10:43:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:54,748 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1235 transitions. [2025-02-05 10:43:54,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1235 transitions. [2025-02-05 10:43:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 10:43:54,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:54,750 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:54,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:43:54,751 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:54,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1136829634, now seen corresponding path program 1 times [2025-02-05 10:43:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997840284] [2025-02-05 10:43:54,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:54,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 10:43:54,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 10:43:54,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:54,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 246 proven. 84 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 10:43:55,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:55,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997840284] [2025-02-05 10:43:55,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997840284] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:43:55,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152122105] [2025-02-05 10:43:55,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:55,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:55,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:43:55,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:43:55,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:43:55,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 10:43:55,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 10:43:55,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:55,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:55,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:43:55,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:43:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-02-05 10:43:55,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:43:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152122105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:55,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:43:55,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 10:43:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544709609] [2025-02-05 10:43:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:55,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:55,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:55,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:55,453 INFO L87 Difference]: Start difference. First operand 1183 states and 1235 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:55,712 INFO L93 Difference]: Finished difference Result 2493 states and 2601 transitions. [2025-02-05 10:43:55,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:55,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 255 [2025-02-05 10:43:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:55,713 INFO L225 Difference]: With dead ends: 2493 [2025-02-05 10:43:55,713 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:43:55,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:43:55,715 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:55,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 148 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:43:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:43:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:43:55,716 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-02-05 10:43:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:43:55,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2025-02-05 10:43:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:55,716 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:43:55,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:43:55,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:43:55,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:43:55,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:43:55,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:43:55,922 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:55,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:43:56,234 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:43:56,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:43:56 BoogieIcfgContainer [2025-02-05 10:43:56,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:43:56,252 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:43:56,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:43:56,252 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:43:56,253 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:45" (3/4) ... [2025-02-05 10:43:56,254 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:43:56,270 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:43:56,271 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:43:56,274 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:43:56,274 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:43:56,374 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:43:56,374 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:43:56,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:43:56,375 INFO L158 Benchmark]: Toolchain (without parser) took 11986.80ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 104.4MB in the beginning and 196.3MB in the end (delta: -91.9MB). Peak memory consumption was 143.7MB. Max. memory is 16.1GB. [2025-02-05 10:43:56,375 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:43:56,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.37ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 76.6MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:43:56,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.81ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 70.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:43:56,375 INFO L158 Benchmark]: Boogie Preprocessor took 80.60ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 66.3MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:43:56,376 INFO L158 Benchmark]: IcfgBuilder took 1035.07ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 50.9MB in the end (delta: 15.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-02-05 10:43:56,376 INFO L158 Benchmark]: TraceAbstraction took 10316.14ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 50.1MB in the beginning and 208.8MB in the end (delta: -158.7MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2025-02-05 10:43:56,376 INFO L158 Benchmark]: Witness Printer took 122.33ms. Allocated memory is still 377.5MB. Free memory was 208.8MB in the beginning and 196.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:43:56,378 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.37ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 76.6MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.81ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 70.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.60ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 66.3MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1035.07ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 50.9MB in the end (delta: 15.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10316.14ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 50.1MB in the beginning and 208.8MB in the end (delta: -158.7MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. * Witness Printer took 122.33ms. Allocated memory is still 377.5MB. Free memory was 208.8MB in the beginning and 196.3MB in the end (delta: 12.5MB). 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: 453]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1587 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1587 mSDsluCounter, 1212 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 638 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4447 IncrementalHoareTripleChecker+Invalid, 5085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 638 mSolverCounterUnsat, 1138 mSDtfsCounter, 4447 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2301 NumberOfCodeBlocks, 2301 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2285 ConstructedInterpolants, 0 QuantifiedInterpolants, 6231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1059 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 1288/1451 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 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Location Invariant Derived location invariant: (((((((((((((((5 == a16) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) || (((a20 <= 0) && (a21 == 1)) && (a17 == 0))) || (((a20 <= 0) && (a8 <= 13)) && (a7 == 1))) || (((a21 == 1) && (a7 == 1)) && (a20 == 1))) || (((a20 <= 0) && (a21 == 1)) && (a17 == 1))) || (((a21 == 1) && (a20 == 1)) && (a17 == 0))) || ((((a8 <= 13) && (a17 == 1)) && (a7 == 1)) && (a20 == 1))) || (((a8 <= 13) && (a7 == 1)) && (a17 == 0))) || ((((a8 <= 13) && (a21 == 1)) && (a16 <= 5)) && (a20 == 1))) || ((((a8 <= 13) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || (((a21 == 1) && (a17 == 1)) && (a7 == 1))) || (((((a8 <= 14) && (a21 == 1)) && (a17 == 1)) && (a16 <= 5)) && (a20 == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:43:56,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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