./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label42.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/Problem15_label42.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 3fcd708947a4bb98de639b7d2a0b691cd973d0d2cb21e8c27c8bb20175929abf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:03:38,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:03:38,181 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:03:38,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:03:38,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:03:38,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:03:38,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:03:38,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:03:38,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:03:38,200 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:03:38,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:03:38,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:03:38,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:03:38,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:03:38,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:03:38,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:03:38,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:03:38,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:03:38,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:03:38,203 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:03:38,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:03:38,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:03:38,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:03:38,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:03:38,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:03:38,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:03:38,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:03:38,203 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 -> 3fcd708947a4bb98de639b7d2a0b691cd973d0d2cb21e8c27c8bb20175929abf [2025-01-09 00:03:38,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:03:38,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:03:38,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:03:38,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:03:38,451 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:03:38,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label42.c [2025-01-09 00:03:39,601 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c12252d3d/b17596870bfc4157a4348559d113dba8/FLAG5c13577b4 [2025-01-09 00:03:40,076 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:03:40,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label42.c [2025-01-09 00:03:40,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c12252d3d/b17596870bfc4157a4348559d113dba8/FLAG5c13577b4 [2025-01-09 00:03:40,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c12252d3d/b17596870bfc4157a4348559d113dba8 [2025-01-09 00:03:40,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:03:40,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:03:40,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:03:40,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:03:40,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:03:40,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:40,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2847d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40, skipping insertion in model container [2025-01-09 00:03:40,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:40,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:03:40,456 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/Problem15_label42.c[5695,5708] [2025-01-09 00:03:40,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:03:40,796 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:03:40,813 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/Problem15_label42.c[5695,5708] [2025-01-09 00:03:40,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:03:40,975 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:03:40,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40 WrapperNode [2025-01-09 00:03:40,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:03:40,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:03:40,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:03:40,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:03:40,984 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:03:40" (1/1) ... [2025-01-09 00:03:41,012 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:03:40" (1/1) ... [2025-01-09 00:03:41,164 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:03:41,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:03:41,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:03:41,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:03:41,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:03:41,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,313 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:03:41,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:03:41,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:03:41,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:03:41,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:03:41,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (1/1) ... [2025-01-09 00:03:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:03:41,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:03:41,475 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:03:41,485 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:03:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:03:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:03:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:03:41,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:03:41,554 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:03:41,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:03:43,741 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:03:43,742 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:03:43,764 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:03:43,765 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:03:43,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:03:43 BoogieIcfgContainer [2025-01-09 00:03:43,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:03:43,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:03:43,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:03:43,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:03:43,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:03:40" (1/3) ... [2025-01-09 00:03:43,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c0a340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:03:43, skipping insertion in model container [2025-01-09 00:03:43,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:03:40" (2/3) ... [2025-01-09 00:03:43,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c0a340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:03:43, skipping insertion in model container [2025-01-09 00:03:43,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:03:43" (3/3) ... [2025-01-09 00:03:43,774 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label42.c [2025-01-09 00:03:43,785 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:03:43,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label42.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:03:43,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:03:43,847 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;@3c3a24b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:03:43,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:03:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 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:03:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 00:03:43,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:43,856 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] [2025-01-09 00:03:43,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:43,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:43,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2006201642, now seen corresponding path program 1 times [2025-01-09 00:03:43,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761126786] [2025-01-09 00:03:43,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:43,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:43,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 00:03:43,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 00:03:43,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:43,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:44,145 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:03:44,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761126786] [2025-01-09 00:03:44,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761126786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:44,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:44,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:03:44,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047132373] [2025-01-09 00:03:44,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:44,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:44,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:44,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:44,164 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:45,882 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-01-09 00:03:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:45,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 00:03:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:45,891 INFO L225 Difference]: With dead ends: 1154 [2025-01-09 00:03:45,892 INFO L226 Difference]: Without dead ends: 665 [2025-01-09 00:03:45,894 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:03:45,896 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 275 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:45,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 384 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:03:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-01-09 00:03:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-01-09 00:03:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 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:03:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-01-09 00:03:45,981 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 46 [2025-01-09 00:03:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:45,981 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-01-09 00:03:45,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-01-09 00:03:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 00:03:45,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:45,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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:03:45,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:03:45,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:45,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash -626972320, now seen corresponding path program 1 times [2025-01-09 00:03:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:45,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775784667] [2025-01-09 00:03:45,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:46,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 00:03:46,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 00:03:46,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:46,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:46,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:46,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775784667] [2025-01-09 00:03:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775784667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:46,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:46,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:03:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309462222] [2025-01-09 00:03:46,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:46,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:46,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:46,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:46,389 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:03:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:47,689 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-01-09 00:03:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:47,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-01-09 00:03:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:47,693 INFO L225 Difference]: With dead ends: 1624 [2025-01-09 00:03:47,693 INFO L226 Difference]: Without dead ends: 963 [2025-01-09 00:03:47,695 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:03:47,696 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:47,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:03:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-01-09 00:03:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-01-09 00:03:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 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:03:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-01-09 00:03:47,719 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 111 [2025-01-09 00:03:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:47,720 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-01-09 00:03:47,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:03:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-01-09 00:03:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 00:03:47,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:47,721 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:47,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:03:47,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -782259116, now seen corresponding path program 1 times [2025-01-09 00:03:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:47,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204546898] [2025-01-09 00:03:47,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:47,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 00:03:47,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 00:03:47,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:47,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:47,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:47,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204546898] [2025-01-09 00:03:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204546898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:47,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:47,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:03:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719294876] [2025-01-09 00:03:47,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:47,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:47,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:47,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:47,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:47,826 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:03:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:49,002 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2025-01-09 00:03:49,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:49,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-01-09 00:03:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:49,011 INFO L225 Difference]: With dead ends: 2229 [2025-01-09 00:03:49,012 INFO L226 Difference]: Without dead ends: 1567 [2025-01-09 00:03:49,012 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:03:49,014 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:49,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 316 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:03:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-01-09 00:03:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2025-01-09 00:03:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1265 states have internal predecessors, (1651), 0 states have call successors, (0), 0 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:03:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1651 transitions. [2025-01-09 00:03:49,037 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1651 transitions. Word has length 116 [2025-01-09 00:03:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:49,038 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1651 transitions. [2025-01-09 00:03:49,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:03:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1651 transitions. [2025-01-09 00:03:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 00:03:49,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:49,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:49,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:03:49,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:49,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:49,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2145088017, now seen corresponding path program 1 times [2025-01-09 00:03:49,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:49,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981316249] [2025-01-09 00:03:49,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:49,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 00:03:49,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 00:03:49,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:49,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:03:49,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981316249] [2025-01-09 00:03:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981316249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:49,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:49,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704777261] [2025-01-09 00:03:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:49,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:03:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:49,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:03:49,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:03:49,169 INFO L87 Difference]: Start difference. First operand 1266 states and 1651 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:03:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:51,822 INFO L93 Difference]: Finished difference Result 4668 states and 6173 transitions. [2025-01-09 00:03:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:03:51,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-01-09 00:03:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:51,838 INFO L225 Difference]: With dead ends: 4668 [2025-01-09 00:03:51,841 INFO L226 Difference]: Without dead ends: 3404 [2025-01-09 00:03:51,843 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:03:51,844 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 515 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:51,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 373 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:03:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-01-09 00:03:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2025-01-09 00:03:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 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:03:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions. [2025-01-09 00:03:51,909 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 137 [2025-01-09 00:03:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:51,910 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions. [2025-01-09 00:03:51,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:03:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions. [2025-01-09 00:03:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 00:03:51,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:51,914 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, 2, 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] [2025-01-09 00:03:51,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:03:51,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1920031008, now seen corresponding path program 1 times [2025-01-09 00:03:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601761410] [2025-01-09 00:03:51,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:51,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 00:03:51,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 00:03:51,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:51,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 00:03:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601761410] [2025-01-09 00:03:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601761410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:52,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:52,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:03:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660303891] [2025-01-09 00:03:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:52,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:52,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:52,092 INFO L87 Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:53,251 INFO L93 Difference]: Finished difference Result 8563 states and 10754 transitions. [2025-01-09 00:03:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:53,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-01-09 00:03:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:53,264 INFO L225 Difference]: With dead ends: 8563 [2025-01-09 00:03:53,264 INFO L226 Difference]: Without dead ends: 5483 [2025-01-09 00:03:53,266 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:03:53,267 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:53,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:03:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-01-09 00:03:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-01-09 00:03:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 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:03:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions. [2025-01-09 00:03:53,332 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 205 [2025-01-09 00:03:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:53,332 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions. [2025-01-09 00:03:53,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:03:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions. [2025-01-09 00:03:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 00:03:53,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:53,335 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, 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] [2025-01-09 00:03:53,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:03:53,336 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:53,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash 194525872, now seen corresponding path program 1 times [2025-01-09 00:03:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:53,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792544949] [2025-01-09 00:03:53,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:53,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:53,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 00:03:53,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 00:03:53,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:53,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 00:03:53,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:53,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792544949] [2025-01-09 00:03:53,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792544949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:53,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:53,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:03:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078309851] [2025-01-09 00:03:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:53,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:53,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:53,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:53,765 INFO L87 Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 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:03:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:54,700 INFO L93 Difference]: Finished difference Result 10655 states and 12489 transitions. [2025-01-09 00:03:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:54,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 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 307 [2025-01-09 00:03:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:54,712 INFO L225 Difference]: With dead ends: 10655 [2025-01-09 00:03:54,712 INFO L226 Difference]: Without dead ends: 5478 [2025-01-09 00:03:54,715 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:03:54,717 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:54,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:03:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-01-09 00:03:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-01-09 00:03:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 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:03:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions. [2025-01-09 00:03:54,772 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 307 [2025-01-09 00:03:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:54,773 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions. [2025-01-09 00:03:54,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 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:03:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions. [2025-01-09 00:03:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-01-09 00:03:54,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:54,777 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:54,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:03:54,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:54,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash 344949569, now seen corresponding path program 1 times [2025-01-09 00:03:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064319316] [2025-01-09 00:03:54,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:54,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:54,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-09 00:03:54,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-09 00:03:54,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:54,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:03:54,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:54,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064319316] [2025-01-09 00:03:54,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064319316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:54,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:54,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548791237] [2025-01-09 00:03:54,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:54,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:54,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:54,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:54,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:54,950 INFO L87 Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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:03:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:56,179 INFO L93 Difference]: Finished difference Result 11851 states and 14149 transitions. [2025-01-09 00:03:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:56,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 333 [2025-01-09 00:03:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:56,194 INFO L225 Difference]: With dead ends: 11851 [2025-01-09 00:03:56,194 INFO L226 Difference]: Without dead ends: 6674 [2025-01-09 00:03:56,199 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:03:56,200 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 269 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:56,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:03:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-01-09 00:03:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4876. [2025-01-09 00:03:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4875 states have (on average 1.1755897435897436) internal successors, (5731), 4875 states have internal predecessors, (5731), 0 states have call successors, (0), 0 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:03:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 5731 transitions. [2025-01-09 00:03:56,261 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 5731 transitions. Word has length 333 [2025-01-09 00:03:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:56,261 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 5731 transitions. [2025-01-09 00:03:56,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 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:03:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 5731 transitions. [2025-01-09 00:03:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 00:03:56,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:56,265 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:56,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:03:56,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:56,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1295312825, now seen corresponding path program 1 times [2025-01-09 00:03:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:56,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101995733] [2025-01-09 00:03:56,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:56,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 00:03:56,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 00:03:56,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 00:03:56,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:56,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101995733] [2025-01-09 00:03:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101995733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:56,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:56,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:56,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208340600] [2025-01-09 00:03:56,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:56,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:56,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:56,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:56,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:56,613 INFO L87 Difference]: Start difference. First operand 4876 states and 5731 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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:03:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:58,130 INFO L93 Difference]: Finished difference Result 11553 states and 13859 transitions. [2025-01-09 00:03:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:58,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 392 [2025-01-09 00:03:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:58,144 INFO L225 Difference]: With dead ends: 11553 [2025-01-09 00:03:58,144 INFO L226 Difference]: Without dead ends: 6978 [2025-01-09 00:03:58,146 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:03:58,147 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 282 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:58,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:03:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6978 states. [2025-01-09 00:03:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6978 to 6380. [2025-01-09 00:03:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.1520614516381877) internal successors, (7349), 6379 states have internal predecessors, (7349), 0 states have call successors, (0), 0 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:03:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7349 transitions. [2025-01-09 00:03:58,196 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7349 transitions. Word has length 392 [2025-01-09 00:03:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:58,196 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7349 transitions. [2025-01-09 00:03:58,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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:03:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7349 transitions. [2025-01-09 00:03:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 00:03:58,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:58,200 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, 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:03:58,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:03:58,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:58,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2043797628, now seen corresponding path program 1 times [2025-01-09 00:03:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564230131] [2025-01-09 00:03:58,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:58,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 00:03:58,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 00:03:58,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:58,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:03:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:03:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:03:58,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564230131] [2025-01-09 00:03:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564230131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:03:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:03:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:03:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031126803] [2025-01-09 00:03:58,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:03:58,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:03:58,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:03:58,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:03:58,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:03:58,506 INFO L87 Difference]: Start difference. First operand 6380 states and 7349 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:03:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:03:59,783 INFO L93 Difference]: Finished difference Result 16957 states and 19654 transitions. [2025-01-09 00:03:59,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:03:59,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 393 [2025-01-09 00:03:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:03:59,799 INFO L225 Difference]: With dead ends: 16957 [2025-01-09 00:03:59,800 INFO L226 Difference]: Without dead ends: 8486 [2025-01-09 00:03:59,806 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:03:59,806 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 319 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:03:59,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 550 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:03:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2025-01-09 00:03:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 8187. [2025-01-09 00:03:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8187 states, 8186 states have (on average 1.1061568531639385) internal successors, (9055), 8186 states have internal predecessors, (9055), 0 states have call successors, (0), 0 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:03:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8187 states to 8187 states and 9055 transitions. [2025-01-09 00:03:59,869 INFO L78 Accepts]: Start accepts. Automaton has 8187 states and 9055 transitions. Word has length 393 [2025-01-09 00:03:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:03:59,869 INFO L471 AbstractCegarLoop]: Abstraction has 8187 states and 9055 transitions. [2025-01-09 00:03:59,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:03:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 8187 states and 9055 transitions. [2025-01-09 00:03:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-09 00:03:59,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:03:59,873 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:03:59,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:03:59,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:03:59,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:03:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash 461182957, now seen corresponding path program 1 times [2025-01-09 00:03:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:03:59,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126332917] [2025-01-09 00:03:59,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:03:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:03:59,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-09 00:03:59,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-09 00:03:59,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:03:59,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:04:00,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:00,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126332917] [2025-01-09 00:04:00,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126332917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:00,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875180810] [2025-01-09 00:04:00,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:00,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:00,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:00,129 INFO L87 Difference]: Start difference. First operand 8187 states and 9055 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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:04:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:01,312 INFO L93 Difference]: Finished difference Result 18476 states and 20715 transitions. [2025-01-09 00:04:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:01,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2025-01-09 00:04:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:01,336 INFO L225 Difference]: With dead ends: 18476 [2025-01-09 00:04:01,339 INFO L226 Difference]: Without dead ends: 10590 [2025-01-09 00:04:01,351 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:04:01,355 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 237 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:01,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 608 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:04:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2025-01-09 00:04:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 9688. [2025-01-09 00:04:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9688 states, 9687 states have (on average 1.0991018891297615) internal successors, (10647), 9687 states have internal predecessors, (10647), 0 states have call successors, (0), 0 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:04:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9688 states to 9688 states and 10647 transitions. [2025-01-09 00:04:01,612 INFO L78 Accepts]: Start accepts. Automaton has 9688 states and 10647 transitions. Word has length 409 [2025-01-09 00:04:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:01,616 INFO L471 AbstractCegarLoop]: Abstraction has 9688 states and 10647 transitions. [2025-01-09 00:04:01,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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:04:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 9688 states and 10647 transitions. [2025-01-09 00:04:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-01-09 00:04:01,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:01,620 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:04:01,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:04:01,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1888835136, now seen corresponding path program 1 times [2025-01-09 00:04:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570833245] [2025-01-09 00:04:01,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:01,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-01-09 00:04:01,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-01-09 00:04:01,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:01,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:04:02,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:02,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570833245] [2025-01-09 00:04:02,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570833245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:02,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:02,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784996830] [2025-01-09 00:04:02,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:02,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:02,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:02,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:02,202 INFO L87 Difference]: Start difference. First operand 9688 states and 10647 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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:04:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:03,683 INFO L93 Difference]: Finished difference Result 20868 states and 23258 transitions. [2025-01-09 00:04:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 423 [2025-01-09 00:04:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:03,711 INFO L225 Difference]: With dead ends: 20868 [2025-01-09 00:04:03,714 INFO L226 Difference]: Without dead ends: 11481 [2025-01-09 00:04:03,730 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:04:03,730 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 279 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:03,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 571 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:04:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11481 states. [2025-01-09 00:04:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11481 to 11177. [2025-01-09 00:04:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11177 states, 11176 states have (on average 1.0916249105225484) internal successors, (12200), 11176 states have internal predecessors, (12200), 0 states have call successors, (0), 0 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:04:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11177 states to 11177 states and 12200 transitions. [2025-01-09 00:04:04,033 INFO L78 Accepts]: Start accepts. Automaton has 11177 states and 12200 transitions. Word has length 423 [2025-01-09 00:04:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:04,034 INFO L471 AbstractCegarLoop]: Abstraction has 11177 states and 12200 transitions. [2025-01-09 00:04:04,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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:04:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 11177 states and 12200 transitions. [2025-01-09 00:04:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-01-09 00:04:04,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:04,047 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:04,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:04:04,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:04,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash 721605992, now seen corresponding path program 1 times [2025-01-09 00:04:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:04,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114030325] [2025-01-09 00:04:04,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:04,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-01-09 00:04:04,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-01-09 00:04:04,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:04,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 00:04:04,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:04,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114030325] [2025-01-09 00:04:04,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114030325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:04,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:04,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484209192] [2025-01-09 00:04:04,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:04,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:04,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:04,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:04,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:04,441 INFO L87 Difference]: Start difference. First operand 11177 states and 12200 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:04:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:05,423 INFO L93 Difference]: Finished difference Result 22349 states and 24438 transitions. [2025-01-09 00:04:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:05,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 547 [2025-01-09 00:04:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:05,453 INFO L225 Difference]: With dead ends: 22349 [2025-01-09 00:04:05,454 INFO L226 Difference]: Without dead ends: 11473 [2025-01-09 00:04:05,470 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:04:05,475 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:05,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 71 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:04:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11473 states. [2025-01-09 00:04:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11473 to 11173. [2025-01-09 00:04:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11173 states, 11172 states have (on average 1.0913891872538488) internal successors, (12193), 11172 states have internal predecessors, (12193), 0 states have call successors, (0), 0 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:04:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11173 states to 11173 states and 12193 transitions. [2025-01-09 00:04:05,783 INFO L78 Accepts]: Start accepts. Automaton has 11173 states and 12193 transitions. Word has length 547 [2025-01-09 00:04:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:05,783 INFO L471 AbstractCegarLoop]: Abstraction has 11173 states and 12193 transitions. [2025-01-09 00:04:05,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:04:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 11173 states and 12193 transitions. [2025-01-09 00:04:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-01-09 00:04:05,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:05,792 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:04:05,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:04:05,795 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash 6324185, now seen corresponding path program 1 times [2025-01-09 00:04:05,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:05,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639990630] [2025-01-09 00:04:05,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:05,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:05,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-01-09 00:04:05,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-01-09 00:04:05,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:05,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 00:04:06,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:06,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639990630] [2025-01-09 00:04:06,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639990630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:06,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:06,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:06,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578834090] [2025-01-09 00:04:06,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:06,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:06,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:06,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:06,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:06,132 INFO L87 Difference]: Start difference. First operand 11173 states and 12193 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:04:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:07,190 INFO L93 Difference]: Finished difference Result 24136 states and 26344 transitions. [2025-01-09 00:04:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:07,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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 556 [2025-01-09 00:04:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:07,222 INFO L225 Difference]: With dead ends: 24136 [2025-01-09 00:04:07,223 INFO L226 Difference]: Without dead ends: 12068 [2025-01-09 00:04:07,243 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:04:07,244 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 270 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:07,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 283 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:04:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12068 states. [2025-01-09 00:04:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12068 to 9075. [2025-01-09 00:04:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9075 states, 9074 states have (on average 1.0850782455366983) internal successors, (9846), 9074 states have internal predecessors, (9846), 0 states have call successors, (0), 0 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:04:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 9846 transitions. [2025-01-09 00:04:07,538 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 9846 transitions. Word has length 556 [2025-01-09 00:04:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:07,542 INFO L471 AbstractCegarLoop]: Abstraction has 9075 states and 9846 transitions. [2025-01-09 00:04:07,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:04:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 9846 transitions. [2025-01-09 00:04:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-01-09 00:04:07,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:07,551 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, 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, 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] [2025-01-09 00:04:07,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:04:07,551 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:07,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1687428773, now seen corresponding path program 1 times [2025-01-09 00:04:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:07,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026840133] [2025-01-09 00:04:07,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:07,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:07,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-01-09 00:04:07,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-01-09 00:04:07,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:07,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-01-09 00:04:08,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:08,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026840133] [2025-01-09 00:04:08,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026840133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:08,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:08,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:08,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374494198] [2025-01-09 00:04:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:08,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:08,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:08,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:08,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:08,134 INFO L87 Difference]: Start difference. First operand 9075 states and 9846 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 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:04:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:09,228 INFO L93 Difference]: Finished difference Result 22348 states and 24373 transitions. [2025-01-09 00:04:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:09,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 613 [2025-01-09 00:04:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:09,247 INFO L225 Difference]: With dead ends: 22348 [2025-01-09 00:04:09,248 INFO L226 Difference]: Without dead ends: 13574 [2025-01-09 00:04:09,255 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:04:09,256 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 255 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:09,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 553 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:04:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13574 states. [2025-01-09 00:04:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13574 to 13563. [2025-01-09 00:04:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13563 states, 13562 states have (on average 1.0780120926117092) internal successors, (14620), 13562 states have internal predecessors, (14620), 0 states have call successors, (0), 0 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:04:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13563 states to 13563 states and 14620 transitions. [2025-01-09 00:04:09,415 INFO L78 Accepts]: Start accepts. Automaton has 13563 states and 14620 transitions. Word has length 613 [2025-01-09 00:04:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:09,416 INFO L471 AbstractCegarLoop]: Abstraction has 13563 states and 14620 transitions. [2025-01-09 00:04:09,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 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:04:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 13563 states and 14620 transitions. [2025-01-09 00:04:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2025-01-09 00:04:09,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:09,426 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, 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, 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] [2025-01-09 00:04:09,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:04:09,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:09,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:09,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1615893617, now seen corresponding path program 1 times [2025-01-09 00:04:09,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:09,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350252333] [2025-01-09 00:04:09,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:09,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:09,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-01-09 00:04:09,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-01-09 00:04:09,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:09,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-01-09 00:04:09,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:09,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350252333] [2025-01-09 00:04:09,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350252333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:09,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:09,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:09,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650332280] [2025-01-09 00:04:09,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:09,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:09,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:09,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:09,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:09,718 INFO L87 Difference]: Start difference. First operand 13563 states and 14620 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:04:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:10,841 INFO L93 Difference]: Finished difference Result 29515 states and 32056 transitions. [2025-01-09 00:04:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:10,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 618 [2025-01-09 00:04:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:10,858 INFO L225 Difference]: With dead ends: 29515 [2025-01-09 00:04:10,859 INFO L226 Difference]: Without dead ends: 16253 [2025-01-09 00:04:10,868 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:04:10,869 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 302 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:10,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 424 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:04:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16253 states. [2025-01-09 00:04:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16253 to 15954. [2025-01-09 00:04:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15954 states, 15953 states have (on average 1.082617689462797) internal successors, (17271), 15953 states have internal predecessors, (17271), 0 states have call successors, (0), 0 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:04:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15954 states to 15954 states and 17271 transitions. [2025-01-09 00:04:11,007 INFO L78 Accepts]: Start accepts. Automaton has 15954 states and 17271 transitions. Word has length 618 [2025-01-09 00:04:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:11,007 INFO L471 AbstractCegarLoop]: Abstraction has 15954 states and 17271 transitions. [2025-01-09 00:04:11,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:04:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 15954 states and 17271 transitions. [2025-01-09 00:04:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-01-09 00:04:11,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:11,014 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:11,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:04:11,015 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:11,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1569820586, now seen corresponding path program 1 times [2025-01-09 00:04:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:11,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171188398] [2025-01-09 00:04:11,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:11,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-01-09 00:04:11,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-01-09 00:04:11,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:11,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 88 proven. 247 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2025-01-09 00:04:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:11,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171188398] [2025-01-09 00:04:11,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171188398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:04:11,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501370153] [2025-01-09 00:04:11,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:11,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:04:11,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:04:11,732 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:04:11,736 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:04:11,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-01-09 00:04:11,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-01-09 00:04:11,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:11,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:11,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:04:11,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:04:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2025-01-09 00:04:12,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:04:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501370153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:12,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:04:12,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:04:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356003097] [2025-01-09 00:04:12,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:12,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:12,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:12,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:04:12,003 INFO L87 Difference]: Start difference. First operand 15954 states and 17271 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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:04:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:13,238 INFO L93 Difference]: Finished difference Result 31003 states and 33608 transitions. [2025-01-09 00:04:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:13,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 642 [2025-01-09 00:04:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:13,252 INFO L225 Difference]: With dead ends: 31003 [2025-01-09 00:04:13,252 INFO L226 Difference]: Without dead ends: 15350 [2025-01-09 00:04:13,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:04:13,263 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 284 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:13,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 535 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:04:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15350 states. [2025-01-09 00:04:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15350 to 14751. [2025-01-09 00:04:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14751 states, 14750 states have (on average 1.0528813559322034) internal successors, (15530), 14750 states have internal predecessors, (15530), 0 states have call successors, (0), 0 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:04:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14751 states to 14751 states and 15530 transitions. [2025-01-09 00:04:13,461 INFO L78 Accepts]: Start accepts. Automaton has 14751 states and 15530 transitions. Word has length 642 [2025-01-09 00:04:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:13,462 INFO L471 AbstractCegarLoop]: Abstraction has 14751 states and 15530 transitions. [2025-01-09 00:04:13,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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:04:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 14751 states and 15530 transitions. [2025-01-09 00:04:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-01-09 00:04:13,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:13,468 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:13,476 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:04:13,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 00:04:13,673 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:13,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1598478701, now seen corresponding path program 1 times [2025-01-09 00:04:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809195083] [2025-01-09 00:04:13,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:13,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 00:04:13,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 00:04:13,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:13,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-01-09 00:04:13,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809195083] [2025-01-09 00:04:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809195083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302731152] [2025-01-09 00:04:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:13,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:13,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:13,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:13,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:13,965 INFO L87 Difference]: Start difference. First operand 14751 states and 15530 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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:04:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:15,037 INFO L93 Difference]: Finished difference Result 33713 states and 35600 transitions. [2025-01-09 00:04:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:15,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 643 [2025-01-09 00:04:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:15,057 INFO L225 Difference]: With dead ends: 33713 [2025-01-09 00:04:15,057 INFO L226 Difference]: Without dead ends: 19263 [2025-01-09 00:04:15,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:04:15,069 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 289 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:15,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 243 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:04:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19263 states. [2025-01-09 00:04:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19263 to 15958. [2025-01-09 00:04:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15958 states, 15957 states have (on average 1.0528294792254183) internal successors, (16800), 15957 states have internal predecessors, (16800), 0 states have call successors, (0), 0 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:04:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 16800 transitions. [2025-01-09 00:04:15,338 INFO L78 Accepts]: Start accepts. Automaton has 15958 states and 16800 transitions. Word has length 643 [2025-01-09 00:04:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:15,339 INFO L471 AbstractCegarLoop]: Abstraction has 15958 states and 16800 transitions. [2025-01-09 00:04:15,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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:04:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 15958 states and 16800 transitions. [2025-01-09 00:04:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2025-01-09 00:04:15,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:15,350 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:15,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:04:15,350 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:15,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash 278712748, now seen corresponding path program 1 times [2025-01-09 00:04:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280428513] [2025-01-09 00:04:15,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:15,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:15,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes. [2025-01-09 00:04:15,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements. [2025-01-09 00:04:15,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:15,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:04:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280428513] [2025-01-09 00:04:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280428513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:15,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624657340] [2025-01-09 00:04:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:15,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:15,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:15,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:15,856 INFO L87 Difference]: Start difference. First operand 15958 states and 16800 transitions. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 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:04:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:17,352 INFO L93 Difference]: Finished difference Result 37006 states and 38965 transitions. [2025-01-09 00:04:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:17,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 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 654 [2025-01-09 00:04:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:17,375 INFO L225 Difference]: With dead ends: 37006 [2025-01-09 00:04:17,375 INFO L226 Difference]: Without dead ends: 18658 [2025-01-09 00:04:17,388 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:04:17,388 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:17,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 534 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:04:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18658 states. [2025-01-09 00:04:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18658 to 15659. [2025-01-09 00:04:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15659 states, 15658 states have (on average 1.0500702516285605) internal successors, (16442), 15658 states have internal predecessors, (16442), 0 states have call successors, (0), 0 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:04:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15659 states to 15659 states and 16442 transitions. [2025-01-09 00:04:17,638 INFO L78 Accepts]: Start accepts. Automaton has 15659 states and 16442 transitions. Word has length 654 [2025-01-09 00:04:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:17,638 INFO L471 AbstractCegarLoop]: Abstraction has 15659 states and 16442 transitions. [2025-01-09 00:04:17,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 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:04:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 15659 states and 16442 transitions. [2025-01-09 00:04:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2025-01-09 00:04:17,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:17,645 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:04:17,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:04:17,645 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:17,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1470110510, now seen corresponding path program 1 times [2025-01-09 00:04:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015205568] [2025-01-09 00:04:17,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:17,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 655 statements into 1 equivalence classes. [2025-01-09 00:04:17,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 655 of 655 statements. [2025-01-09 00:04:17,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:17,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2025-01-09 00:04:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015205568] [2025-01-09 00:04:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015205568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:17,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:17,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:04:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807642975] [2025-01-09 00:04:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:17,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:04:17,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:17,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:04:17,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:04:17,971 INFO L87 Difference]: Start difference. First operand 15659 states and 16442 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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:04:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:18,990 INFO L93 Difference]: Finished difference Result 34018 states and 35756 transitions. [2025-01-09 00:04:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:04:18,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 655 [2025-01-09 00:04:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:19,011 INFO L225 Difference]: With dead ends: 34018 [2025-01-09 00:04:19,012 INFO L226 Difference]: Without dead ends: 18660 [2025-01-09 00:04:19,023 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:04:19,024 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 307 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:19,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 124 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:04:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18660 states. [2025-01-09 00:04:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18660 to 16552. [2025-01-09 00:04:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16552 states, 16551 states have (on average 1.0504501238595856) internal successors, (17386), 16551 states have internal predecessors, (17386), 0 states have call successors, (0), 0 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:04:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16552 states to 16552 states and 17386 transitions. [2025-01-09 00:04:19,246 INFO L78 Accepts]: Start accepts. Automaton has 16552 states and 17386 transitions. Word has length 655 [2025-01-09 00:04:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:19,246 INFO L471 AbstractCegarLoop]: Abstraction has 16552 states and 17386 transitions. [2025-01-09 00:04:19,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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:04:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 16552 states and 17386 transitions. [2025-01-09 00:04:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2025-01-09 00:04:19,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:04:19,259 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:19,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:04:19,259 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:04:19,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:04:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash -487285585, now seen corresponding path program 1 times [2025-01-09 00:04:19,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:04:19,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620739441] [2025-01-09 00:04:19,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:04:19,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:04:19,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 867 statements into 1 equivalence classes. [2025-01-09 00:04:19,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 867 of 867 statements. [2025-01-09 00:04:19,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:04:19,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:04:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 00:04:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:04:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620739441] [2025-01-09 00:04:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620739441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:04:19,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:04:19,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:04:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726854163] [2025-01-09 00:04:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:04:19,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:04:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:04:19,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:04:19,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:04:19,604 INFO L87 Difference]: Start difference. First operand 16552 states and 17386 transitions. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:04:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:04:21,131 INFO L93 Difference]: Finished difference Result 40276 states and 42248 transitions. [2025-01-09 00:04:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:04:21,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 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 867 [2025-01-09 00:04:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:04:21,133 INFO L225 Difference]: With dead ends: 40276 [2025-01-09 00:04:21,133 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:04:21,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:04:21,147 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 603 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:04:21,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 247 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:04:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:04:21,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:04:21,148 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:04:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:04:21,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 867 [2025-01-09 00:04:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:04:21,149 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:04:21,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 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:04:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:04:21,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:04:21,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:04:21,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:04:21,154 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:04:21,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:04:24,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:04:24,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:04:24 BoogieIcfgContainer [2025-01-09 00:04:24,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:04:24,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:04:24,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:04:24,333 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:04:24,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:03:43" (3/4) ... [2025-01-09 00:04:24,340 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:04:24,368 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:04:24,369 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:04:24,371 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:04:24,372 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:04:24,512 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:04:24,512 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:04:24,513 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:04:24,513 INFO L158 Benchmark]: Toolchain (without parser) took 44313.81ms. Allocated memory was 167.8MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 128.2MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 211.8MB. Max. memory is 16.1GB. [2025-01-09 00:04:24,513 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:04:24,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.71ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 55.7MB in the end (delta: 72.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-09 00:04:24,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 186.26ms. Allocated memory is still 167.8MB. Free memory was 55.7MB in the beginning and 96.4MB in the end (delta: -40.7MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2025-01-09 00:04:24,514 INFO L158 Benchmark]: Boogie Preprocessor took 281.27ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 99.1MB in the end (delta: -2.7MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2025-01-09 00:04:24,514 INFO L158 Benchmark]: RCFGBuilder took 2317.13ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 99.1MB in the beginning and 221.5MB in the end (delta: -122.4MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. [2025-01-09 00:04:24,514 INFO L158 Benchmark]: TraceAbstraction took 40566.08ms. Allocated memory was 293.6MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 221.5MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-09 00:04:24,514 INFO L158 Benchmark]: Witness Printer took 179.38ms. Allocated memory is still 2.6GB. Free memory was 2.4GB in the beginning and 2.3GB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:04:24,515 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 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 777.71ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 55.7MB in the end (delta: 72.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 186.26ms. Allocated memory is still 167.8MB. Free memory was 55.7MB in the beginning and 96.4MB in the end (delta: -40.7MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 281.27ms. Allocated memory is still 167.8MB. Free memory was 96.4MB in the beginning and 99.1MB in the end (delta: -2.7MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2317.13ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 99.1MB in the beginning and 221.5MB in the end (delta: -122.4MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40566.08ms. Allocated memory was 293.6MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 221.5MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 179.38ms. Allocated memory is still 2.6GB. Free memory was 2.4GB in the beginning and 2.3GB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. 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: 155]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.3s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5912 SdHoareTripleChecker+Valid, 24.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5912 mSDsluCounter, 7808 SdHoareTripleChecker+Invalid, 21.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 838 mSDsCounter, 3479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19267 IncrementalHoareTripleChecker+Invalid, 22746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3479 mSolverCounterUnsat, 6970 mSDtfsCounter, 19267 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 699 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16552occurred in iteration=19, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 16846 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 9309 NumberOfCodeBlocks, 9309 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 9288 ConstructedInterpolants, 0 QuantifiedInterpolants, 17686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 7914/8161 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: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 == a2) && (0 <= ((long long) a0 + 60))) || (((((long long) a0 + 99) <= 0) && (a2 == 1)) && (((long long) a4 + 86) <= 0))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 4))) || (((((long long) 42 + a4) <= 0) && (3 == a2)) && (a29 <= 43))) || (((((long long) a0 + 99) <= 0) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || (((((long long) 42 + a4) <= 0) && (a2 == 1)) && (332390 <= a0))) || (((((long long) 42 + a4) <= 0) && (a2 == 4)) && (a29 <= 43))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || ((((long long) 42 + a4) <= 0) && (5 <= a2))) || ((2 == a2) && (44 <= a29))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (a29 <= 43))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (3 == a2))) || ((2 == a2) && (0 <= ((long long) a4 + 85)))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1))) || (((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 4))) || ((((long long) 89 + a4) <= 0) && (a2 == 4))) || (((0 <= ((long long) 97 + a0)) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || ((((long long) 89 + a4) <= 0) && (((long long) 144 + a0) <= 0))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 99) <= 0)) && (a2 == 4))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:04:24,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE