./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5de4c46c7cdadd96e091f691a19e362de9991e387636643426a8b01f7f6942d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:55:40,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:55:40,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:55:40,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:55:40,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:55:40,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:55:40,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:55:40,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:55:40,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:55:40,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:55:40,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:55:40,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:55:40,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:55:40,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:55:40,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:55:40,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:55:40,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:55:40,546 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:55:40,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:55:40,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:55:40,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:55:40,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:55:40,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:55:40,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:55:40,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:55:40,546 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5de4c46c7cdadd96e091f691a19e362de9991e387636643426a8b01f7f6942d0 [2025-02-05 21:55:40,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:55:40,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:55:40,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:55:40,820 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:55:40,820 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:55:40,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i [2025-02-05 21:55:42,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/370929938/a1bf10dd80a640b2ba653449b0c185a6/FLAG6de3b1042 [2025-02-05 21:55:42,500 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:55:42,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i [2025-02-05 21:55:42,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/370929938/a1bf10dd80a640b2ba653449b0c185a6/FLAG6de3b1042 [2025-02-05 21:55:42,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/370929938/a1bf10dd80a640b2ba653449b0c185a6 [2025-02-05 21:55:42,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:55:42,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:55:42,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:55:42,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:55:42,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:55:42,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:55:42" (1/1) ... [2025-02-05 21:55:42,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50629538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:42, skipping insertion in model container [2025-02-05 21:55:42,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:55:42" (1/1) ... [2025-02-05 21:55:42,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:55:42,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i[916,929] [2025-02-05 21:55:42,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:55:42,986 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:55:42,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i[916,929] [2025-02-05 21:55:43,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:55:43,056 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:55:43,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43 WrapperNode [2025-02-05 21:55:43,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:55:43,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:55:43,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:55:43,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:55:43,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,139 INFO L138 Inliner]: procedures = 26, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 740 [2025-02-05 21:55:43,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:55:43,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:55:43,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:55:43,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:55:43,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,224 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:55:43,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:55:43,285 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:55:43,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:55:43,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:55:43,287 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (1/1) ... [2025-02-05 21:55:43,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:55:43,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:55:43,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:55:43,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:55:43,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:55:43,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:55:43,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:55:43,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:55:43,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:55:43,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:55:43,460 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:55:43,462 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:55:44,405 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-05 21:55:44,406 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:55:44,425 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:55:44,425 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:55:44,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:55:44 BoogieIcfgContainer [2025-02-05 21:55:44,426 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:55:44,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:55:44,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:55:44,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:55:44,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:55:42" (1/3) ... [2025-02-05 21:55:44,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac6d3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:55:44, skipping insertion in model container [2025-02-05 21:55:44,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:43" (2/3) ... [2025-02-05 21:55:44,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac6d3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:55:44, skipping insertion in model container [2025-02-05 21:55:44,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:55:44" (3/3) ... [2025-02-05 21:55:44,433 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-19.i [2025-02-05 21:55:44,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:55:44,444 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-19.i that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:55:44,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:55:44,491 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;@3c2413dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:55:44,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:55:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 209 states have (on average 1.61244019138756) internal successors, (337), 210 states have internal predecessors, (337), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 21:55:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-05 21:55:44,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:44,510 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:44,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:44,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2115927175, now seen corresponding path program 1 times [2025-02-05 21:55:44,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985316001] [2025-02-05 21:55:44,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:44,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:44,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-05 21:55:44,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-05 21:55:44,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:44,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-02-05 21:55:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985316001] [2025-02-05 21:55:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985316001] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:55:45,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317955152] [2025-02-05 21:55:45,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:45,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:55:45,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:55:45,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:55:45,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:55:45,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-05 21:55:45,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-05 21:55:45,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:45,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:45,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:55:45,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:55:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-02-05 21:55:45,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:55:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317955152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:55:45,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:55:45,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568979365] [2025-02-05 21:55:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:45,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:55:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:45,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:55:45,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:55:45,449 INFO L87 Difference]: Start difference. First operand has 302 states, 209 states have (on average 1.61244019138756) internal successors, (337), 210 states have internal predecessors, (337), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-02-05 21:55:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:45,504 INFO L93 Difference]: Finished difference Result 593 states and 1109 transitions. [2025-02-05 21:55:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:55:45,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) Word has length 594 [2025-02-05 21:55:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:45,513 INFO L225 Difference]: With dead ends: 593 [2025-02-05 21:55:45,513 INFO L226 Difference]: Without dead ends: 294 [2025-02-05 21:55:45,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:55:45,522 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:45,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-05 21:55:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-02-05 21:55:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 202 states have (on average 1.5742574257425743) internal successors, (318), 202 states have internal predecessors, (318), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 21:55:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2025-02-05 21:55:45,583 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 594 [2025-02-05 21:55:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:45,583 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2025-02-05 21:55:45,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-02-05 21:55:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2025-02-05 21:55:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-05 21:55:45,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:45,594 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:45,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:55:45,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:55:45,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:45,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash 401235624, now seen corresponding path program 1 times [2025-02-05 21:55:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:45,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739631317] [2025-02-05 21:55:45,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:45,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-05 21:55:45,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-05 21:55:45,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:45,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-02-05 21:55:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739631317] [2025-02-05 21:55:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739631317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:46,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423070140] [2025-02-05 21:55:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:46,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:46,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:46,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:46,462 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:46,569 INFO L93 Difference]: Finished difference Result 780 states and 1320 transitions. [2025-02-05 21:55:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-02-05 21:55:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:46,575 INFO L225 Difference]: With dead ends: 780 [2025-02-05 21:55:46,575 INFO L226 Difference]: Without dead ends: 489 [2025-02-05 21:55:46,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:46,577 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 291 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:46,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1110 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-05 21:55:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2025-02-05 21:55:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 337 states have (on average 1.5697329376854599) internal successors, (529), 338 states have internal predecessors, (529), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 145 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-05 21:55:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 821 transitions. [2025-02-05 21:55:46,628 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 821 transitions. Word has length 594 [2025-02-05 21:55:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:46,629 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 821 transitions. [2025-02-05 21:55:46,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 821 transitions. [2025-02-05 21:55:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-05 21:55:46,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:46,638 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:46,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:55:46,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:46,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:46,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1094337321, now seen corresponding path program 1 times [2025-02-05 21:55:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:46,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063543126] [2025-02-05 21:55:46,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:46,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-05 21:55:46,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-05 21:55:46,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:46,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-02-05 21:55:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:46,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063543126] [2025-02-05 21:55:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063543126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101991274] [2025-02-05 21:55:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:46,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:46,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:46,978 INFO L87 Difference]: Start difference. First operand 486 states and 821 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:47,062 INFO L93 Difference]: Finished difference Result 1305 states and 2197 transitions. [2025-02-05 21:55:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:47,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-02-05 21:55:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:47,074 INFO L225 Difference]: With dead ends: 1305 [2025-02-05 21:55:47,074 INFO L226 Difference]: Without dead ends: 822 [2025-02-05 21:55:47,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:47,081 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 265 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:47,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1139 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-05 21:55:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2025-02-05 21:55:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 554 states have (on average 1.536101083032491) internal successors, (851), 557 states have internal predecessors, (851), 260 states have call successors, (260), 4 states have call predecessors, (260), 4 states have return successors, (260), 257 states have call predecessors, (260), 260 states have call successors, (260) [2025-02-05 21:55:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1371 transitions. [2025-02-05 21:55:47,169 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1371 transitions. Word has length 594 [2025-02-05 21:55:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:47,171 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1371 transitions. [2025-02-05 21:55:47,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1371 transitions. [2025-02-05 21:55:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-05 21:55:47,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:47,182 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:47,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:55:47,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:47,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1274038985, now seen corresponding path program 1 times [2025-02-05 21:55:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796117036] [2025-02-05 21:55:47,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:47,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-05 21:55:47,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-05 21:55:47,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:47,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-02-05 21:55:48,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796117036] [2025-02-05 21:55:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796117036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:48,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:48,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:55:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002362813] [2025-02-05 21:55:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:48,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:55:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:48,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:55:48,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:55:48,041 INFO L87 Difference]: Start difference. First operand 819 states and 1371 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:48,886 INFO L93 Difference]: Finished difference Result 3377 states and 5598 transitions. [2025-02-05 21:55:48,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:55:48,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-02-05 21:55:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:48,905 INFO L225 Difference]: With dead ends: 3377 [2025-02-05 21:55:48,905 INFO L226 Difference]: Without dead ends: 2561 [2025-02-05 21:55:48,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:55:48,910 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 867 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:48,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1670 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:55:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-02-05 21:55:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 1655. [2025-02-05 21:55:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1170 states have (on average 1.5683760683760684) internal successors, (1835), 1177 states have internal predecessors, (1835), 476 states have call successors, (476), 8 states have call predecessors, (476), 8 states have return successors, (476), 469 states have call predecessors, (476), 476 states have call successors, (476) [2025-02-05 21:55:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2787 transitions. [2025-02-05 21:55:49,091 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2787 transitions. Word has length 594 [2025-02-05 21:55:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:49,091 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2787 transitions. [2025-02-05 21:55:49,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2787 transitions. [2025-02-05 21:55:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-02-05 21:55:49,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:49,101 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:49,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:55:49,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:49,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:49,102 INFO L85 PathProgramCache]: Analyzing trace with hash 429567114, now seen corresponding path program 1 times [2025-02-05 21:55:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333809359] [2025-02-05 21:55:49,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:49,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-02-05 21:55:49,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-02-05 21:55:49,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:49,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-02-05 21:55:49,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:49,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333809359] [2025-02-05 21:55:49,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333809359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:49,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:49,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:49,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186203229] [2025-02-05 21:55:49,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:49,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:49,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:49,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:49,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:49,577 INFO L87 Difference]: Start difference. First operand 1655 states and 2787 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:49,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:49,778 INFO L93 Difference]: Finished difference Result 4959 states and 8355 transitions. [2025-02-05 21:55:49,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:49,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-02-05 21:55:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:49,801 INFO L225 Difference]: With dead ends: 4959 [2025-02-05 21:55:49,801 INFO L226 Difference]: Without dead ends: 3307 [2025-02-05 21:55:49,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:49,808 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 317 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:49,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2025-02-05 21:55:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3305. [2025-02-05 21:55:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2336 states have (on average 1.5684931506849316) internal successors, (3664), 2350 states have internal predecessors, (3664), 952 states have call successors, (952), 16 states have call predecessors, (952), 16 states have return successors, (952), 938 states have call predecessors, (952), 952 states have call successors, (952) [2025-02-05 21:55:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 5568 transitions. [2025-02-05 21:55:50,092 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 5568 transitions. Word has length 594 [2025-02-05 21:55:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:50,093 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 5568 transitions. [2025-02-05 21:55:50,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 5568 transitions. [2025-02-05 21:55:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-02-05 21:55:50,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:50,101 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:50,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:55:50,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:50,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1888398096, now seen corresponding path program 1 times [2025-02-05 21:55:50,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:50,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128171081] [2025-02-05 21:55:50,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:50,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-02-05 21:55:50,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-02-05 21:55:50,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:50,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-02-05 21:55:50,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:50,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128171081] [2025-02-05 21:55:50,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128171081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:50,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:50,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:50,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029917433] [2025-02-05 21:55:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:50,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:50,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:50,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:50,710 INFO L87 Difference]: Start difference. First operand 3305 states and 5568 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:50,970 INFO L93 Difference]: Finished difference Result 8470 states and 14245 transitions. [2025-02-05 21:55:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:50,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 595 [2025-02-05 21:55:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:50,996 INFO L225 Difference]: With dead ends: 8470 [2025-02-05 21:55:50,997 INFO L226 Difference]: Without dead ends: 5168 [2025-02-05 21:55:51,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:51,009 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 289 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:51,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1015 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2025-02-05 21:55:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 5158. [2025-02-05 21:55:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5158 states, 3608 states have (on average 1.5518292682926829) internal successors, (5599), 3629 states have internal predecessors, (5599), 1520 states have call successors, (1520), 29 states have call predecessors, (1520), 29 states have return successors, (1520), 1499 states have call predecessors, (1520), 1520 states have call successors, (1520) [2025-02-05 21:55:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5158 states to 5158 states and 8639 transitions. [2025-02-05 21:55:51,380 INFO L78 Accepts]: Start accepts. Automaton has 5158 states and 8639 transitions. Word has length 595 [2025-02-05 21:55:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:51,382 INFO L471 AbstractCegarLoop]: Abstraction has 5158 states and 8639 transitions. [2025-02-05 21:55:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5158 states and 8639 transitions. [2025-02-05 21:55:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-05 21:55:51,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:51,390 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:51,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:55:51,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:51,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1779058930, now seen corresponding path program 1 times [2025-02-05 21:55:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:51,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016082332] [2025-02-05 21:55:51,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:51,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-05 21:55:51,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-05 21:55:51,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:51,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-02-05 21:55:52,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:52,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016082332] [2025-02-05 21:55:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016082332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:52,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981167226] [2025-02-05 21:55:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:52,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:52,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:52,639 INFO L87 Difference]: Start difference. First operand 5158 states and 8639 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:53,715 INFO L93 Difference]: Finished difference Result 14298 states and 23991 transitions. [2025-02-05 21:55:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:53,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 596 [2025-02-05 21:55:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:53,763 INFO L225 Difference]: With dead ends: 14298 [2025-02-05 21:55:53,763 INFO L226 Difference]: Without dead ends: 9238 [2025-02-05 21:55:53,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:53,778 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 328 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:53,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 942 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:55:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9238 states. [2025-02-05 21:55:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9238 to 9212. [2025-02-05 21:55:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9212 states, 6798 states have (on average 1.582230067666961) internal successors, (10756), 6843 states have internal predecessors, (10756), 2360 states have call successors, (2360), 53 states have call predecessors, (2360), 53 states have return successors, (2360), 2315 states have call predecessors, (2360), 2360 states have call successors, (2360) [2025-02-05 21:55:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9212 states to 9212 states and 15476 transitions. [2025-02-05 21:55:54,985 INFO L78 Accepts]: Start accepts. Automaton has 9212 states and 15476 transitions. Word has length 596 [2025-02-05 21:55:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:54,985 INFO L471 AbstractCegarLoop]: Abstraction has 9212 states and 15476 transitions. [2025-02-05 21:55:54,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:55:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9212 states and 15476 transitions. [2025-02-05 21:55:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-05 21:55:55,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:55,001 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:55:55,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:55:55,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:55,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:55,002 INFO L85 PathProgramCache]: Analyzing trace with hash 406875117, now seen corresponding path program 1 times [2025-02-05 21:55:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:55,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619574246] [2025-02-05 21:55:55,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:55,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-05 21:55:55,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-05 21:55:55,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:55,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-02-05 21:55:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:56,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619574246] [2025-02-05 21:55:56,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619574246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:56,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:56,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:55:56,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650447139] [2025-02-05 21:55:56,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:56,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:55:56,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:56,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:55:56,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:55:56,301 INFO L87 Difference]: Start difference. First operand 9212 states and 15476 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:56:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:01,549 INFO L93 Difference]: Finished difference Result 52422 states and 88048 transitions. [2025-02-05 21:56:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 21:56:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 596 [2025-02-05 21:56:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:01,703 INFO L225 Difference]: With dead ends: 52422 [2025-02-05 21:56:01,704 INFO L226 Difference]: Without dead ends: 43308 [2025-02-05 21:56:01,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:56:01,743 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 2698 mSDsluCounter, 3288 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:01,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 4216 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:56:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43308 states. [2025-02-05 21:56:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43308 to 43246. [2025-02-05 21:56:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43246 states, 32376 states have (on average 1.5841363973313565) internal successors, (51288), 32605 states have internal predecessors, (51288), 10616 states have call successors, (10616), 253 states have call predecessors, (10616), 253 states have return successors, (10616), 10387 states have call predecessors, (10616), 10616 states have call successors, (10616) [2025-02-05 21:56:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43246 states to 43246 states and 72520 transitions. [2025-02-05 21:56:06,841 INFO L78 Accepts]: Start accepts. Automaton has 43246 states and 72520 transitions. Word has length 596 [2025-02-05 21:56:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:06,843 INFO L471 AbstractCegarLoop]: Abstraction has 43246 states and 72520 transitions. [2025-02-05 21:56:06,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:56:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 43246 states and 72520 transitions. [2025-02-05 21:56:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-02-05 21:56:06,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:06,869 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:06,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:56:06,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:06,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:06,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1849902650, now seen corresponding path program 1 times [2025-02-05 21:56:06,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:06,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13712582] [2025-02-05 21:56:06,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:06,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:06,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-05 21:56:06,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-05 21:56:06,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:06,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-02-05 21:56:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13712582] [2025-02-05 21:56:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13712582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:07,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:07,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:56:07,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850269397] [2025-02-05 21:56:07,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:07,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:56:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:07,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:56:07,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:07,434 INFO L87 Difference]: Start difference. First operand 43246 states and 72520 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:56:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:15,191 INFO L93 Difference]: Finished difference Result 120446 states and 201994 transitions. [2025-02-05 21:56:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:56:15,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 597 [2025-02-05 21:56:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:15,486 INFO L225 Difference]: With dead ends: 120446 [2025-02-05 21:56:15,486 INFO L226 Difference]: Without dead ends: 77298 [2025-02-05 21:56:15,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:56:15,581 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1331 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:15,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 2623 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:56:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77298 states. [2025-02-05 21:56:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77298 to 40288. [2025-02-05 21:56:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40288 states, 30190 states have (on average 1.583504471679364) internal successors, (47806), 30404 states have internal predecessors, (47806), 9860 states have call successors, (9860), 237 states have call predecessors, (9860), 237 states have return successors, (9860), 9646 states have call predecessors, (9860), 9860 states have call successors, (9860) [2025-02-05 21:56:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40288 states to 40288 states and 67526 transitions. [2025-02-05 21:56:20,902 INFO L78 Accepts]: Start accepts. Automaton has 40288 states and 67526 transitions. Word has length 597 [2025-02-05 21:56:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:20,903 INFO L471 AbstractCegarLoop]: Abstraction has 40288 states and 67526 transitions. [2025-02-05 21:56:20,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-02-05 21:56:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 40288 states and 67526 transitions. [2025-02-05 21:56:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-02-05 21:56:20,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:20,923 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:20,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:56:20,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:20,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash -908861274, now seen corresponding path program 1 times [2025-02-05 21:56:20,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:20,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928538406] [2025-02-05 21:56:20,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:20,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:20,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-05 21:56:21,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-05 21:56:21,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:21,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-02-05 21:56:24,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:24,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928538406] [2025-02-05 21:56:24,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928538406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:24,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:24,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:56:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193100050] [2025-02-05 21:56:24,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:24,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:56:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:24,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:56:24,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:56:24,356 INFO L87 Difference]: Start difference. First operand 40288 states and 67526 transitions. Second operand has 16 states, 16 states have (on average 9.4375) internal successors, (151), 16 states have internal predecessors, (151), 3 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 3 states have call predecessors, (90), 3 states have call successors, (90) [2025-02-05 21:56:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:51,239 INFO L93 Difference]: Finished difference Result 234394 states and 393762 transitions. [2025-02-05 21:56:51,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 21:56:51,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.4375) internal successors, (151), 16 states have internal predecessors, (151), 3 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 3 states have call predecessors, (90), 3 states have call successors, (90) Word has length 598 [2025-02-05 21:56:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:52,147 INFO L225 Difference]: With dead ends: 234394 [2025-02-05 21:56:52,148 INFO L226 Difference]: Without dead ends: 200352 [2025-02-05 21:56:52,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=333, Invalid=789, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 21:56:52,247 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 6623 mSDsluCounter, 5371 mSDsCounter, 0 mSdLazyCounter, 4555 mSolverCounterSat, 2025 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6623 SdHoareTripleChecker+Valid, 6294 SdHoareTripleChecker+Invalid, 6580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2025 IncrementalHoareTripleChecker+Valid, 4555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:52,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6623 Valid, 6294 Invalid, 6580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2025 Valid, 4555 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-02-05 21:56:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200352 states. [2025-02-05 21:57:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200352 to 61588. [2025-02-05 21:57:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61588 states, 46940 states have (on average 1.586259054111632) internal successors, (74459), 47246 states have internal predecessors, (74459), 13988 states have call successors, (13988), 659 states have call predecessors, (13988), 659 states have return successors, (13988), 13682 states have call predecessors, (13988), 13988 states have call successors, (13988) [2025-02-05 21:57:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61588 states to 61588 states and 102435 transitions. [2025-02-05 21:57:02,093 INFO L78 Accepts]: Start accepts. Automaton has 61588 states and 102435 transitions. Word has length 598 [2025-02-05 21:57:02,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:02,094 INFO L471 AbstractCegarLoop]: Abstraction has 61588 states and 102435 transitions. [2025-02-05 21:57:02,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.4375) internal successors, (151), 16 states have internal predecessors, (151), 3 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 3 states have call predecessors, (90), 3 states have call successors, (90) [2025-02-05 21:57:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 61588 states and 102435 transitions. [2025-02-05 21:57:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-02-05 21:57:02,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:02,114 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:02,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:57:02,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:02,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash 224329319, now seen corresponding path program 1 times [2025-02-05 21:57:02,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:02,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868696129] [2025-02-05 21:57:02,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:02,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:02,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-02-05 21:57:02,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-02-05 21:57:02,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:02,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat