./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label40.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5822f6dcecb89719be961a38493299a8716c4a47f733fff54adb51e7e48a109b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:54:19,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:54:19,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:54:19,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:54:19,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:54:19,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:54:19,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:54:19,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:54:19,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:54:19,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:54:19,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:54:19,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:54:19,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:54:19,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:54:19,277 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:54:19,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:54:19,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:54:19,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:54:19,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:54:19,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:54:19,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:54:19,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:54:19,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:54:19,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:54:19,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:54:19,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:54:19,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:54:19,279 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 5822f6dcecb89719be961a38493299a8716c4a47f733fff54adb51e7e48a109b [2025-03-08 01:54:19,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:54:19,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:54:19,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:54:19,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:54:19,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:54:19,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label40.c [2025-03-08 01:54:20,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bddeab427/ac4fbcef0c8e4a6da20bbb19f9c414e0/FLAG92824f361 [2025-03-08 01:54:21,266 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:54:21,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c [2025-03-08 01:54:21,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bddeab427/ac4fbcef0c8e4a6da20bbb19f9c414e0/FLAG92824f361 [2025-03-08 01:54:21,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bddeab427/ac4fbcef0c8e4a6da20bbb19f9c414e0 [2025-03-08 01:54:21,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:54:21,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:54:21,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:54:21,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:54:21,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:54:21,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:54:21" (1/1) ... [2025-03-08 01:54:21,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e45b1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:21, skipping insertion in model container [2025-03-08 01:54:21,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:54:21" (1/1) ... [2025-03-08 01:54:21,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:54:21,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c[4201,4214] [2025-03-08 01:54:22,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:54:22,150 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:54:22,165 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label40.c[4201,4214] [2025-03-08 01:54:22,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:54:22,491 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:54:22,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22 WrapperNode [2025-03-08 01:54:22,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:54:22,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:54:22,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:54:22,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:54:22,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:22,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:22,899 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-08 01:54:22,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:54:22,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:54:22,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:54:22,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:54:22,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:22,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:22,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:23,242 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-03-08 01:54:23,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:23,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:23,358 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:23,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:23,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:23,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:23,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:54:23,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:54:23,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:54:23,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:54:23,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (1/1) ... [2025-03-08 01:54:23,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:54:23,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:54:23,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:54:23,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:54:23,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:54:23,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:54:23,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:54:23,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:54:23,611 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:54:23,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:54:27,654 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-08 01:54:27,654 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-08 01:54:27,655 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-08 01:54:27,941 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-08 01:54:27,941 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:54:27,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:54:27,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:54:27,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:54:27 BoogieIcfgContainer [2025-03-08 01:54:27,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:54:27,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:54:27,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:54:27,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:54:27,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:54:21" (1/3) ... [2025-03-08 01:54:27,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc1fd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:54:27, skipping insertion in model container [2025-03-08 01:54:27,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:22" (2/3) ... [2025-03-08 01:54:27,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc1fd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:54:27, skipping insertion in model container [2025-03-08 01:54:27,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:54:27" (3/3) ... [2025-03-08 01:54:27,987 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label40.c [2025-03-08 01:54:28,000 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:54:28,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label40.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:54:28,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:54:28,081 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;@278217a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:54:28,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:54:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 01:54:28,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:28,093 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] [2025-03-08 01:54:28,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1523607523, now seen corresponding path program 1 times [2025-03-08 01:54:28,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:28,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714578898] [2025-03-08 01:54:28,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:28,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 01:54:28,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 01:54:28,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:28,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:28,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714578898] [2025-03-08 01:54:28,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714578898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:28,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:28,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139291781] [2025-03-08 01:54:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:28,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:28,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:28,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:28,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:28,356 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:31,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:31,634 INFO L93 Difference]: Finished difference Result 3147 states and 5803 transitions. [2025-03-08 01:54:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:31,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-08 01:54:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:31,657 INFO L225 Difference]: With dead ends: 3147 [2025-03-08 01:54:31,658 INFO L226 Difference]: Without dead ends: 1964 [2025-03-08 01:54:31,664 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-03-08 01:54:31,666 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1151 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:31,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 987 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 01:54:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-03-08 01:54:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2025-03-08 01:54:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2025-03-08 01:54:31,789 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 28 [2025-03-08 01:54:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:31,790 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2025-03-08 01:54:31,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:31,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2025-03-08 01:54:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 01:54:31,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:31,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:54:31,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:54:31,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:31,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1375695877, now seen corresponding path program 1 times [2025-03-08 01:54:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:31,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336666238] [2025-03-08 01:54:31,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:31,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 01:54:31,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 01:54:31,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:31,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:32,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336666238] [2025-03-08 01:54:32,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336666238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:32,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:32,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:32,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849696875] [2025-03-08 01:54:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:32,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:32,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:32,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:32,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:32,063 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:34,967 INFO L93 Difference]: Finished difference Result 5542 states and 9222 transitions. [2025-03-08 01:54:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:34,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-08 01:54:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:34,979 INFO L225 Difference]: With dead ends: 5542 [2025-03-08 01:54:34,979 INFO L226 Difference]: Without dead ends: 3593 [2025-03-08 01:54:34,982 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-03-08 01:54:34,982 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:34,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1010 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:54:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2025-03-08 01:54:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3581. [2025-03-08 01:54:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2025-03-08 01:54:35,038 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 99 [2025-03-08 01:54:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:35,039 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2025-03-08 01:54:35,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2025-03-08 01:54:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 01:54:35,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:35,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:54:35,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:54:35,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash -46822146, now seen corresponding path program 1 times [2025-03-08 01:54:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249541581] [2025-03-08 01:54:35,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:35,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 01:54:35,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 01:54:35,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:35,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:35,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:35,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249541581] [2025-03-08 01:54:35,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249541581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:35,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060881204] [2025-03-08 01:54:35,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:35,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:35,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:35,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:35,194 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:37,952 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2025-03-08 01:54:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:37,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-08 01:54:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:37,972 INFO L225 Difference]: With dead ends: 10352 [2025-03-08 01:54:37,973 INFO L226 Difference]: Without dead ends: 6773 [2025-03-08 01:54:37,976 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-03-08 01:54:37,979 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 786 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:37,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1170 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:54:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2025-03-08 01:54:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2025-03-08 01:54:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3255779490219324) internal successors, (8945), 6748 states have internal predecessors, (8945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8945 transitions. [2025-03-08 01:54:38,062 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8945 transitions. Word has length 113 [2025-03-08 01:54:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:38,063 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8945 transitions. [2025-03-08 01:54:38,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8945 transitions. [2025-03-08 01:54:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 01:54:38,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:38,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:54:38,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:54:38,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:38,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash -131449015, now seen corresponding path program 1 times [2025-03-08 01:54:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431131566] [2025-03-08 01:54:38,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:38,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 01:54:38,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 01:54:38,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:38,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:38,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:38,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431131566] [2025-03-08 01:54:38,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431131566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:38,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090299968] [2025-03-08 01:54:38,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:38,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:38,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:38,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:38,238 INFO L87 Difference]: Start difference. First operand 6749 states and 8945 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:41,041 INFO L93 Difference]: Finished difference Result 19873 states and 26326 transitions. [2025-03-08 01:54:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-08 01:54:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:41,071 INFO L225 Difference]: With dead ends: 19873 [2025-03-08 01:54:41,072 INFO L226 Difference]: Without dead ends: 13126 [2025-03-08 01:54:41,079 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-03-08 01:54:41,080 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 901 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2878 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 3432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 2878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:41,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 612 Invalid, 3432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 2878 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:54:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13126 states. [2025-03-08 01:54:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13126 to 13114. [2025-03-08 01:54:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13114 states, 13113 states have (on average 1.2759856630824373) internal successors, (16732), 13113 states have internal predecessors, (16732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 16732 transitions. [2025-03-08 01:54:41,257 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 16732 transitions. Word has length 142 [2025-03-08 01:54:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:41,258 INFO L471 AbstractCegarLoop]: Abstraction has 13114 states and 16732 transitions. [2025-03-08 01:54:41,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 16732 transitions. [2025-03-08 01:54:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 01:54:41,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:41,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:54:41,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:54:41,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:41,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:41,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1562732143, now seen corresponding path program 1 times [2025-03-08 01:54:41,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:41,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398195828] [2025-03-08 01:54:41,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:41,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:41,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 01:54:41,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 01:54:41,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:41,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:41,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:41,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398195828] [2025-03-08 01:54:41,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398195828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:41,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:41,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:41,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151785508] [2025-03-08 01:54:41,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:41,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:54:41,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:41,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:54:41,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:41,503 INFO L87 Difference]: Start difference. First operand 13114 states and 16732 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:47,051 INFO L93 Difference]: Finished difference Result 45404 states and 59058 transitions. [2025-03-08 01:54:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:54:47,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2025-03-08 01:54:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:47,150 INFO L225 Difference]: With dead ends: 45404 [2025-03-08 01:54:47,153 INFO L226 Difference]: Without dead ends: 33079 [2025-03-08 01:54:47,170 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-03-08 01:54:47,171 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 1667 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 6114 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 6744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 6114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:47,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 1115 Invalid, 6744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 6114 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-08 01:54:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33079 states. [2025-03-08 01:54:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33079 to 32857. [2025-03-08 01:54:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32857 states, 32856 states have (on average 1.232499391283175) internal successors, (40495), 32856 states have internal predecessors, (40495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32857 states to 32857 states and 40495 transitions. [2025-03-08 01:54:47,530 INFO L78 Accepts]: Start accepts. Automaton has 32857 states and 40495 transitions. Word has length 153 [2025-03-08 01:54:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:47,530 INFO L471 AbstractCegarLoop]: Abstraction has 32857 states and 40495 transitions. [2025-03-08 01:54:47,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 32857 states and 40495 transitions. [2025-03-08 01:54:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 01:54:47,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:47,534 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:54:47,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:54:47,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:47,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1590960609, now seen corresponding path program 1 times [2025-03-08 01:54:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952093734] [2025-03-08 01:54:47,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:47,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 01:54:47,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 01:54:47,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:47,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 01:54:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952093734] [2025-03-08 01:54:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952093734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:47,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:47,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937409227] [2025-03-08 01:54:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:47,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:47,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:47,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:47,922 INFO L87 Difference]: Start difference. First operand 32857 states and 40495 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:50,206 INFO L93 Difference]: Finished difference Result 64925 states and 80181 transitions. [2025-03-08 01:54:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:50,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 218 [2025-03-08 01:54:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:50,267 INFO L225 Difference]: With dead ends: 64925 [2025-03-08 01:54:50,267 INFO L226 Difference]: Without dead ends: 32857 [2025-03-08 01:54:50,294 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-03-08 01:54:50,295 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:50,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 01:54:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32857 states. [2025-03-08 01:54:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32857 to 32857. [2025-03-08 01:54:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32857 states, 32856 states have (on average 1.2321950328707085) internal successors, (40485), 32856 states have internal predecessors, (40485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32857 states to 32857 states and 40485 transitions. [2025-03-08 01:54:50,606 INFO L78 Accepts]: Start accepts. Automaton has 32857 states and 40485 transitions. Word has length 218 [2025-03-08 01:54:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:50,607 INFO L471 AbstractCegarLoop]: Abstraction has 32857 states and 40485 transitions. [2025-03-08 01:54:50,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32857 states and 40485 transitions. [2025-03-08 01:54:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 01:54:50,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:50,610 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:54:50,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:54:50,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:50,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2020631325, now seen corresponding path program 1 times [2025-03-08 01:54:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745949042] [2025-03-08 01:54:50,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:50,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 01:54:50,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 01:54:50,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:50,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745949042] [2025-03-08 01:54:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745949042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:50,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515229064] [2025-03-08 01:54:50,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:50,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:54:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:50,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:54:50,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:50,787 INFO L87 Difference]: Start difference. First operand 32857 states and 40485 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:55,987 INFO L93 Difference]: Finished difference Result 88879 states and 111172 transitions. [2025-03-08 01:54:55,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:54:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-08 01:54:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:56,068 INFO L225 Difference]: With dead ends: 88879 [2025-03-08 01:54:56,068 INFO L226 Difference]: Without dead ends: 56811 [2025-03-08 01:54:56,097 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-03-08 01:54:56,098 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 1722 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 6961 mSolverCounterSat, 1070 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 8031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1070 IncrementalHoareTripleChecker+Valid, 6961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:56,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 1030 Invalid, 8031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1070 Valid, 6961 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-08 01:54:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56811 states. [2025-03-08 01:54:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56811 to 56623. [2025-03-08 01:54:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56623 states, 56622 states have (on average 1.2245416975733814) internal successors, (69336), 56622 states have internal predecessors, (69336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56623 states to 56623 states and 69336 transitions. [2025-03-08 01:54:56,753 INFO L78 Accepts]: Start accepts. Automaton has 56623 states and 69336 transitions. Word has length 225 [2025-03-08 01:54:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:56,753 INFO L471 AbstractCegarLoop]: Abstraction has 56623 states and 69336 transitions. [2025-03-08 01:54:56,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:54:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 56623 states and 69336 transitions. [2025-03-08 01:54:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-08 01:54:56,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:56,756 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:54:56,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:54:56,756 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:56,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1420530696, now seen corresponding path program 1 times [2025-03-08 01:54:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:56,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742702456] [2025-03-08 01:54:56,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:56,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:56,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-08 01:54:56,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-08 01:54:56,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:56,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742702456] [2025-03-08 01:54:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742702456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364873142] [2025-03-08 01:54:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:56,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:56,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:56,955 INFO L87 Difference]: Start difference. First operand 56623 states and 69336 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:00,171 INFO L93 Difference]: Finished difference Result 137657 states and 172287 transitions. [2025-03-08 01:55:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:00,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 235 [2025-03-08 01:55:00,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:00,282 INFO L225 Difference]: With dead ends: 137657 [2025-03-08 01:55:00,283 INFO L226 Difference]: Without dead ends: 81823 [2025-03-08 01:55:00,314 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-03-08 01:55:00,314 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 825 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 888 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 888 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:00,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1059 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [888 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:55:00,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81823 states. [2025-03-08 01:55:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81823 to 81808. [2025-03-08 01:55:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81808 states, 81807 states have (on average 1.206155952424609) internal successors, (98672), 81807 states have internal predecessors, (98672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81808 states to 81808 states and 98672 transitions. [2025-03-08 01:55:01,392 INFO L78 Accepts]: Start accepts. Automaton has 81808 states and 98672 transitions. Word has length 235 [2025-03-08 01:55:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:01,393 INFO L471 AbstractCegarLoop]: Abstraction has 81808 states and 98672 transitions. [2025-03-08 01:55:01,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 81808 states and 98672 transitions. [2025-03-08 01:55:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-08 01:55:01,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:01,397 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:55:01,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:55:01,397 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:01,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:01,398 INFO L85 PathProgramCache]: Analyzing trace with hash -806502592, now seen corresponding path program 1 times [2025-03-08 01:55:01,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:01,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094691884] [2025-03-08 01:55:01,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:01,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:01,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-08 01:55:01,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-08 01:55:01,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:01,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:55:01,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:01,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094691884] [2025-03-08 01:55:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094691884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:01,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:55:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472395476] [2025-03-08 01:55:01,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:01,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:01,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:01,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:01,515 INFO L87 Difference]: Start difference. First operand 81808 states and 98672 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:04,429 INFO L93 Difference]: Finished difference Result 161019 states and 194543 transitions. [2025-03-08 01:55:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:04,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 242 [2025-03-08 01:55:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:04,527 INFO L225 Difference]: With dead ends: 161019 [2025-03-08 01:55:04,527 INFO L226 Difference]: Without dead ends: 80000 [2025-03-08 01:55:04,555 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-03-08 01:55:04,556 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 1038 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:04,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1669 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:55:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80000 states. [2025-03-08 01:55:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80000 to 79991. [2025-03-08 01:55:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79991 states, 79990 states have (on average 1.1415301912739093) internal successors, (91311), 79990 states have internal predecessors, (91311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79991 states to 79991 states and 91311 transitions. [2025-03-08 01:55:05,343 INFO L78 Accepts]: Start accepts. Automaton has 79991 states and 91311 transitions. Word has length 242 [2025-03-08 01:55:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:05,343 INFO L471 AbstractCegarLoop]: Abstraction has 79991 states and 91311 transitions. [2025-03-08 01:55:05,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 79991 states and 91311 transitions. [2025-03-08 01:55:05,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-08 01:55:05,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:05,345 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:55:05,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:55:05,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:05,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:05,346 INFO L85 PathProgramCache]: Analyzing trace with hash 640842454, now seen corresponding path program 1 times [2025-03-08 01:55:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:05,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118380857] [2025-03-08 01:55:05,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:05,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:05,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-08 01:55:05,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-08 01:55:05,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:05,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 01:55:05,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:05,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118380857] [2025-03-08 01:55:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118380857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:05,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:05,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:55:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152728295] [2025-03-08 01:55:05,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:05,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:05,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:05,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:05,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:05,542 INFO L87 Difference]: Start difference. First operand 79991 states and 91311 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:08,796 INFO L93 Difference]: Finished difference Result 211905 states and 243536 transitions. [2025-03-08 01:55:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:08,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2025-03-08 01:55:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:08,942 INFO L225 Difference]: With dead ends: 211905 [2025-03-08 01:55:08,942 INFO L226 Difference]: Without dead ends: 132703 [2025-03-08 01:55:08,975 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-03-08 01:55:08,975 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 814 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 863 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:08,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1049 Invalid, 3223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [863 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:55:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132703 states. [2025-03-08 01:55:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132703 to 124820. [2025-03-08 01:55:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124820 states, 124819 states have (on average 1.1132439772791) internal successors, (138954), 124819 states have internal predecessors, (138954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124820 states to 124820 states and 138954 transitions. [2025-03-08 01:55:10,304 INFO L78 Accepts]: Start accepts. Automaton has 124820 states and 138954 transitions. Word has length 258 [2025-03-08 01:55:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:10,304 INFO L471 AbstractCegarLoop]: Abstraction has 124820 states and 138954 transitions. [2025-03-08 01:55:10,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:10,304 INFO L276 IsEmpty]: Start isEmpty. Operand 124820 states and 138954 transitions. [2025-03-08 01:55:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-08 01:55:10,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:10,307 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:55:10,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:55:10,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:10,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 875844530, now seen corresponding path program 1 times [2025-03-08 01:55:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:10,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366459876] [2025-03-08 01:55:10,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:10,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:10,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-08 01:55:10,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-08 01:55:10,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:10,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 01:55:10,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366459876] [2025-03-08 01:55:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366459876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:10,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:10,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:55:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391409931] [2025-03-08 01:55:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:10,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:10,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:10,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:10,502 INFO L87 Difference]: Start difference. First operand 124820 states and 138954 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:13,476 INFO L93 Difference]: Finished difference Result 251216 states and 279500 transitions. [2025-03-08 01:55:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 314 [2025-03-08 01:55:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:13,612 INFO L225 Difference]: With dead ends: 251216 [2025-03-08 01:55:13,612 INFO L226 Difference]: Without dead ends: 127185 [2025-03-08 01:55:13,647 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-03-08 01:55:13,648 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 939 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:13,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1479 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 01:55:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127185 states. [2025-03-08 01:55:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127185 to 124813. [2025-03-08 01:55:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124813 states, 124812 states have (on average 1.0930439380828767) internal successors, (136425), 124812 states have internal predecessors, (136425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124813 states to 124813 states and 136425 transitions. [2025-03-08 01:55:14,898 INFO L78 Accepts]: Start accepts. Automaton has 124813 states and 136425 transitions. Word has length 314 [2025-03-08 01:55:14,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:14,899 INFO L471 AbstractCegarLoop]: Abstraction has 124813 states and 136425 transitions. [2025-03-08 01:55:14,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 124813 states and 136425 transitions. [2025-03-08 01:55:14,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-08 01:55:14,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:14,902 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:55:14,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:55:14,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:14,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2142153705, now seen corresponding path program 1 times [2025-03-08 01:55:14,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:14,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736657833] [2025-03-08 01:55:14,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:14,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 01:55:14,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 01:55:14,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:14,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 01:55:15,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:15,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736657833] [2025-03-08 01:55:15,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736657833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:15,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:15,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:55:15,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91050977] [2025-03-08 01:55:15,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:15,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:15,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:15,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:15,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:15,186 INFO L87 Difference]: Start difference. First operand 124813 states and 136425 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:18,215 INFO L93 Difference]: Finished difference Result 282686 states and 310306 transitions. [2025-03-08 01:55:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:18,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 324 [2025-03-08 01:55:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:18,412 INFO L225 Difference]: With dead ends: 282686 [2025-03-08 01:55:18,412 INFO L226 Difference]: Without dead ends: 158662 [2025-03-08 01:55:18,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-03-08 01:55:18,471 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 894 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:18,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 843 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 01:55:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158662 states. [2025-03-08 01:55:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158662 to 157068. [2025-03-08 01:55:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157068 states, 157067 states have (on average 1.0880515958157984) internal successors, (170897), 157067 states have internal predecessors, (170897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157068 states to 157068 states and 170897 transitions. [2025-03-08 01:55:19,910 INFO L78 Accepts]: Start accepts. Automaton has 157068 states and 170897 transitions. Word has length 324 [2025-03-08 01:55:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:19,910 INFO L471 AbstractCegarLoop]: Abstraction has 157068 states and 170897 transitions. [2025-03-08 01:55:19,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 157068 states and 170897 transitions. [2025-03-08 01:55:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-08 01:55:19,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:19,913 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:55:19,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:55:19,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:19,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1150584725, now seen corresponding path program 1 times [2025-03-08 01:55:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:19,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993362816] [2025-03-08 01:55:19,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:19,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:19,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-08 01:55:19,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-08 01:55:19,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:19,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 01:55:20,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:20,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993362816] [2025-03-08 01:55:20,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993362816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:20,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:20,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:55:20,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817635138] [2025-03-08 01:55:20,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:20,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:20,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:20,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:20,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:20,319 INFO L87 Difference]: Start difference. First operand 157068 states and 170897 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:23,284 INFO L93 Difference]: Finished difference Result 315742 states and 343409 transitions. [2025-03-08 01:55:23,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:23,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 341 [2025-03-08 01:55:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:23,451 INFO L225 Difference]: With dead ends: 315742 [2025-03-08 01:55:23,451 INFO L226 Difference]: Without dead ends: 156310 [2025-03-08 01:55:23,519 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-03-08 01:55:23,520 INFO L435 NwaCegarLoop]: 1744 mSDtfsCounter, 770 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:23,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1882 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 01:55:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156310 states. [2025-03-08 01:55:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156310 to 152334. [2025-03-08 01:55:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152334 states, 152333 states have (on average 1.0791883570861205) internal successors, (164396), 152333 states have internal predecessors, (164396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152334 states to 152334 states and 164396 transitions. [2025-03-08 01:55:25,027 INFO L78 Accepts]: Start accepts. Automaton has 152334 states and 164396 transitions. Word has length 341 [2025-03-08 01:55:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:25,028 INFO L471 AbstractCegarLoop]: Abstraction has 152334 states and 164396 transitions. [2025-03-08 01:55:25,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 152334 states and 164396 transitions. [2025-03-08 01:55:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-08 01:55:25,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:25,031 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:55:25,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:55:25,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:25,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1871222572, now seen corresponding path program 1 times [2025-03-08 01:55:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:25,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424768772] [2025-03-08 01:55:25,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:25,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-08 01:55:25,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-08 01:55:25,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:25,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:55:25,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:25,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424768772] [2025-03-08 01:55:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424768772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:25,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:55:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124174582] [2025-03-08 01:55:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:25,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:55:25,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:25,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:55:25,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:55:25,486 INFO L87 Difference]: Start difference. First operand 152334 states and 164396 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:30,948 INFO L93 Difference]: Finished difference Result 329921 states and 357854 transitions. [2025-03-08 01:55:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:55:30,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 355 [2025-03-08 01:55:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:31,183 INFO L225 Difference]: With dead ends: 329921 [2025-03-08 01:55:31,183 INFO L226 Difference]: Without dead ends: 194909 [2025-03-08 01:55:31,478 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-03-08 01:55:31,479 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 1627 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 6115 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 6837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 6115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:31,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 1036 Invalid, 6837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 6115 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 01:55:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194909 states. [2025-03-08 01:55:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194909 to 173604. [2025-03-08 01:55:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173604 states, 173603 states have (on average 1.0739157733449307) internal successors, (186435), 173603 states have internal predecessors, (186435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173604 states to 173604 states and 186435 transitions. [2025-03-08 01:55:33,326 INFO L78 Accepts]: Start accepts. Automaton has 173604 states and 186435 transitions. Word has length 355 [2025-03-08 01:55:33,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:33,326 INFO L471 AbstractCegarLoop]: Abstraction has 173604 states and 186435 transitions. [2025-03-08 01:55:33,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 173604 states and 186435 transitions. [2025-03-08 01:55:33,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-08 01:55:33,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:33,329 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:55:33,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:55:33,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:33,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1001551340, now seen corresponding path program 1 times [2025-03-08 01:55:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548828037] [2025-03-08 01:55:33,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:33,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-08 01:55:33,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-08 01:55:33,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:33,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 255 proven. 110 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 01:55:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548828037] [2025-03-08 01:55:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548828037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:55:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970992686] [2025-03-08 01:55:34,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:34,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:55:34,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:55:34,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:55:34,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:55:34,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-08 01:55:34,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-08 01:55:34,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:34,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:34,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:55:34,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:55:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 01:55:34,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:55:34,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970992686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:34,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:55:34,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:55:34,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069520726] [2025-03-08 01:55:34,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:34,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:34,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:34,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:55:34,265 INFO L87 Difference]: Start difference. First operand 173604 states and 186435 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:36,926 INFO L93 Difference]: Finished difference Result 344056 states and 369410 transitions. [2025-03-08 01:55:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:36,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 370 [2025-03-08 01:55:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:37,127 INFO L225 Difference]: With dead ends: 344056 [2025-03-08 01:55:37,128 INFO L226 Difference]: Without dead ends: 171241 [2025-03-08 01:55:37,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:55:37,207 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 1094 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:37,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1412 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 01:55:37,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171241 states. [2025-03-08 01:55:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171241 to 169661. [2025-03-08 01:55:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169661 states, 169660 states have (on average 1.056029706471767) internal successors, (179166), 169660 states have internal predecessors, (179166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169661 states to 169661 states and 179166 transitions. [2025-03-08 01:55:39,231 INFO L78 Accepts]: Start accepts. Automaton has 169661 states and 179166 transitions. Word has length 370 [2025-03-08 01:55:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:39,231 INFO L471 AbstractCegarLoop]: Abstraction has 169661 states and 179166 transitions. [2025-03-08 01:55:39,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 169661 states and 179166 transitions. [2025-03-08 01:55:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-08 01:55:39,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:39,236 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:55:39,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 01:55:39,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 01:55:39,436 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:39,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1662983711, now seen corresponding path program 1 times [2025-03-08 01:55:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:39,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005411315] [2025-03-08 01:55:39,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:39,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-08 01:55:39,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-08 01:55:39,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:39,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2025-03-08 01:55:40,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:40,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005411315] [2025-03-08 01:55:40,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005411315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:40,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:40,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:55:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392699797] [2025-03-08 01:55:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:40,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:55:40,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:40,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:55:40,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:55:40,147 INFO L87 Difference]: Start difference. First operand 169661 states and 179166 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)