./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/Problem18_label23.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 9c3f430f1d0c98e808f28c171a470da1b7d8f35cdbdf3a5d89880d12cad963bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:18:45,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:18:45,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:18:45,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:18:45,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:18:45,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:18:45,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:18:45,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:18:45,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:18:45,177 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:18:45,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:18:45,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:18:45,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:18:45,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:18:45,177 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:18:45,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:18:45,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:18:45,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:18:45,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:18:45,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:18:45,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:18:45,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:18:45,179 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 -> 9c3f430f1d0c98e808f28c171a470da1b7d8f35cdbdf3a5d89880d12cad963bd [2025-01-09 00:18:45,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:18:45,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:18:45,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:18:45,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:18:45,390 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:18:45,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label23.c [2025-01-09 00:18:46,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d66289212/75575b48a8054e4cb280ac3d4dde08a0/FLAG5e853fa8c [2025-01-09 00:18:46,942 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:18:46,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label23.c [2025-01-09 00:18:46,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d66289212/75575b48a8054e4cb280ac3d4dde08a0/FLAG5e853fa8c [2025-01-09 00:18:46,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d66289212/75575b48a8054e4cb280ac3d4dde08a0 [2025-01-09 00:18:46,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:18:46,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:18:46,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:18:46,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:18:46,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:18:46,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:18:46" (1/1) ... [2025-01-09 00:18:46,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380b68a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:46, skipping insertion in model container [2025-01-09 00:18:46,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:18:46" (1/1) ... [2025-01-09 00:18:47,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:18:47,225 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/Problem18_label23.c[5791,5804] [2025-01-09 00:18:47,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:18:47,562 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:18:47,577 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/Problem18_label23.c[5791,5804] [2025-01-09 00:18:47,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:18:47,788 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:18:47,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47 WrapperNode [2025-01-09 00:18:47,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:18:47,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:18:47,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:18:47,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:18:47,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:47,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:47,993 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:18:47,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:18:47,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:18:47,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:18:47,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:18:48,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,087 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-01-09 00:18:48,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,195 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:18:48,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:18:48,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:18:48,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:18:48,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (1/1) ... [2025-01-09 00:18:48,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:18:48,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:48,291 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-01-09 00:18:48,294 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-01-09 00:18:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:18:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:18:48,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:18:48,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:18:48,367 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:18:48,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:18:50,998 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:18:50,998 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:18:51,022 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:18:51,025 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:18:51,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:18:51 BoogieIcfgContainer [2025-01-09 00:18:51,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:18:51,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:18:51,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:18:51,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:18:51,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:18:46" (1/3) ... [2025-01-09 00:18:51,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b6ea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:18:51, skipping insertion in model container [2025-01-09 00:18:51,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:47" (2/3) ... [2025-01-09 00:18:51,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b6ea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:18:51, skipping insertion in model container [2025-01-09 00:18:51,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:18:51" (3/3) ... [2025-01-09 00:18:51,033 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label23.c [2025-01-09 00:18:51,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:18:51,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label23.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:18:51,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:18:51,101 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;@6998808d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:18:51,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:18:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 00:18:51,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:51,111 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] [2025-01-09 00:18:51,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:51,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash -257801140, now seen corresponding path program 1 times [2025-01-09 00:18:51,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:51,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184315487] [2025-01-09 00:18:51,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:51,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:51,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 00:18:51,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 00:18:51,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:51,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:18:51,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184315487] [2025-01-09 00:18:51,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184315487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:51,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:51,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476690133] [2025-01-09 00:18:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:51,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:51,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:51,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:51,424 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:55,540 INFO L93 Difference]: Finished difference Result 2910 states and 5656 transitions. [2025-01-09 00:18:55,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:18:55,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-09 00:18:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:55,568 INFO L225 Difference]: With dead ends: 2910 [2025-01-09 00:18:55,568 INFO L226 Difference]: Without dead ends: 2080 [2025-01-09 00:18:55,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:18:55,579 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2124 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 1773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1773 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:55,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 168 Invalid, 5163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1773 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 00:18:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-01-09 00:18:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2074. [2025-01-09 00:18:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5561987457790643) internal successors, (3226), 2073 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3226 transitions. [2025-01-09 00:18:55,686 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3226 transitions. Word has length 55 [2025-01-09 00:18:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:55,687 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3226 transitions. [2025-01-09 00:18:55,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3226 transitions. [2025-01-09 00:18:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 00:18:55,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:55,693 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:18:55,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:18:55,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:55,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2104106315, now seen corresponding path program 1 times [2025-01-09 00:18:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801135821] [2025-01-09 00:18:55,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:55,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 00:18:55,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 00:18:55,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:55,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 00:18:56,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:56,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801135821] [2025-01-09 00:18:56,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801135821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:56,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:56,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479202718] [2025-01-09 00:18:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:56,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:56,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:56,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:56,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:56,327 INFO L87 Difference]: Start difference. First operand 2074 states and 3226 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:18:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:59,901 INFO L93 Difference]: Finished difference Result 6908 states and 10880 transitions. [2025-01-09 00:18:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:18:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-01-09 00:18:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:59,915 INFO L225 Difference]: With dead ends: 6908 [2025-01-09 00:18:59,915 INFO L226 Difference]: Without dead ends: 4836 [2025-01-09 00:18:59,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:18:59,919 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 1925 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4332 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 4959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 4332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:59,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 622 Invalid, 4959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 4332 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 00:18:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2025-01-09 00:19:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4144. [2025-01-09 00:19:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3408158339367608) internal successors, (5555), 4143 states have internal predecessors, (5555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5555 transitions. [2025-01-09 00:19:00,015 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5555 transitions. Word has length 215 [2025-01-09 00:19:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:00,016 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5555 transitions. [2025-01-09 00:19:00,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5555 transitions. [2025-01-09 00:19:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-01-09 00:19:00,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:00,023 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:00,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:19:00,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:00,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:00,024 INFO L85 PathProgramCache]: Analyzing trace with hash 895435087, now seen corresponding path program 1 times [2025-01-09 00:19:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:00,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699653108] [2025-01-09 00:19:00,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:00,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:00,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 00:19:00,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 00:19:00,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:00,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:19:00,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699653108] [2025-01-09 00:19:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699653108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:00,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:00,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:00,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839722492] [2025-01-09 00:19:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:00,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:19:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:00,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:19:00,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:19:00,381 INFO L87 Difference]: Start difference. First operand 4144 states and 5555 transitions. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:02,896 INFO L93 Difference]: Finished difference Result 10409 states and 13873 transitions. [2025-01-09 00:19:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:19:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 304 [2025-01-09 00:19:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:02,915 INFO L225 Difference]: With dead ends: 10409 [2025-01-09 00:19:02,916 INFO L226 Difference]: Without dead ends: 6214 [2025-01-09 00:19:02,921 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-01-09 00:19:02,924 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:02,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 637 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:19:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2025-01-09 00:19:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5524. [2025-01-09 00:19:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.196270143038204) internal successors, (6607), 5523 states have internal predecessors, (6607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6607 transitions. [2025-01-09 00:19:02,996 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 6607 transitions. Word has length 304 [2025-01-09 00:19:02,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:02,997 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 6607 transitions. [2025-01-09 00:19:02,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 6607 transitions. [2025-01-09 00:19:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 937 [2025-01-09 00:19:03,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:03,056 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:03,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:19:03,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:03,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash 878021311, now seen corresponding path program 1 times [2025-01-09 00:19:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:03,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566591502] [2025-01-09 00:19:03,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:03,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 936 statements into 1 equivalence classes. [2025-01-09 00:19:03,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 936 of 936 statements. [2025-01-09 00:19:03,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:03,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-09 00:19:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566591502] [2025-01-09 00:19:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566591502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821250759] [2025-01-09 00:19:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:03,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:03,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:03,736 INFO L87 Difference]: Start difference. First operand 5524 states and 6607 transitions. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:05,674 INFO L93 Difference]: Finished difference Result 15186 states and 18423 transitions. [2025-01-09 00:19:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:05,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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 936 [2025-01-09 00:19:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:05,697 INFO L225 Difference]: With dead ends: 15186 [2025-01-09 00:19:05,697 INFO L226 Difference]: Without dead ends: 9664 [2025-01-09 00:19:05,703 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-01-09 00:19:05,704 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 644 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:05,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 105 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:19:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2025-01-09 00:19:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 8974. [2025-01-09 00:19:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.2178758497715367) internal successors, (10928), 8973 states have internal predecessors, (10928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10928 transitions. [2025-01-09 00:19:05,814 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 10928 transitions. Word has length 936 [2025-01-09 00:19:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:05,815 INFO L471 AbstractCegarLoop]: Abstraction has 8974 states and 10928 transitions. [2025-01-09 00:19:05,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 10928 transitions. [2025-01-09 00:19:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2025-01-09 00:19:05,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:05,832 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:05,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:19:05,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:05,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1342564052, now seen corresponding path program 1 times [2025-01-09 00:19:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:05,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471411338] [2025-01-09 00:19:05,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:05,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:05,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 954 statements into 1 equivalence classes. [2025-01-09 00:19:05,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 954 of 954 statements. [2025-01-09 00:19:05,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:05,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-01-09 00:19:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471411338] [2025-01-09 00:19:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471411338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:19:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946219598] [2025-01-09 00:19:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:06,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:06,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:06,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:06,589 INFO L87 Difference]: Start difference. First operand 8974 states and 10928 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:08,415 INFO L93 Difference]: Finished difference Result 20016 states and 24612 transitions. [2025-01-09 00:19:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:08,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 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 954 [2025-01-09 00:19:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:08,445 INFO L225 Difference]: With dead ends: 20016 [2025-01-09 00:19:08,446 INFO L226 Difference]: Without dead ends: 11044 [2025-01-09 00:19:08,451 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-01-09 00:19:08,451 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:08,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:19:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2025-01-09 00:19:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 11044. [2025-01-09 00:19:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11044 states, 11043 states have (on average 1.2193244589332608) internal successors, (13465), 11043 states have internal predecessors, (13465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 13465 transitions. [2025-01-09 00:19:08,552 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 13465 transitions. Word has length 954 [2025-01-09 00:19:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:08,553 INFO L471 AbstractCegarLoop]: Abstraction has 11044 states and 13465 transitions. [2025-01-09 00:19:08,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13465 transitions. [2025-01-09 00:19:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2025-01-09 00:19:08,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:08,565 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:08,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:19:08,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:08,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 399082290, now seen corresponding path program 1 times [2025-01-09 00:19:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:08,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675105648] [2025-01-09 00:19:08,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:08,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1015 statements into 1 equivalence classes. [2025-01-09 00:19:08,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1015 of 1015 statements. [2025-01-09 00:19:08,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:08,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-01-09 00:19:09,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:09,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675105648] [2025-01-09 00:19:09,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675105648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:09,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:09,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:19:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066004144] [2025-01-09 00:19:09,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:09,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:09,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:09,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:09,058 INFO L87 Difference]: Start difference. First operand 11044 states and 13465 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:10,645 INFO L93 Difference]: Finished difference Result 26916 states and 33821 transitions. [2025-01-09 00:19:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:10,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 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 1015 [2025-01-09 00:19:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:10,710 INFO L225 Difference]: With dead ends: 26916 [2025-01-09 00:19:10,711 INFO L226 Difference]: Without dead ends: 15874 [2025-01-09 00:19:10,718 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-01-09 00:19:10,719 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 226 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:10,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 389 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:19:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2025-01-09 00:19:10,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 14494. [2025-01-09 00:19:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 14493 states have (on average 1.183743876354102) internal successors, (17156), 14493 states have internal predecessors, (17156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 17156 transitions. [2025-01-09 00:19:10,957 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 17156 transitions. Word has length 1015 [2025-01-09 00:19:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:10,958 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 17156 transitions. [2025-01-09 00:19:10,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 17156 transitions. [2025-01-09 00:19:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1041 [2025-01-09 00:19:10,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:10,965 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:10,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:19:10,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:10,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:10,966 INFO L85 PathProgramCache]: Analyzing trace with hash -644331292, now seen corresponding path program 1 times [2025-01-09 00:19:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:10,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342963628] [2025-01-09 00:19:10,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:10,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:11,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1040 statements into 1 equivalence classes. [2025-01-09 00:19:11,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1040 of 1040 statements. [2025-01-09 00:19:11,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:11,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-01-09 00:19:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342963628] [2025-01-09 00:19:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342963628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:12,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:12,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:12,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431809786] [2025-01-09 00:19:12,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:12,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:12,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:12,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:12,085 INFO L87 Difference]: Start difference. First operand 14494 states and 17156 transitions. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:13,749 INFO L93 Difference]: Finished difference Result 28986 states and 34310 transitions. [2025-01-09 00:19:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:13,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 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 1040 [2025-01-09 00:19:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:13,795 INFO L225 Difference]: With dead ends: 28986 [2025-01-09 00:19:13,795 INFO L226 Difference]: Without dead ends: 14494 [2025-01-09 00:19:13,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-01-09 00:19:13,809 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 742 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:13,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 780 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:19:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14494 states. [2025-01-09 00:19:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14494 to 14494. [2025-01-09 00:19:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 14493 states have (on average 1.1613882563996412) internal successors, (16832), 14493 states have internal predecessors, (16832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 16832 transitions. [2025-01-09 00:19:14,104 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 16832 transitions. Word has length 1040 [2025-01-09 00:19:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:14,109 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 16832 transitions. [2025-01-09 00:19:14,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 16832 transitions. [2025-01-09 00:19:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2025-01-09 00:19:14,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:14,128 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:14,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:19:14,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:14,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:14,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1437706250, now seen corresponding path program 1 times [2025-01-09 00:19:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:14,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845312040] [2025-01-09 00:19:14,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:14,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1130 statements into 1 equivalence classes. [2025-01-09 00:19:14,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1130 of 1130 statements. [2025-01-09 00:19:14,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:14,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 525 proven. 555 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-01-09 00:19:15,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:15,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845312040] [2025-01-09 00:19:15,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845312040] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:19:15,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104722171] [2025-01-09 00:19:15,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:15,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:15,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:15,330 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-01-09 00:19:15,340 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-01-09 00:19:15,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1130 statements into 1 equivalence classes. [2025-01-09 00:19:15,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1130 of 1130 statements. [2025-01-09 00:19:15,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:15,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:15,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:19:15,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:19:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-01-09 00:19:15,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:19:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104722171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:15,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:19:15,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:19:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860535077] [2025-01-09 00:19:15,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:15,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:15,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:15,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:19:15,807 INFO L87 Difference]: Start difference. First operand 14494 states and 16832 transitions. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:17,640 INFO L93 Difference]: Finished difference Result 34506 states and 39864 transitions. [2025-01-09 00:19:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:17,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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 1130 [2025-01-09 00:19:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:17,708 INFO L225 Difference]: With dead ends: 34506 [2025-01-09 00:19:17,712 INFO L226 Difference]: Without dead ends: 16564 [2025-01-09 00:19:17,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1135 GetRequests, 1130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:19:17,738 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 649 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:17,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 973 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:19:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16564 states. [2025-01-09 00:19:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16564 to 15874. [2025-01-09 00:19:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15874 states, 15873 states have (on average 1.081018081018081) internal successors, (17159), 15873 states have internal predecessors, (17159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15874 states to 15874 states and 17159 transitions. [2025-01-09 00:19:18,010 INFO L78 Accepts]: Start accepts. Automaton has 15874 states and 17159 transitions. Word has length 1130 [2025-01-09 00:19:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:18,012 INFO L471 AbstractCegarLoop]: Abstraction has 15874 states and 17159 transitions. [2025-01-09 00:19:18,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 15874 states and 17159 transitions. [2025-01-09 00:19:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1236 [2025-01-09 00:19:18,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:18,037 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:18,048 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-01-09 00:19:18,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:18,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:18,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash 997678906, now seen corresponding path program 1 times [2025-01-09 00:19:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147985448] [2025-01-09 00:19:18,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:18,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1235 statements into 1 equivalence classes. [2025-01-09 00:19:18,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1235 of 1235 statements. [2025-01-09 00:19:18,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:18,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1613 backedges. 1108 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2025-01-09 00:19:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147985448] [2025-01-09 00:19:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147985448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:19,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291386542] [2025-01-09 00:19:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:19,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:19,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:19,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:19,440 INFO L87 Difference]: Start difference. First operand 15874 states and 17159 transitions. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:20,806 INFO L93 Difference]: Finished difference Result 37266 states and 40372 transitions. [2025-01-09 00:19:20,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:20,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 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 1235 [2025-01-09 00:19:20,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:20,831 INFO L225 Difference]: With dead ends: 37266 [2025-01-09 00:19:20,831 INFO L226 Difference]: Without dead ends: 22084 [2025-01-09 00:19:20,839 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-01-09 00:19:20,840 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 573 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:20,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 906 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:19:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22084 states. [2025-01-09 00:19:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 22084. [2025-01-09 00:19:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22084 states, 22083 states have (on average 1.0706878594393878) internal successors, (23644), 22083 states have internal predecessors, (23644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22084 states to 22084 states and 23644 transitions. [2025-01-09 00:19:20,980 INFO L78 Accepts]: Start accepts. Automaton has 22084 states and 23644 transitions. Word has length 1235 [2025-01-09 00:19:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:20,981 INFO L471 AbstractCegarLoop]: Abstraction has 22084 states and 23644 transitions. [2025-01-09 00:19:20,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 22084 states and 23644 transitions. [2025-01-09 00:19:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2025-01-09 00:19:20,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:20,995 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:20,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:19:20,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:20,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1778717727, now seen corresponding path program 1 times [2025-01-09 00:19:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676848296] [2025-01-09 00:19:20,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:21,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1272 statements into 1 equivalence classes. [2025-01-09 00:19:21,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1272 of 1272 statements. [2025-01-09 00:19:21,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:21,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-01-09 00:19:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676848296] [2025-01-09 00:19:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676848296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753868884] [2025-01-09 00:19:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:21,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:19:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:21,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:19:21,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:19:21,863 INFO L87 Difference]: Start difference. First operand 22084 states and 23644 transitions. Second operand has 4 states, 4 states have (on average 207.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:24,538 INFO L93 Difference]: Finished difference Result 46236 states and 49664 transitions. [2025-01-09 00:19:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:19:24,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 207.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 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 1272 [2025-01-09 00:19:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:24,566 INFO L225 Difference]: With dead ends: 46236 [2025-01-09 00:19:24,567 INFO L226 Difference]: Without dead ends: 24844 [2025-01-09 00:19:24,584 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-01-09 00:19:24,584 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 785 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:24,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 113 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:19:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24844 states. [2025-01-09 00:19:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24844 to 24844. [2025-01-09 00:19:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24844 states, 24843 states have (on average 1.067664935796804) internal successors, (26524), 24843 states have internal predecessors, (26524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24844 states to 24844 states and 26524 transitions. [2025-01-09 00:19:24,778 INFO L78 Accepts]: Start accepts. Automaton has 24844 states and 26524 transitions. Word has length 1272 [2025-01-09 00:19:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:24,779 INFO L471 AbstractCegarLoop]: Abstraction has 24844 states and 26524 transitions. [2025-01-09 00:19:24,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 207.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24844 states and 26524 transitions. [2025-01-09 00:19:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1297 [2025-01-09 00:19:24,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:24,793 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:24,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:19:24,793 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:24,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1385995258, now seen corresponding path program 1 times [2025-01-09 00:19:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070915032] [2025-01-09 00:19:24,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:24,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1296 statements into 1 equivalence classes. [2025-01-09 00:19:24,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1296 of 1296 statements. [2025-01-09 00:19:24,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:24,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 1226 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-01-09 00:19:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:25,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070915032] [2025-01-09 00:19:25,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070915032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733687881] [2025-01-09 00:19:25,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:25,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:25,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:25,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:25,569 INFO L87 Difference]: Start difference. First operand 24844 states and 26524 transitions. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:27,361 INFO L93 Difference]: Finished difference Result 55206 states and 59253 transitions. [2025-01-09 00:19:27,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:27,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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 1296 [2025-01-09 00:19:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:27,388 INFO L225 Difference]: With dead ends: 55206 [2025-01-09 00:19:27,388 INFO L226 Difference]: Without dead ends: 31054 [2025-01-09 00:19:27,405 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-01-09 00:19:27,406 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 583 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:27,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 959 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:19:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31054 states. [2025-01-09 00:19:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31054 to 30364. [2025-01-09 00:19:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30364 states, 30363 states have (on average 1.0652109475348286) internal successors, (32343), 30363 states have internal predecessors, (32343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 32343 transitions. [2025-01-09 00:19:27,603 INFO L78 Accepts]: Start accepts. Automaton has 30364 states and 32343 transitions. Word has length 1296 [2025-01-09 00:19:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:27,603 INFO L471 AbstractCegarLoop]: Abstraction has 30364 states and 32343 transitions. [2025-01-09 00:19:27,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 30364 states and 32343 transitions. [2025-01-09 00:19:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1338 [2025-01-09 00:19:27,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:27,618 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:27,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:19:27,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:27,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1724695254, now seen corresponding path program 1 times [2025-01-09 00:19:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:27,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492018331] [2025-01-09 00:19:27,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:27,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:27,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1337 statements into 1 equivalence classes. [2025-01-09 00:19:27,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1337 of 1337 statements. [2025-01-09 00:19:27,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:27,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 1274 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2025-01-09 00:19:28,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492018331] [2025-01-09 00:19:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492018331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818548513] [2025-01-09 00:19:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:28,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:28,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:28,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:28,242 INFO L87 Difference]: Start difference. First operand 30364 states and 32343 transitions. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:29,675 INFO L93 Difference]: Finished difference Result 60036 states and 63993 transitions. [2025-01-09 00:19:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:29,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 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 1337 [2025-01-09 00:19:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:29,704 INFO L225 Difference]: With dead ends: 60036 [2025-01-09 00:19:29,704 INFO L226 Difference]: Without dead ends: 30364 [2025-01-09 00:19:29,722 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-01-09 00:19:29,722 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 522 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:29,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 931 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:19:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30364 states. [2025-01-09 00:19:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 30364. [2025-01-09 00:19:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30364 states, 30363 states have (on average 1.0581958304515364) internal successors, (32130), 30363 states have internal predecessors, (32130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 32130 transitions. [2025-01-09 00:19:29,924 INFO L78 Accepts]: Start accepts. Automaton has 30364 states and 32130 transitions. Word has length 1337 [2025-01-09 00:19:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:29,924 INFO L471 AbstractCegarLoop]: Abstraction has 30364 states and 32130 transitions. [2025-01-09 00:19:29,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30364 states and 32130 transitions. [2025-01-09 00:19:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1352 [2025-01-09 00:19:29,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:29,939 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:29,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:19:29,939 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2042059475, now seen corresponding path program 1 times [2025-01-09 00:19:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971245091] [2025-01-09 00:19:29,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:29,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1351 statements into 1 equivalence classes. [2025-01-09 00:19:30,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1351 of 1351 statements. [2025-01-09 00:19:30,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:30,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2131 backedges. 762 proven. 0 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2025-01-09 00:19:30,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:30,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971245091] [2025-01-09 00:19:30,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971245091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:30,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:30,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:30,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537552146] [2025-01-09 00:19:30,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:30,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:30,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:30,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:30,465 INFO L87 Difference]: Start difference. First operand 30364 states and 32130 transitions. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:32,017 INFO L93 Difference]: Finished difference Result 60726 states and 64258 transitions. [2025-01-09 00:19:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:32,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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 1351 [2025-01-09 00:19:32,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:32,049 INFO L225 Difference]: With dead ends: 60726 [2025-01-09 00:19:32,049 INFO L226 Difference]: Without dead ends: 30364 [2025-01-09 00:19:32,068 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-01-09 00:19:32,069 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 605 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:32,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 960 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:19:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30364 states. [2025-01-09 00:19:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 28294. [2025-01-09 00:19:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28294 states, 28293 states have (on average 1.0485632488601422) internal successors, (29667), 28293 states have internal predecessors, (29667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 29667 transitions. [2025-01-09 00:19:32,295 INFO L78 Accepts]: Start accepts. Automaton has 28294 states and 29667 transitions. Word has length 1351 [2025-01-09 00:19:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:32,295 INFO L471 AbstractCegarLoop]: Abstraction has 28294 states and 29667 transitions. [2025-01-09 00:19:32,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 28294 states and 29667 transitions. [2025-01-09 00:19:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1401 [2025-01-09 00:19:32,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:32,312 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:19:32,312 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:32,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1057355430, now seen corresponding path program 1 times [2025-01-09 00:19:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994186260] [2025-01-09 00:19:32,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:32,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:32,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1400 statements into 1 equivalence classes. [2025-01-09 00:19:32,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1400 of 1400 statements. [2025-01-09 00:19:32,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:32,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2313 backedges. 918 proven. 1163 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 00:19:33,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:33,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994186260] [2025-01-09 00:19:33,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994186260] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:19:33,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535313328] [2025-01-09 00:19:33,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:33,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:33,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:33,594 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-01-09 00:19:33,595 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-01-09 00:19:33,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1400 statements into 1 equivalence classes. [2025-01-09 00:19:33,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1400 of 1400 statements. [2025-01-09 00:19:33,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:33,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:33,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:19:33,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:19:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2313 backedges. 1377 proven. 0 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-01-09 00:19:34,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:19:34,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535313328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:34,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:19:34,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:19:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356682754] [2025-01-09 00:19:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:34,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:34,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:34,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:19:34,313 INFO L87 Difference]: Start difference. First operand 28294 states and 29667 transitions. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:35,651 INFO L93 Difference]: Finished difference Result 69006 states and 72529 transitions. [2025-01-09 00:19:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:35,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 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 1400 [2025-01-09 00:19:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:35,692 INFO L225 Difference]: With dead ends: 69006 [2025-01-09 00:19:35,692 INFO L226 Difference]: Without dead ends: 41404 [2025-01-09 00:19:35,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1406 GetRequests, 1400 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:19:35,714 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 565 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:35,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 135 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:19:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41404 states. [2025-01-09 00:19:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41404 to 40714. [2025-01-09 00:19:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40714 states, 40713 states have (on average 1.0382187507675682) internal successors, (42269), 40713 states have internal predecessors, (42269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40714 states to 40714 states and 42269 transitions. [2025-01-09 00:19:36,003 INFO L78 Accepts]: Start accepts. Automaton has 40714 states and 42269 transitions. Word has length 1400 [2025-01-09 00:19:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:36,004 INFO L471 AbstractCegarLoop]: Abstraction has 40714 states and 42269 transitions. [2025-01-09 00:19:36,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 40714 states and 42269 transitions. [2025-01-09 00:19:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1534 [2025-01-09 00:19:36,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:36,025 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:36,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:19:36,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:36,225 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:36,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1812630886, now seen corresponding path program 1 times [2025-01-09 00:19:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:36,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240775056] [2025-01-09 00:19:36,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:36,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1533 statements into 1 equivalence classes. [2025-01-09 00:19:36,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1533 of 1533 statements. [2025-01-09 00:19:36,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:36,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3101 backedges. 1144 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-01-09 00:19:37,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:37,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240775056] [2025-01-09 00:19:37,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240775056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:37,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:37,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:37,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391331541] [2025-01-09 00:19:37,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:37,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:37,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:37,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:37,541 INFO L87 Difference]: Start difference. First operand 40714 states and 42269 transitions. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:39,209 INFO L93 Difference]: Finished difference Result 89706 states and 93448 transitions. [2025-01-09 00:19:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:39,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 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 1533 [2025-01-09 00:19:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:39,264 INFO L225 Difference]: With dead ends: 89706 [2025-01-09 00:19:39,264 INFO L226 Difference]: Without dead ends: 48304 [2025-01-09 00:19:39,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-01-09 00:19:39,294 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 580 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:39,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 767 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:19:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48304 states. [2025-01-09 00:19:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48304 to 48304. [2025-01-09 00:19:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48304 states, 48303 states have (on average 1.0392315177111153) internal successors, (50198), 48303 states have internal predecessors, (50198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48304 states to 48304 states and 50198 transitions. [2025-01-09 00:19:39,667 INFO L78 Accepts]: Start accepts. Automaton has 48304 states and 50198 transitions. Word has length 1533 [2025-01-09 00:19:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:39,668 INFO L471 AbstractCegarLoop]: Abstraction has 48304 states and 50198 transitions. [2025-01-09 00:19:39,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 48304 states and 50198 transitions. [2025-01-09 00:19:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1535 [2025-01-09 00:19:39,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:39,690 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:39,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:19:39,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:39,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1968795162, now seen corresponding path program 1 times [2025-01-09 00:19:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:39,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445856487] [2025-01-09 00:19:39,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:39,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1534 statements into 1 equivalence classes. [2025-01-09 00:19:39,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1534 of 1534 statements. [2025-01-09 00:19:39,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:39,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1564 proven. 812 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-01-09 00:19:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445856487] [2025-01-09 00:19:41,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445856487] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:19:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862109087] [2025-01-09 00:19:41,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:41,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:41,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:41,221 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-01-09 00:19:41,238 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-01-09 00:19:41,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1534 statements into 1 equivalence classes. [2025-01-09 00:19:41,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1534 of 1534 statements. [2025-01-09 00:19:41,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:41,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:41,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1767 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:19:41,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:19:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 1697 proven. 0 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2025-01-09 00:19:41,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:19:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862109087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:41,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:19:41,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:19:41,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8972304] [2025-01-09 00:19:41,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:41,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:41,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:41,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:19:41,736 INFO L87 Difference]: Start difference. First operand 48304 states and 50198 transitions. Second operand has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:43,311 INFO L93 Difference]: Finished difference Result 96606 states and 100407 transitions. [2025-01-09 00:19:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:43,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 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 1534 [2025-01-09 00:19:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:43,362 INFO L225 Difference]: With dead ends: 96606 [2025-01-09 00:19:43,362 INFO L226 Difference]: Without dead ends: 48994 [2025-01-09 00:19:43,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1539 GetRequests, 1534 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:19:43,393 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 562 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:43,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 917 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:19:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48994 states. [2025-01-09 00:19:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48994 to 48304. [2025-01-09 00:19:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48304 states, 48303 states have (on average 1.033476181603627) internal successors, (49920), 48303 states have internal predecessors, (49920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48304 states to 48304 states and 49920 transitions. [2025-01-09 00:19:43,865 INFO L78 Accepts]: Start accepts. Automaton has 48304 states and 49920 transitions. Word has length 1534 [2025-01-09 00:19:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:43,866 INFO L471 AbstractCegarLoop]: Abstraction has 48304 states and 49920 transitions. [2025-01-09 00:19:43,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 48304 states and 49920 transitions. [2025-01-09 00:19:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1596 [2025-01-09 00:19:43,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:43,909 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:43,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:19:44,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:44,110 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:44,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash 57535281, now seen corresponding path program 1 times [2025-01-09 00:19:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:44,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966899308] [2025-01-09 00:19:44,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:44,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1595 statements into 1 equivalence classes. [2025-01-09 00:19:44,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1595 of 1595 statements. [2025-01-09 00:19:44,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:44,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2318 proven. 0 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2025-01-09 00:19:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:44,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966899308] [2025-01-09 00:19:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966899308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:44,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863857067] [2025-01-09 00:19:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:44,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:44,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:44,936 INFO L87 Difference]: Start difference. First operand 48304 states and 49920 transitions. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:46,610 INFO L93 Difference]: Finished difference Result 121444 states and 125697 transitions. [2025-01-09 00:19:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 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 1595 [2025-01-09 00:19:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:46,612 INFO L225 Difference]: With dead ends: 121444 [2025-01-09 00:19:46,612 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:19:46,646 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-01-09 00:19:46,647 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 545 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:46,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 889 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:19:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:19:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:19:46,647 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-01-09 00:19:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:19:46,648 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1595 [2025-01-09 00:19:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:46,648 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:19:46,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:19:46,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:19:46,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:19:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:19:46,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:19:46,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:19:47,702 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:19:47,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:19:47 BoogieIcfgContainer [2025-01-09 00:19:47,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:19:47,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:19:47,723 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:19:47,723 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:19:47,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:18:51" (3/4) ... [2025-01-09 00:19:47,726 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:19:47,770 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 00:19:47,774 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:19:47,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:19:47,780 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:19:47,977 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:19:47,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:19:47,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:19:47,979 INFO L158 Benchmark]: Toolchain (without parser) took 60992.16ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 123.4MB in the beginning and 524.4MB in the end (delta: -401.0MB). Peak memory consumption was 602.4MB. Max. memory is 16.1GB. [2025-01-09 00:19:47,979 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:19:47,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 802.86ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 90.8MB in the end (delta: 32.7MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2025-01-09 00:19:47,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 202.89ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 104.0MB in the end (delta: -13.3MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2025-01-09 00:19:47,980 INFO L158 Benchmark]: Boogie Preprocessor took 271.48ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 90.7MB in the end (delta: 13.3MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2025-01-09 00:19:47,980 INFO L158 Benchmark]: RCFGBuilder took 2759.60ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 90.7MB in the beginning and 207.6MB in the end (delta: -116.8MB). Peak memory consumption was 209.5MB. Max. memory is 16.1GB. [2025-01-09 00:19:47,980 INFO L158 Benchmark]: TraceAbstraction took 56695.05ms. Allocated memory was 335.5MB in the beginning and 1.2GB in the end (delta: 838.9MB). Free memory was 207.6MB in the beginning and 574.7MB in the end (delta: -367.1MB). Peak memory consumption was 759.7MB. Max. memory is 16.1GB. [2025-01-09 00:19:47,981 INFO L158 Benchmark]: Witness Printer took 255.15ms. Allocated memory is still 1.2GB. Free memory was 574.7MB in the beginning and 524.4MB in the end (delta: 50.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 00:19:47,982 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 802.86ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 90.8MB in the end (delta: 32.7MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 202.89ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 104.0MB in the end (delta: -13.3MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 271.48ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 90.7MB in the end (delta: 13.3MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2759.60ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 90.7MB in the beginning and 207.6MB in the end (delta: -116.8MB). Peak memory consumption was 209.5MB. Max. memory is 16.1GB. * TraceAbstraction took 56695.05ms. Allocated memory was 335.5MB in the beginning and 1.2GB in the end (delta: 838.9MB). Free memory was 207.6MB in the beginning and 574.7MB in the end (delta: -367.1MB). Peak memory consumption was 759.7MB. Max. memory is 16.1GB. * Witness Printer took 255.15ms. Allocated memory is still 1.2GB. Free memory was 574.7MB in the beginning and 524.4MB in the end (delta: 50.2MB). Peak memory consumption was 41.9MB. 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: 184]: 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, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.6s, OverallIterations: 17, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 35.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12392 SdHoareTripleChecker+Valid, 31.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12392 mSDsluCounter, 10328 SdHoareTripleChecker+Invalid, 26.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 7927 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36352 IncrementalHoareTripleChecker+Invalid, 44279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7927 mSolverCounterUnsat, 10182 mSDtfsCounter, 36352 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4129 GetRequests, 4093 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48304occurred in iteration=15, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 8288 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 22266 NumberOfCodeBlocks, 22266 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 22246 ConstructedInterpolants, 0 QuantifiedInterpolants, 53005 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4694 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 30506/33036 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: 4269]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a18 == 10) && (a15 <= 5)) || (((307 <= a3) && (a18 == 11)) && (a24 <= 3))) || (((a24 != 1) && (a24 <= 3)) && (a18 == 12))) || (((a18 == 11) && (a24 <= 3)) && (a3 <= 99))) || (((a24 == 1) && (307 <= a3)) && (a18 == 9))) || (((a24 != 1) && (a15 <= 4)) && (a18 == 12))) || (((a18 <= 10) && (307 <= a3)) && (a15 <= 4))) || ((a18 <= 8) && (a24 <= 3))) || (((a18 <= 8) && (307 <= a3)) && (a15 <= 5))) || (((a15 != 4) && (a18 == 12)) && (a15 <= 5))) || (((a24 != 1) && (a24 <= 3)) && (a18 == 9))) || ((a18 == 11) && (a15 <= 5))) || (((a24 == 1) && (307 <= a3)) && (a15 <= 4))) || (((a18 == 11) && (a24 <= 3)) && (a24 != 3))) || (((a24 != 1) && (a15 <= 4)) && (a24 <= 1))) || (((a24 == 1) && (a15 != 4)) && (a18 == 12))) || (((a24 == 1) && (a18 == 9)) && (a15 <= 5))) || ((a18 == 10) && (a24 <= 3))) || ((a18 <= 8) && (a15 <= 4))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:19:47,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE