./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2ac2ade0b5a8b4fe781342f1619d7dd5e5c5b8a1b1139b842ae9332f648993d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:18:50,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:18:51,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:18:51,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:18:51,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:18:51,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:18:51,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:18:51,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:18:51,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:18:51,095 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:18:51,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:18:51,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:18:51,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:18:51,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:18:51,096 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:18:51,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:18:51,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:18:51,098 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:18:51,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:18:51,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:18:51,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:18:51,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:18:51,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:18:51,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:18:51,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:18:51,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:18:51,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:18:51,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:18:51,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:18:51,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:18:51,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:18:51,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:18:51,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:18:51,099 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2ac2ade0b5a8b4fe781342f1619d7dd5e5c5b8a1b1139b842ae9332f648993d [2025-03-08 11:18:51,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:18:51,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:18:51,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:18:51,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:18:51,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:18:51,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i [2025-03-08 11:18:52,486 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0830e8b79/5b88f1f0773e48769c7f185e515c1688/FLAG810f4c802 [2025-03-08 11:18:52,815 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:18:52,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i [2025-03-08 11:18:52,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0830e8b79/5b88f1f0773e48769c7f185e515c1688/FLAG810f4c802 [2025-03-08 11:18:53,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0830e8b79/5b88f1f0773e48769c7f185e515c1688 [2025-03-08 11:18:53,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:18:53,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:18:53,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:18:53,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:18:53,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:18:53,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db3f6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53, skipping insertion in model container [2025-03-08 11:18:53,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:18:53,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i[916,929] [2025-03-08 11:18:53,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:18:53,354 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:18:53,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-37.i[916,929] [2025-03-08 11:18:53,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:18:53,450 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:18:53,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53 WrapperNode [2025-03-08 11:18:53,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:18:53,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:18:53,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:18:53,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:18:53,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,536 INFO L138 Inliner]: procedures = 26, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 872 [2025-03-08 11:18:53,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:18:53,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:18:53,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:18:53,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:18:53,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,594 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:18:53,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:18:53,666 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:18:53,666 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:18:53,666 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:18:53,667 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (1/1) ... [2025-03-08 11:18:53,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:18:53,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:18:53,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:18:53,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:18:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:18:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:18:53,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:18:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:18:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:18:53,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:18:53,853 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:18:53,855 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:18:54,972 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 11:18:54,973 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:18:55,005 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:18:55,009 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:18:55,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:18:55 BoogieIcfgContainer [2025-03-08 11:18:55,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:18:55,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:18:55,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:18:55,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:18:55,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:18:53" (1/3) ... [2025-03-08 11:18:55,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0aee3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:18:55, skipping insertion in model container [2025-03-08 11:18:55,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:18:53" (2/3) ... [2025-03-08 11:18:55,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0aee3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:18:55, skipping insertion in model container [2025-03-08 11:18:55,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:18:55" (3/3) ... [2025-03-08 11:18:55,017 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-37.i [2025-03-08 11:18:55,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:18:55,030 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-37.i that has 2 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:18:55,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:18:55,095 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;@28bc4dea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:18:55,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:18:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 234 states have (on average 1.564102564102564) internal successors, (366), 235 states have internal predecessors, (366), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-08 11:18:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:18:55,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:55,136 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:55,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:55,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1484958113, now seen corresponding path program 1 times [2025-03-08 11:18:55,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:55,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234192829] [2025-03-08 11:18:55,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:55,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:18:55,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:18:55,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:55,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-03-08 11:18:55,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234192829] [2025-03-08 11:18:55,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234192829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:18:55,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903289688] [2025-03-08 11:18:55,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:55,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:18:55,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:18:55,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:18:55,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:18:55,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:18:56,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:18:56,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:56,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:56,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 1789 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:18:56,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:18:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 30752 trivial. 0 not checked. [2025-03-08 11:18:56,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:18:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903289688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:56,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:18:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:18:56,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938664119] [2025-03-08 11:18:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:56,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:18:56,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:56,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:18:56,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:18:56,280 INFO L87 Difference]: Start difference. First operand has 362 states, 234 states have (on average 1.564102564102564) internal successors, (366), 235 states have internal predecessors, (366), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-08 11:18:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:56,368 INFO L93 Difference]: Finished difference Result 718 states and 1352 transitions. [2025-03-08 11:18:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:18:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) Word has length 790 [2025-03-08 11:18:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:56,380 INFO L225 Difference]: With dead ends: 718 [2025-03-08 11:18:56,380 INFO L226 Difference]: Without dead ends: 359 [2025-03-08 11:18:56,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 791 GetRequests, 791 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-03-08 11:18:56,386 INFO L435 NwaCegarLoop]: 595 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, 595 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-03-08 11:18:56,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-08 11:18:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-08 11:18:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 232 states have (on average 1.5387931034482758) internal successors, (357), 232 states have internal predecessors, (357), 125 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-08 11:18:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 607 transitions. [2025-03-08 11:18:56,494 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 607 transitions. Word has length 790 [2025-03-08 11:18:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:56,495 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 607 transitions. [2025-03-08 11:18:56,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-08 11:18:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 607 transitions. [2025-03-08 11:18:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:18:56,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:56,513 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:56,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:18:56,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:18:56,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:56,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1097921479, now seen corresponding path program 1 times [2025-03-08 11:18:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:56,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257284478] [2025-03-08 11:18:56,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:56,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:56,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:18:56,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:18:56,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:56,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:18:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257284478] [2025-03-08 11:18:57,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257284478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:57,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:57,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421043342] [2025-03-08 11:18:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:57,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:57,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:57,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:57,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:57,353 INFO L87 Difference]: Start difference. First operand 359 states and 607 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:57,453 INFO L93 Difference]: Finished difference Result 911 states and 1547 transitions. [2025-03-08 11:18:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-08 11:18:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:57,463 INFO L225 Difference]: With dead ends: 911 [2025-03-08 11:18:57,463 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 11:18:57,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:57,465 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 330 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:57,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1376 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 11:18:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2025-03-08 11:18:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 384 states have (on average 1.5859375) internal successors, (609), 385 states have internal predecessors, (609), 165 states have call successors, (165), 2 states have call predecessors, (165), 2 states have return successors, (165), 164 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-08 11:18:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 939 transitions. [2025-03-08 11:18:57,546 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 939 transitions. Word has length 790 [2025-03-08 11:18:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:57,547 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 939 transitions. [2025-03-08 11:18:57,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 939 transitions. [2025-03-08 11:18:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:18:57,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:57,559 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:57,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:18:57,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:57,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash 526670246, now seen corresponding path program 1 times [2025-03-08 11:18:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:57,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825219166] [2025-03-08 11:18:57,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:57,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:18:57,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:18:57,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:57,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:18:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:57,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825219166] [2025-03-08 11:18:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825219166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:57,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:57,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339578576] [2025-03-08 11:18:57,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:57,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:57,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:57,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:57,971 INFO L87 Difference]: Start difference. First operand 552 states and 939 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:58,079 INFO L93 Difference]: Finished difference Result 1420 states and 2414 transitions. [2025-03-08 11:18:58,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:58,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-08 11:18:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:58,090 INFO L225 Difference]: With dead ends: 1420 [2025-03-08 11:18:58,090 INFO L226 Difference]: Without dead ends: 871 [2025-03-08 11:18:58,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:58,093 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 268 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:58,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1285 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:18:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-03-08 11:18:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 868. [2025-03-08 11:18:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 614 states have (on average 1.5830618892508144) internal successors, (972), 617 states have internal predecessors, (972), 249 states have call successors, (249), 4 states have call predecessors, (249), 4 states have return successors, (249), 246 states have call predecessors, (249), 249 states have call successors, (249) [2025-03-08 11:18:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1470 transitions. [2025-03-08 11:18:58,178 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1470 transitions. Word has length 790 [2025-03-08 11:18:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:58,181 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1470 transitions. [2025-03-08 11:18:58,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1470 transitions. [2025-03-08 11:18:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:18:58,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:58,189 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:58,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:18:58,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:58,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1842763739, now seen corresponding path program 1 times [2025-03-08 11:18:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003180055] [2025-03-08 11:18:58,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:58,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:18:58,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:18:58,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:58,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:18:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:58,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003180055] [2025-03-08 11:18:58,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003180055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:58,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:58,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:58,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131353889] [2025-03-08 11:18:58,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:58,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:58,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:58,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:58,525 INFO L87 Difference]: Start difference. First operand 868 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:58,611 INFO L93 Difference]: Finished difference Result 1745 states and 2946 transitions. [2025-03-08 11:18:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:58,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-08 11:18:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:58,620 INFO L225 Difference]: With dead ends: 1745 [2025-03-08 11:18:58,620 INFO L226 Difference]: Without dead ends: 880 [2025-03-08 11:18:58,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:58,625 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 301 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:58,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1186 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-08 11:18:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 618. [2025-03-08 11:18:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 444 states have (on average 1.5833333333333333) internal successors, (703), 445 states have internal predecessors, (703), 169 states have call successors, (169), 4 states have call predecessors, (169), 4 states have return successors, (169), 168 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-08 11:18:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1041 transitions. [2025-03-08 11:18:58,678 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1041 transitions. Word has length 790 [2025-03-08 11:18:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:58,680 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 1041 transitions. [2025-03-08 11:18:58,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1041 transitions. [2025-03-08 11:18:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:18:58,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:58,705 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:58,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:18:58,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:58,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:58,706 INFO L85 PathProgramCache]: Analyzing trace with hash 751463078, now seen corresponding path program 1 times [2025-03-08 11:18:58,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:58,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677673476] [2025-03-08 11:18:58,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:58,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:58,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:18:58,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:18:58,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:58,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:18:59,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:59,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677673476] [2025-03-08 11:18:59,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677673476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:59,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018078253] [2025-03-08 11:18:59,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:59,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:59,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:59,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:59,006 INFO L87 Difference]: Start difference. First operand 618 states and 1041 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:59,098 INFO L93 Difference]: Finished difference Result 1690 states and 2861 transitions. [2025-03-08 11:18:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:59,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-08 11:18:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:59,107 INFO L225 Difference]: With dead ends: 1690 [2025-03-08 11:18:59,108 INFO L226 Difference]: Without dead ends: 1075 [2025-03-08 11:18:59,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:59,110 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 308 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:59,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1278 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-03-08 11:18:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1071. [2025-03-08 11:18:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 819 states have (on average 1.6166056166056166) internal successors, (1324), 822 states have internal predecessors, (1324), 245 states have call successors, (245), 6 states have call predecessors, (245), 6 states have return successors, (245), 242 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-08 11:18:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1814 transitions. [2025-03-08 11:18:59,167 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1814 transitions. Word has length 790 [2025-03-08 11:18:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:59,170 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1814 transitions. [2025-03-08 11:18:59,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1814 transitions. [2025-03-08 11:18:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:18:59,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:59,177 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:59,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:18:59,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:59,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1947939800, now seen corresponding path program 1 times [2025-03-08 11:18:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:59,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582054650] [2025-03-08 11:18:59,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:59,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:18:59,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:18:59,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:59,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:18:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:18:59,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:18:59,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582054650] [2025-03-08 11:18:59,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582054650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:18:59,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:18:59,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:18:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043122809] [2025-03-08 11:18:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:18:59,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:18:59,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:18:59,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:18:59,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:59,462 INFO L87 Difference]: Start difference. First operand 1071 states and 1814 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:18:59,581 INFO L93 Difference]: Finished difference Result 3017 states and 5112 transitions. [2025-03-08 11:18:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:18:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-08 11:18:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:18:59,592 INFO L225 Difference]: With dead ends: 3017 [2025-03-08 11:18:59,593 INFO L226 Difference]: Without dead ends: 1949 [2025-03-08 11:18:59,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:18:59,597 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 280 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:18:59,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1280 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:18:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-03-08 11:18:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1945. [2025-03-08 11:18:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1527 states have (on average 1.618860510805501) internal successors, (2472), 1534 states have internal predecessors, (2472), 405 states have call successors, (405), 12 states have call predecessors, (405), 12 states have return successors, (405), 398 states have call predecessors, (405), 405 states have call successors, (405) [2025-03-08 11:18:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3282 transitions. [2025-03-08 11:18:59,722 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3282 transitions. Word has length 790 [2025-03-08 11:18:59,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:18:59,725 INFO L471 AbstractCegarLoop]: Abstraction has 1945 states and 3282 transitions. [2025-03-08 11:18:59,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:18:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3282 transitions. [2025-03-08 11:18:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:18:59,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:18:59,736 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:18:59,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:18:59,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:18:59,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:18:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1835244889, now seen corresponding path program 1 times [2025-03-08 11:18:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:18:59,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332133338] [2025-03-08 11:18:59,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:18:59,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:18:59,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:18:59,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:18:59,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:18:59,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:19:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:00,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332133338] [2025-03-08 11:19:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332133338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:00,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:19:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866208953] [2025-03-08 11:19:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:00,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:19:00,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:00,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:19:00,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:19:00,039 INFO L87 Difference]: Start difference. First operand 1945 states and 3282 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:00,214 INFO L93 Difference]: Finished difference Result 4835 states and 8082 transitions. [2025-03-08 11:19:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:19:00,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-08 11:19:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:00,236 INFO L225 Difference]: With dead ends: 4835 [2025-03-08 11:19:00,236 INFO L226 Difference]: Without dead ends: 2893 [2025-03-08 11:19:00,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:19:00,244 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 183 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:00,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1295 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:19:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2025-03-08 11:19:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2890. [2025-03-08 11:19:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2134 states have (on average 1.5534208059981256) internal successors, (3315), 2149 states have internal predecessors, (3315), 731 states have call successors, (731), 24 states have call predecessors, (731), 24 states have return successors, (731), 716 states have call predecessors, (731), 731 states have call successors, (731) [2025-03-08 11:19:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 4777 transitions. [2025-03-08 11:19:00,422 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 4777 transitions. Word has length 790 [2025-03-08 11:19:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:00,453 INFO L471 AbstractCegarLoop]: Abstraction has 2890 states and 4777 transitions. [2025-03-08 11:19:00,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4777 transitions. [2025-03-08 11:19:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:19:00,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:00,461 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:00,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:19:00,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:00,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1106412710, now seen corresponding path program 1 times [2025-03-08 11:19:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:00,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794724377] [2025-03-08 11:19:00,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:00,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:19:00,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:19:00,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:00,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:19:01,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:01,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794724377] [2025-03-08 11:19:01,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794724377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:01,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:01,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:19:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294516405] [2025-03-08 11:19:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:01,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:19:01,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:01,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:19:01,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:19:01,002 INFO L87 Difference]: Start difference. First operand 2890 states and 4777 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:01,545 INFO L93 Difference]: Finished difference Result 8528 states and 14101 transitions. [2025-03-08 11:19:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:19:01,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-08 11:19:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:01,577 INFO L225 Difference]: With dead ends: 8528 [2025-03-08 11:19:01,577 INFO L226 Difference]: Without dead ends: 5641 [2025-03-08 11:19:01,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:19:01,587 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 375 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:01,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 2302 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:19:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2025-03-08 11:19:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5638. [2025-03-08 11:19:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5638 states, 4198 states have (on average 1.556693663649357) internal successors, (6535), 4229 states have internal predecessors, (6535), 1391 states have call successors, (1391), 48 states have call predecessors, (1391), 48 states have return successors, (1391), 1360 states have call predecessors, (1391), 1391 states have call successors, (1391) [2025-03-08 11:19:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 9317 transitions. [2025-03-08 11:19:01,928 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 9317 transitions. Word has length 790 [2025-03-08 11:19:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:01,959 INFO L471 AbstractCegarLoop]: Abstraction has 5638 states and 9317 transitions. [2025-03-08 11:19:01,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 9317 transitions. [2025-03-08 11:19:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:19:01,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:01,969 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:01,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:19:01,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:01,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1980636411, now seen corresponding path program 1 times [2025-03-08 11:19:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887516458] [2025-03-08 11:19:01,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:01,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:02,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:19:02,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:19:02,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:02,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:19:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887516458] [2025-03-08 11:19:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887516458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:03,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:19:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599905861] [2025-03-08 11:19:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:03,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:19:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:03,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:19:03,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:19:03,173 INFO L87 Difference]: Start difference. First operand 5638 states and 9317 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:04,031 INFO L93 Difference]: Finished difference Result 13515 states and 22236 transitions. [2025-03-08 11:19:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:19:04,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-08 11:19:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:04,087 INFO L225 Difference]: With dead ends: 13515 [2025-03-08 11:19:04,087 INFO L226 Difference]: Without dead ends: 7880 [2025-03-08 11:19:04,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:19:04,105 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 1049 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:04,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 2126 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:19:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7880 states. [2025-03-08 11:19:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7880 to 6094. [2025-03-08 11:19:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6094 states, 4654 states have (on average 1.5653201547056295) internal successors, (7285), 4685 states have internal predecessors, (7285), 1391 states have call successors, (1391), 48 states have call predecessors, (1391), 48 states have return successors, (1391), 1360 states have call predecessors, (1391), 1391 states have call successors, (1391) [2025-03-08 11:19:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6094 states to 6094 states and 10067 transitions. [2025-03-08 11:19:04,565 INFO L78 Accepts]: Start accepts. Automaton has 6094 states and 10067 transitions. Word has length 790 [2025-03-08 11:19:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:04,567 INFO L471 AbstractCegarLoop]: Abstraction has 6094 states and 10067 transitions. [2025-03-08 11:19:04,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:04,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6094 states and 10067 transitions. [2025-03-08 11:19:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-08 11:19:04,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:04,581 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:04,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:19:04,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:04,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash 880812739, now seen corresponding path program 1 times [2025-03-08 11:19:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:04,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073653620] [2025-03-08 11:19:04,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:04,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 790 statements into 1 equivalence classes. [2025-03-08 11:19:04,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 790 of 790 statements. [2025-03-08 11:19:04,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:04,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:19:05,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:05,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073653620] [2025-03-08 11:19:05,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073653620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:05,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:05,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:19:05,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348419839] [2025-03-08 11:19:05,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:05,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:19:05,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:05,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:19:05,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:19:05,298 INFO L87 Difference]: Start difference. First operand 6094 states and 10067 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:06,098 INFO L93 Difference]: Finished difference Result 18276 states and 30195 transitions. [2025-03-08 11:19:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:19:06,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 790 [2025-03-08 11:19:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:06,149 INFO L225 Difference]: With dead ends: 18276 [2025-03-08 11:19:06,149 INFO L226 Difference]: Without dead ends: 12185 [2025-03-08 11:19:06,168 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-03-08 11:19:06,169 INFO L435 NwaCegarLoop]: 1133 mSDtfsCounter, 584 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:06,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1710 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:19:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12185 states. [2025-03-08 11:19:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12185 to 12181. [2025-03-08 11:19:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12181 states, 9302 states have (on average 1.5624596860890132) internal successors, (14534), 9364 states have internal predecessors, (14534), 2782 states have call successors, (2782), 96 states have call predecessors, (2782), 96 states have return successors, (2782), 2720 states have call predecessors, (2782), 2782 states have call successors, (2782) [2025-03-08 11:19:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12181 states to 12181 states and 20098 transitions. [2025-03-08 11:19:07,082 INFO L78 Accepts]: Start accepts. Automaton has 12181 states and 20098 transitions. Word has length 790 [2025-03-08 11:19:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 12181 states and 20098 transitions. [2025-03-08 11:19:07,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 12181 states and 20098 transitions. [2025-03-08 11:19:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-08 11:19:07,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:07,104 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:07,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:19:07,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:07,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -270332187, now seen corresponding path program 1 times [2025-03-08 11:19:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:07,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559540966] [2025-03-08 11:19:07,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:07,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-08 11:19:07,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-08 11:19:07,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:07,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 135 proven. 237 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-08 11:19:08,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559540966] [2025-03-08 11:19:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559540966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283593518] [2025-03-08 11:19:08,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:08,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:08,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:08,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:19:08,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:19:08,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-08 11:19:08,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-08 11:19:08,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:08,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:08,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 11:19:08,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 11464 proven. 282 refuted. 0 times theorem prover too weak. 19254 trivial. 0 not checked. [2025-03-08 11:19:10,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:19:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 90 proven. 282 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-08 11:19:11,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283593518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:19:11,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:19:11,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 11] total 23 [2025-03-08 11:19:11,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502983467] [2025-03-08 11:19:11,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:19:11,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 11:19:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:11,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 11:19:11,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-08 11:19:11,957 INFO L87 Difference]: Start difference. First operand 12181 states and 20098 transitions. Second operand has 23 states, 23 states have (on average 19.73913043478261) internal successors, (454), 23 states have internal predecessors, (454), 6 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 6 states have call predecessors, (375), 6 states have call successors, (375) [2025-03-08 11:19:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:23,481 INFO L93 Difference]: Finished difference Result 88650 states and 146017 transitions. [2025-03-08 11:19:23,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-08 11:19:23,482 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 19.73913043478261) internal successors, (454), 23 states have internal predecessors, (454), 6 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 6 states have call predecessors, (375), 6 states have call successors, (375) Word has length 791 [2025-03-08 11:19:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:23,748 INFO L225 Difference]: With dead ends: 88650 [2025-03-08 11:19:23,749 INFO L226 Difference]: Without dead ends: 76472 [2025-03-08 11:19:23,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1698 GetRequests, 1577 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5335 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2826, Invalid=12180, Unknown=0, NotChecked=0, Total=15006 [2025-03-08 11:19:23,807 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 9382 mSDsluCounter, 7121 mSDsCounter, 0 mSdLazyCounter, 7793 mSolverCounterSat, 3261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9415 SdHoareTripleChecker+Valid, 8119 SdHoareTripleChecker+Invalid, 11054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3261 IncrementalHoareTripleChecker+Valid, 7793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:23,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9415 Valid, 8119 Invalid, 11054 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3261 Valid, 7793 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-03-08 11:19:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76472 states. [2025-03-08 11:19:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76472 to 30201. [2025-03-08 11:19:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30201 states, 23370 states have (on average 1.553872486093282) internal successors, (36314), 23524 states have internal predecessors, (36314), 6418 states have call successors, (6418), 412 states have call predecessors, (6418), 412 states have return successors, (6418), 6264 states have call predecessors, (6418), 6418 states have call successors, (6418) [2025-03-08 11:19:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30201 states to 30201 states and 49150 transitions. [2025-03-08 11:19:26,719 INFO L78 Accepts]: Start accepts. Automaton has 30201 states and 49150 transitions. Word has length 791 [2025-03-08 11:19:26,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:26,722 INFO L471 AbstractCegarLoop]: Abstraction has 30201 states and 49150 transitions. [2025-03-08 11:19:26,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 19.73913043478261) internal successors, (454), 23 states have internal predecessors, (454), 6 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 6 states have call predecessors, (375), 6 states have call successors, (375) [2025-03-08 11:19:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 30201 states and 49150 transitions. [2025-03-08 11:19:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-08 11:19:26,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:26,748 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:26,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:19:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 11:19:26,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:26,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1172718251, now seen corresponding path program 1 times [2025-03-08 11:19:26,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:26,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751975261] [2025-03-08 11:19:26,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:26,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:26,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-08 11:19:27,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-08 11:19:27,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:27,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:19:27,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:27,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751975261] [2025-03-08 11:19:27,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751975261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:27,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:27,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:19:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826864652] [2025-03-08 11:19:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:27,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:19:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:27,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:19:27,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:19:27,877 INFO L87 Difference]: Start difference. First operand 30201 states and 49150 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:30,484 INFO L93 Difference]: Finished difference Result 67843 states and 110165 transitions. [2025-03-08 11:19:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:19:30,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 791 [2025-03-08 11:19:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:30,641 INFO L225 Difference]: With dead ends: 67843 [2025-03-08 11:19:30,641 INFO L226 Difference]: Without dead ends: 37165 [2025-03-08 11:19:30,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:19:30,718 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 1280 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:30,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2241 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:19:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37165 states. [2025-03-08 11:19:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37165 to 26709. [2025-03-08 11:19:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26709 states, 23002 states have (on average 1.6138596643770107) internal successors, (37122), 23076 states have internal predecessors, (37122), 3482 states have call successors, (3482), 224 states have call predecessors, (3482), 224 states have return successors, (3482), 3408 states have call predecessors, (3482), 3482 states have call successors, (3482) [2025-03-08 11:19:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26709 states to 26709 states and 44086 transitions. [2025-03-08 11:19:32,401 INFO L78 Accepts]: Start accepts. Automaton has 26709 states and 44086 transitions. Word has length 791 [2025-03-08 11:19:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:32,402 INFO L471 AbstractCegarLoop]: Abstraction has 26709 states and 44086 transitions. [2025-03-08 11:19:32,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 26709 states and 44086 transitions. [2025-03-08 11:19:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-08 11:19:32,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:32,428 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:32,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:19:32,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:32,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash 672116782, now seen corresponding path program 1 times [2025-03-08 11:19:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774980397] [2025-03-08 11:19:32,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:32,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-08 11:19:32,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-08 11:19:32,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:32,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31000 trivial. 0 not checked. [2025-03-08 11:19:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774980397] [2025-03-08 11:19:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774980397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:32,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:32,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:19:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329566381] [2025-03-08 11:19:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:32,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:19:32,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:32,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:19:32,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:19:32,943 INFO L87 Difference]: Start difference. First operand 26709 states and 44086 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:34,122 INFO L93 Difference]: Finished difference Result 73123 states and 121660 transitions. [2025-03-08 11:19:34,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:19:34,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 791 [2025-03-08 11:19:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:34,229 INFO L225 Difference]: With dead ends: 73123 [2025-03-08 11:19:34,229 INFO L226 Difference]: Without dead ends: 46417 [2025-03-08 11:19:34,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:19:34,279 INFO L435 NwaCegarLoop]: 1217 mSDtfsCounter, 797 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:34,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2436 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:19:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46417 states. [2025-03-08 11:19:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46417 to 26784. [2025-03-08 11:19:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26784 states, 23034 states have (on average 1.606060606060606) internal successors, (36994), 23109 states have internal predecessors, (36994), 3522 states have call successors, (3522), 227 states have call predecessors, (3522), 227 states have return successors, (3522), 3447 states have call predecessors, (3522), 3522 states have call successors, (3522) [2025-03-08 11:19:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26784 states to 26784 states and 44038 transitions. [2025-03-08 11:19:35,540 INFO L78 Accepts]: Start accepts. Automaton has 26784 states and 44038 transitions. Word has length 791 [2025-03-08 11:19:35,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:35,541 INFO L471 AbstractCegarLoop]: Abstraction has 26784 states and 44038 transitions. [2025-03-08 11:19:35,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (125), 1 states have call predecessors, (125), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-03-08 11:19:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 26784 states and 44038 transitions. [2025-03-08 11:19:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-08 11:19:35,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:35,563 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:35,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:19:35,563 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:35,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash -324955571, now seen corresponding path program 1 times [2025-03-08 11:19:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:35,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867394058] [2025-03-08 11:19:35,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:35,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-08 11:19:35,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-08 11:19:35,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:35,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 186 proven. 186 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-08 11:19:36,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867394058] [2025-03-08 11:19:36,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867394058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148831022] [2025-03-08 11:19:36,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:36,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:36,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:36,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:19:36,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:19:36,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-08 11:19:36,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-08 11:19:36,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:36,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:36,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1789 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 11:19:36,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 15624 proven. 186 refuted. 0 times theorem prover too weak. 15190 trivial. 0 not checked. [2025-03-08 11:19:38,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:19:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 186 proven. 186 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-08 11:19:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148831022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:19:39,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:19:39,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 7] total 19 [2025-03-08 11:19:39,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584661860] [2025-03-08 11:19:39,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:19:39,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 11:19:39,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:39,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 11:19:39,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-08 11:19:39,187 INFO L87 Difference]: Start difference. First operand 26784 states and 44038 transitions. Second operand has 19 states, 19 states have (on average 18.57894736842105) internal successors, (353), 19 states have internal predecessors, (353), 5 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 5 states have call predecessors, (375), 5 states have call successors, (375) [2025-03-08 11:19:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:47,084 INFO L93 Difference]: Finished difference Result 89712 states and 147782 transitions. [2025-03-08 11:19:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 11:19:47,085 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.57894736842105) internal successors, (353), 19 states have internal predecessors, (353), 5 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 5 states have call predecessors, (375), 5 states have call successors, (375) Word has length 791 [2025-03-08 11:19:47,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:47,426 INFO L225 Difference]: With dead ends: 89712 [2025-03-08 11:19:47,427 INFO L226 Difference]: Without dead ends: 63006 [2025-03-08 11:19:47,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1634 GetRequests, 1579 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=608, Invalid=2584, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 11:19:47,465 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 4764 mSDsluCounter, 9686 mSDsCounter, 0 mSdLazyCounter, 6964 mSolverCounterSat, 2255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5014 SdHoareTripleChecker+Valid, 10310 SdHoareTripleChecker+Invalid, 9219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2255 IncrementalHoareTripleChecker+Valid, 6964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:47,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5014 Valid, 10310 Invalid, 9219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2255 Valid, 6964 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 11:19:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63006 states. [2025-03-08 11:19:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63006 to 43526. [2025-03-08 11:19:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43526 states, 36802 states have (on average 1.5904570403782403) internal successors, (58532), 36919 states have internal predecessors, (58532), 6428 states have call successors, (6428), 295 states have call predecessors, (6428), 295 states have return successors, (6428), 6311 states have call predecessors, (6428), 6428 states have call successors, (6428) [2025-03-08 11:19:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43526 states to 43526 states and 71388 transitions. [2025-03-08 11:19:50,117 INFO L78 Accepts]: Start accepts. Automaton has 43526 states and 71388 transitions. Word has length 791 [2025-03-08 11:19:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:50,118 INFO L471 AbstractCegarLoop]: Abstraction has 43526 states and 71388 transitions. [2025-03-08 11:19:50,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.57894736842105) internal successors, (353), 19 states have internal predecessors, (353), 5 states have call successors, (375), 3 states have call predecessors, (375), 6 states have return successors, (375), 5 states have call predecessors, (375), 5 states have call successors, (375) [2025-03-08 11:19:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 43526 states and 71388 transitions. [2025-03-08 11:19:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-03-08 11:19:50,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:50,141 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:50,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 11:19:50,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:50,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash -311422770, now seen corresponding path program 1 times [2025-03-08 11:19:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:50,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536371627] [2025-03-08 11:19:50,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:50,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-08 11:19:50,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-08 11:19:50,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:50,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 186 proven. 186 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-08 11:19:50,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536371627] [2025-03-08 11:19:50,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536371627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429909309] [2025-03-08 11:19:50,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:50,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:50,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:50,959 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:19:50,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 11:19:51,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-03-08 11:19:51,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-03-08 11:19:51,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:51,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:51,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 11:19:51,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 17704 proven. 186 refuted. 0 times theorem prover too weak. 13110 trivial. 0 not checked. [2025-03-08 11:19:52,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:19:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 186 proven. 186 refuted. 0 times theorem prover too weak. 30628 trivial. 0 not checked. [2025-03-08 11:19:52,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429909309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:19:52,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:19:52,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-08 11:19:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353622058] [2025-03-08 11:19:52,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:19:52,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:19:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:52,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:19:52,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:19:52,573 INFO L87 Difference]: Start difference. First operand 43526 states and 71388 transitions. Second operand has 11 states, 11 states have (on average 25.181818181818183) internal successors, (277), 11 states have internal predecessors, (277), 6 states have call successors, (249), 3 states have call predecessors, (249), 5 states have return successors, (250), 6 states have call predecessors, (250), 6 states have call successors, (250) [2025-03-08 11:19:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:55,872 INFO L93 Difference]: Finished difference Result 87594 states and 143261 transitions. [2025-03-08 11:19:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:19:55,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.181818181818183) internal successors, (277), 11 states have internal predecessors, (277), 6 states have call successors, (249), 3 states have call predecessors, (249), 5 states have return successors, (250), 6 states have call predecessors, (250), 6 states have call successors, (250) Word has length 791 [2025-03-08 11:19:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:55,989 INFO L225 Difference]: With dead ends: 87594 [2025-03-08 11:19:55,989 INFO L226 Difference]: Without dead ends: 44146 [2025-03-08 11:19:56,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1592 GetRequests, 1577 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:19:56,046 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 652 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:56,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1129 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:19:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44146 states. [2025-03-08 11:19:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44146 to 43606. [2025-03-08 11:19:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43606 states, 36862 states have (on average 1.5790787260593566) internal successors, (58208), 36979 states have internal predecessors, (58208), 6428 states have call successors, (6428), 315 states have call predecessors, (6428), 315 states have return successors, (6428), 6311 states have call predecessors, (6428), 6428 states have call successors, (6428) [2025-03-08 11:19:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43606 states to 43606 states and 71064 transitions. [2025-03-08 11:19:58,406 INFO L78 Accepts]: Start accepts. Automaton has 43606 states and 71064 transitions. Word has length 791 [2025-03-08 11:19:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:58,407 INFO L471 AbstractCegarLoop]: Abstraction has 43606 states and 71064 transitions. [2025-03-08 11:19:58,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.181818181818183) internal successors, (277), 11 states have internal predecessors, (277), 6 states have call successors, (249), 3 states have call predecessors, (249), 5 states have return successors, (250), 6 states have call predecessors, (250), 6 states have call successors, (250) [2025-03-08 11:19:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 43606 states and 71064 transitions. [2025-03-08 11:19:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-03-08 11:19:58,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:58,429 INFO L218 NwaCegarLoop]: trace histogram [125, 125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:19:58,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 11:19:58,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 11:19:58,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:58,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1370680520, now seen corresponding path program 1 times [2025-03-08 11:19:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:58,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243423357] [2025-03-08 11:19:58,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:58,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-08 11:19:58,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-08 11:19:58,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:58,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 1593 proven. 207 refuted. 0 times theorem prover too weak. 29200 trivial. 0 not checked. [2025-03-08 11:20:00,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:20:00,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243423357] [2025-03-08 11:20:00,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243423357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:20:00,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618650639] [2025-03-08 11:20:00,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:20:00,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:20:00,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:20:00,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:20:00,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 11:20:00,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-08 11:20:00,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-08 11:20:00,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:20:00,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:20:00,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 11:20:00,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:20:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 8114 proven. 207 refuted. 0 times theorem prover too weak. 22679 trivial. 0 not checked. [2025-03-08 11:20:01,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:20:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31000 backedges. 1593 proven. 237 refuted. 0 times theorem prover too weak. 29170 trivial. 0 not checked. [2025-03-08 11:20:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618650639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:20:02,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:20:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 19] total 42 [2025-03-08 11:20:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683125096] [2025-03-08 11:20:02,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:20:02,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 11:20:02,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:20:02,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 11:20:02,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1351, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 11:20:02,850 INFO L87 Difference]: Start difference. First operand 43606 states and 71064 transitions. Second operand has 42 states, 39 states have (on average 9.820512820512821) internal successors, (383), 37 states have internal predecessors, (383), 14 states have call successors, (161), 6 states have call predecessors, (161), 13 states have return successors, (162), 14 states have call predecessors, (162), 14 states have call successors, (162)