./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-30.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 33e0a789597382a31147e3473eca939384c88c4f131feb04f2abaaba75adfc69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:07:00,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:07:00,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:07:00,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:07:00,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:07:00,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:07:00,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:07:00,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:07:00,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:07:00,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:07:00,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:07:00,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:07:00,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:07:00,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:07:00,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:07:00,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:07:00,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:07:00,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:07:00,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:07:00,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:07:00,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:07:00,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:07:00,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:07:00,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:07:00,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:07:00,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:07:00,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:07:00,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:07:00,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:07:00,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:00,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:07:00,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:07:00,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:07:00,784 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 -> 33e0a789597382a31147e3473eca939384c88c4f131feb04f2abaaba75adfc69 [2025-03-03 20:07:01,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:07:01,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:07:01,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:07:01,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:07:01,015 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:07:01,016 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-30.i [2025-03-03 20:07:02,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6b5bfb6/33d97a0678934d629332db599903eb72/FLAGf4094c6a2 [2025-03-03 20:07:02,449 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:07:02,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-30.i [2025-03-03 20:07:02,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6b5bfb6/33d97a0678934d629332db599903eb72/FLAGf4094c6a2 [2025-03-03 20:07:02,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6b5bfb6/33d97a0678934d629332db599903eb72 [2025-03-03 20:07:02,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:07:02,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:07:02,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:02,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:07:02,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:07:02,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:02,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad3be2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02, skipping insertion in model container [2025-03-03 20:07:02,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:02,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:07:02,638 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-30.i[916,929] [2025-03-03 20:07:02,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:02,804 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:07:02,811 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-30.i[916,929] [2025-03-03 20:07:02,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:02,902 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:07:02,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02 WrapperNode [2025-03-03 20:07:02,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:02,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:02,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:07:02,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:07:02,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:02,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:02,980 INFO L138 Inliner]: procedures = 26, calls = 125, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 937 [2025-03-03 20:07:02,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:02,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:07:02,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:07:02,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:07:02,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:02,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:03,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:03,037 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-03 20:07:03,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:03,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:03,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:03,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:03,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:03,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:03,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:07:03,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:07:03,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:07:03,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:07:03,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (1/1) ... [2025-03-03 20:07:03,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:03,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:03,113 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-03 20:07:03,119 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-03 20:07:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:07:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:07:03,137 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:07:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:07:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:07:03,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:07:03,271 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:07:03,273 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:07:04,036 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L738: havoc property_#t~bitwise92#1;havoc property_#t~short93#1; [2025-03-03 20:07:04,261 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 20:07:04,261 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:07:04,299 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:07:04,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:07:04,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:04 BoogieIcfgContainer [2025-03-03 20:07:04,303 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:07:04,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:07:04,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:07:04,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:07:04,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:07:02" (1/3) ... [2025-03-03 20:07:04,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a805aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:04, skipping insertion in model container [2025-03-03 20:07:04,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:02" (2/3) ... [2025-03-03 20:07:04,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a805aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:04, skipping insertion in model container [2025-03-03 20:07:04,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:04" (3/3) ... [2025-03-03 20:07:04,311 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-30.i [2025-03-03 20:07:04,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:07:04,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-30.i that has 2 procedures, 379 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:07:04,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:07:04,396 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;@6bb42b09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:07:04,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:07:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 379 states, 264 states have (on average 1.5795454545454546) internal successors, (417), 265 states have internal predecessors, (417), 112 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 20:07:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2025-03-03 20:07:04,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:04,426 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:04,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:04,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash -405759020, now seen corresponding path program 1 times [2025-03-03 20:07:04,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:04,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306450127] [2025-03-03 20:07:04,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:04,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:04,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 724 statements into 1 equivalence classes. [2025-03-03 20:07:04,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 724 of 724 statements. [2025-03-03 20:07:04,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:04,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 24642 trivial. 0 not checked. [2025-03-03 20:07:05,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:05,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306450127] [2025-03-03 20:07:05,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306450127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:07:05,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552469908] [2025-03-03 20:07:05,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:05,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:07:05,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:05,023 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-03 20:07:05,024 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-03 20:07:05,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 724 statements into 1 equivalence classes. [2025-03-03 20:07:05,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 724 of 724 statements. [2025-03-03 20:07:05,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:05,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:05,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 1657 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:07:05,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:07:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 24642 trivial. 0 not checked. [2025-03-03 20:07:05,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:07:05,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552469908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:05,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:07:05,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:07:05,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362952387] [2025-03-03 20:07:05,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:05,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:07:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:05,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:07:05,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:07:05,525 INFO L87 Difference]: Start difference. First operand has 379 states, 264 states have (on average 1.5795454545454546) internal successors, (417), 265 states have internal predecessors, (417), 112 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (112), 2 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-03 20:07:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:05,626 INFO L93 Difference]: Finished difference Result 752 states and 1389 transitions. [2025-03-03 20:07:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:07:05,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (112), 2 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 2 states have call successors, (112) Word has length 724 [2025-03-03 20:07:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:05,635 INFO L225 Difference]: With dead ends: 752 [2025-03-03 20:07:05,635 INFO L226 Difference]: Without dead ends: 376 [2025-03-03 20:07:05,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 725 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-03 20:07:05,643 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:05,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 612 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-03 20:07:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-03-03 20:07:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 262 states have (on average 1.5610687022900764) internal successors, (409), 262 states have internal predecessors, (409), 112 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 20:07:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 633 transitions. [2025-03-03 20:07:05,730 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 633 transitions. Word has length 724 [2025-03-03 20:07:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:05,731 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 633 transitions. [2025-03-03 20:07:05,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (112), 2 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-03 20:07:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 633 transitions. [2025-03-03 20:07:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2025-03-03 20:07:05,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:05,746 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:05,755 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-03 20:07:05,951 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-03 20:07:05,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:05,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash -874328232, now seen corresponding path program 1 times [2025-03-03 20:07:05,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:05,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498814332] [2025-03-03 20:07:05,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:06,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 724 statements into 1 equivalence classes. [2025-03-03 20:07:06,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 724 of 724 statements. [2025-03-03 20:07:06,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:06,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:06,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498814332] [2025-03-03 20:07:06,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498814332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:06,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:06,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:06,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63236770] [2025-03-03 20:07:06,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:06,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:06,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:06,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:06,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:06,954 INFO L87 Difference]: Start difference. First operand 376 states and 633 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:07,431 INFO L93 Difference]: Finished difference Result 1123 states and 1895 transitions. [2025-03-03 20:07:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:07,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 724 [2025-03-03 20:07:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:07,466 INFO L225 Difference]: With dead ends: 1123 [2025-03-03 20:07:07,467 INFO L226 Difference]: Without dead ends: 750 [2025-03-03 20:07:07,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:07,470 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 433 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:07,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1583 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:07:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-03 20:07:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2025-03-03 20:07:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 521 states have (on average 1.562380038387716) internal successors, (814), 521 states have internal predecessors, (814), 224 states have call successors, (224), 2 states have call predecessors, (224), 2 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-03 20:07:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1262 transitions. [2025-03-03 20:07:07,567 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1262 transitions. Word has length 724 [2025-03-03 20:07:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:07,568 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1262 transitions. [2025-03-03 20:07:07,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1262 transitions. [2025-03-03 20:07:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2025-03-03 20:07:07,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:07,578 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:07:07,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash -860795431, now seen corresponding path program 1 times [2025-03-03 20:07:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106826568] [2025-03-03 20:07:07,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:07,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 724 statements into 1 equivalence classes. [2025-03-03 20:07:07,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 724 of 724 statements. [2025-03-03 20:07:07,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:07,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:07,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106826568] [2025-03-03 20:07:07,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106826568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:07,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:07,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356714612] [2025-03-03 20:07:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:07,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:07,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:07,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:07,866 INFO L87 Difference]: Start difference. First operand 748 states and 1262 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:07,990 INFO L93 Difference]: Finished difference Result 1989 states and 3343 transitions. [2025-03-03 20:07:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:07,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 724 [2025-03-03 20:07:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:08,003 INFO L225 Difference]: With dead ends: 1989 [2025-03-03 20:07:08,003 INFO L226 Difference]: Without dead ends: 1244 [2025-03-03 20:07:08,006 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-03 20:07:08,007 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 400 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:08,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1202 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:08,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2025-03-03 20:07:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1240. [2025-03-03 20:07:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 845 states have (on average 1.5349112426035503) internal successors, (1297), 847 states have internal predecessors, (1297), 390 states have call successors, (390), 4 states have call predecessors, (390), 4 states have return successors, (390), 388 states have call predecessors, (390), 390 states have call successors, (390) [2025-03-03 20:07:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 2077 transitions. [2025-03-03 20:07:08,142 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 2077 transitions. Word has length 724 [2025-03-03 20:07:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:08,143 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 2077 transitions. [2025-03-03 20:07:08,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 2077 transitions. [2025-03-03 20:07:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2025-03-03 20:07:08,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:08,152 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:08,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:07:08,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:08,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 701319801, now seen corresponding path program 1 times [2025-03-03 20:07:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:08,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150296073] [2025-03-03 20:07:08,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:08,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 724 statements into 1 equivalence classes. [2025-03-03 20:07:08,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 724 of 724 statements. [2025-03-03 20:07:08,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:08,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:08,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150296073] [2025-03-03 20:07:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150296073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:08,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:08,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:08,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318330286] [2025-03-03 20:07:08,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:08,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:08,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:08,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:08,456 INFO L87 Difference]: Start difference. First operand 1240 states and 2077 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:08,599 INFO L93 Difference]: Finished difference Result 3401 states and 5692 transitions. [2025-03-03 20:07:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:08,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 724 [2025-03-03 20:07:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:08,614 INFO L225 Difference]: With dead ends: 3401 [2025-03-03 20:07:08,614 INFO L226 Difference]: Without dead ends: 2164 [2025-03-03 20:07:08,618 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-03 20:07:08,619 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 370 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:08,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1393 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2025-03-03 20:07:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2158. [2025-03-03 20:07:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2158 states, 1487 states have (on average 1.535305985205111) internal successors, (2283), 1493 states have internal predecessors, (2283), 662 states have call successors, (662), 8 states have call predecessors, (662), 8 states have return successors, (662), 656 states have call predecessors, (662), 662 states have call successors, (662) [2025-03-03 20:07:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 3607 transitions. [2025-03-03 20:07:08,774 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 3607 transitions. Word has length 724 [2025-03-03 20:07:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:08,775 INFO L471 AbstractCegarLoop]: Abstraction has 2158 states and 3607 transitions. [2025-03-03 20:07:08,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 3607 transitions. [2025-03-03 20:07:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-03-03 20:07:08,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:08,780 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:08,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:07:08,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash -298244325, now seen corresponding path program 1 times [2025-03-03 20:07:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319475530] [2025-03-03 20:07:08,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:08,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-03 20:07:08,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-03 20:07:08,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:08,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:09,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:09,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319475530] [2025-03-03 20:07:09,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319475530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:09,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:09,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:09,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824719405] [2025-03-03 20:07:09,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:09,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:09,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:09,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:09,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:09,021 INFO L87 Difference]: Start difference. First operand 2158 states and 3607 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:09,178 INFO L93 Difference]: Finished difference Result 5596 states and 9377 transitions. [2025-03-03 20:07:09,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:09,179 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 725 [2025-03-03 20:07:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:09,200 INFO L225 Difference]: With dead ends: 5596 [2025-03-03 20:07:09,200 INFO L226 Difference]: Without dead ends: 3441 [2025-03-03 20:07:09,207 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-03 20:07:09,209 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 306 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1290 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3441 states. [2025-03-03 20:07:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3441 to 3431. [2025-03-03 20:07:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3431 states, 2608 states have (on average 1.5858895705521472) internal successors, (4136), 2622 states have internal predecessors, (4136), 806 states have call successors, (806), 16 states have call predecessors, (806), 16 states have return successors, (806), 792 states have call predecessors, (806), 806 states have call successors, (806) [2025-03-03 20:07:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5748 transitions. [2025-03-03 20:07:09,447 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5748 transitions. Word has length 725 [2025-03-03 20:07:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:09,448 INFO L471 AbstractCegarLoop]: Abstraction has 3431 states and 5748 transitions. [2025-03-03 20:07:09,449 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5748 transitions. [2025-03-03 20:07:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-03-03 20:07:09,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:09,459 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:09,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:07:09,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:09,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:09,459 INFO L85 PathProgramCache]: Analyzing trace with hash -552980870, now seen corresponding path program 1 times [2025-03-03 20:07:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320226733] [2025-03-03 20:07:09,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:09,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-03 20:07:09,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-03 20:07:09,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:09,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320226733] [2025-03-03 20:07:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320226733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:09,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:09,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102020289] [2025-03-03 20:07:09,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:09,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:09,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:09,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:09,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:09,704 INFO L87 Difference]: Start difference. First operand 3431 states and 5748 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:09,956 INFO L93 Difference]: Finished difference Result 10287 states and 17238 transitions. [2025-03-03 20:07:09,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:09,957 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 725 [2025-03-03 20:07:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:09,991 INFO L225 Difference]: With dead ends: 10287 [2025-03-03 20:07:09,991 INFO L226 Difference]: Without dead ends: 6859 [2025-03-03 20:07:10,002 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-03 20:07:10,002 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 615 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:10,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1224 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6859 states. [2025-03-03 20:07:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6859 to 6857. [2025-03-03 20:07:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6857 states, 5212 states have (on average 1.5771297006907137) internal successors, (8220), 5240 states have internal predecessors, (8220), 1612 states have call successors, (1612), 32 states have call predecessors, (1612), 32 states have return successors, (1612), 1584 states have call predecessors, (1612), 1612 states have call successors, (1612) [2025-03-03 20:07:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 11444 transitions. [2025-03-03 20:07:10,370 INFO L78 Accepts]: Start accepts. Automaton has 6857 states and 11444 transitions. Word has length 725 [2025-03-03 20:07:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 6857 states and 11444 transitions. [2025-03-03 20:07:10,372 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6857 states and 11444 transitions. [2025-03-03 20:07:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-03-03 20:07:10,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:10,381 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:10,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:07:10,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:10,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:10,381 INFO L85 PathProgramCache]: Analyzing trace with hash 444091483, now seen corresponding path program 1 times [2025-03-03 20:07:10,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:10,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042920184] [2025-03-03 20:07:10,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:10,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-03 20:07:10,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-03 20:07:10,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:10,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:10,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:10,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042920184] [2025-03-03 20:07:10,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042920184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:10,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:10,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:10,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483418210] [2025-03-03 20:07:10,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:10,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:10,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:10,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:10,797 INFO L87 Difference]: Start difference. First operand 6857 states and 11444 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:11,567 INFO L93 Difference]: Finished difference Result 17157 states and 28632 transitions. [2025-03-03 20:07:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:11,568 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 725 [2025-03-03 20:07:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:11,636 INFO L225 Difference]: With dead ends: 17157 [2025-03-03 20:07:11,636 INFO L226 Difference]: Without dead ends: 10303 [2025-03-03 20:07:11,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 20:07:11,662 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 388 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:11,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1574 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:07:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2025-03-03 20:07:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 10301. [2025-03-03 20:07:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10301 states, 7834 states have (on average 1.5749297932090887) internal successors, (12338), 7876 states have internal predecessors, (12338), 2418 states have call successors, (2418), 48 states have call predecessors, (2418), 48 states have return successors, (2418), 2376 states have call predecessors, (2418), 2418 states have call successors, (2418) [2025-03-03 20:07:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 17174 transitions. [2025-03-03 20:07:12,244 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 17174 transitions. Word has length 725 [2025-03-03 20:07:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:12,245 INFO L471 AbstractCegarLoop]: Abstraction has 10301 states and 17174 transitions. [2025-03-03 20:07:12,248 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 17174 transitions. [2025-03-03 20:07:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-03-03 20:07:12,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:12,260 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:12,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:07:12,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1739585444, now seen corresponding path program 1 times [2025-03-03 20:07:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18456299] [2025-03-03 20:07:12,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:12,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-03 20:07:12,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-03 20:07:12,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:12,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18456299] [2025-03-03 20:07:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18456299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952957450] [2025-03-03 20:07:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:12,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:12,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:12,630 INFO L87 Difference]: Start difference. First operand 10301 states and 17174 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:12,925 INFO L93 Difference]: Finished difference Result 20659 states and 34429 transitions. [2025-03-03 20:07:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:12,930 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 725 [2025-03-03 20:07:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:12,972 INFO L225 Difference]: With dead ends: 20659 [2025-03-03 20:07:12,972 INFO L226 Difference]: Without dead ends: 10361 [2025-03-03 20:07:12,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:12,997 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 4 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:12,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1220 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10361 states. [2025-03-03 20:07:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10361 to 10361. [2025-03-03 20:07:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10361 states, 7894 states have (on average 1.5720800608056753) internal successors, (12410), 7936 states have internal predecessors, (12410), 2418 states have call successors, (2418), 48 states have call predecessors, (2418), 48 states have return successors, (2418), 2376 states have call predecessors, (2418), 2418 states have call successors, (2418) [2025-03-03 20:07:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10361 states to 10361 states and 17246 transitions. [2025-03-03 20:07:13,621 INFO L78 Accepts]: Start accepts. Automaton has 10361 states and 17246 transitions. Word has length 725 [2025-03-03 20:07:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:13,622 INFO L471 AbstractCegarLoop]: Abstraction has 10361 states and 17246 transitions. [2025-03-03 20:07:13,623 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 10361 states and 17246 transitions. [2025-03-03 20:07:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-03-03 20:07:13,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:13,637 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:13,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:07:13,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:13,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1295974021, now seen corresponding path program 1 times [2025-03-03 20:07:13,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:13,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470152444] [2025-03-03 20:07:13,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:13,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:13,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-03-03 20:07:13,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-03-03 20:07:13,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:13,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:14,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:14,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470152444] [2025-03-03 20:07:14,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470152444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:14,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:14,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187039163] [2025-03-03 20:07:14,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:14,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:14,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:14,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:14,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:14,209 INFO L87 Difference]: Start difference. First operand 10361 states and 17246 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:15,090 INFO L93 Difference]: Finished difference Result 32279 states and 53701 transitions. [2025-03-03 20:07:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:15,091 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 725 [2025-03-03 20:07:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:15,169 INFO L225 Difference]: With dead ends: 32279 [2025-03-03 20:07:15,169 INFO L226 Difference]: Without dead ends: 21921 [2025-03-03 20:07:15,205 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-03 20:07:15,208 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 663 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:15,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1848 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:07:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21921 states. [2025-03-03 20:07:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21921 to 20717. [2025-03-03 20:07:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20717 states, 15784 states have (on average 1.5631018753167765) internal successors, (24672), 15868 states have internal predecessors, (24672), 4836 states have call successors, (4836), 96 states have call predecessors, (4836), 96 states have return successors, (4836), 4752 states have call predecessors, (4836), 4836 states have call successors, (4836) [2025-03-03 20:07:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20717 states to 20717 states and 34344 transitions. [2025-03-03 20:07:16,569 INFO L78 Accepts]: Start accepts. Automaton has 20717 states and 34344 transitions. Word has length 725 [2025-03-03 20:07:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:16,570 INFO L471 AbstractCegarLoop]: Abstraction has 20717 states and 34344 transitions. [2025-03-03 20:07:16,570 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 20717 states and 34344 transitions. [2025-03-03 20:07:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2025-03-03 20:07:16,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:16,581 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:16,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:07:16,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:16,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash -228306495, now seen corresponding path program 1 times [2025-03-03 20:07:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:16,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200119614] [2025-03-03 20:07:16,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:16,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-03-03 20:07:16,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-03-03 20:07:16,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:16,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:17,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200119614] [2025-03-03 20:07:17,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200119614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:17,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:17,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:17,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792030576] [2025-03-03 20:07:17,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:17,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:17,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:17,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:17,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:17,074 INFO L87 Difference]: Start difference. First operand 20717 states and 34344 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:19,188 INFO L93 Difference]: Finished difference Result 92405 states and 153268 transitions. [2025-03-03 20:07:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:19,189 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 726 [2025-03-03 20:07:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:19,442 INFO L225 Difference]: With dead ends: 92405 [2025-03-03 20:07:19,442 INFO L226 Difference]: Without dead ends: 71691 [2025-03-03 20:07:19,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:19,522 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1167 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:19,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 2434 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:07:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71691 states. [2025-03-03 20:07:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71691 to 71589. [2025-03-03 20:07:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71589 states, 57692 states have (on average 1.5879498023989462) internal successors, (91612), 58052 states have internal predecessors, (91612), 13512 states have call successors, (13512), 384 states have call predecessors, (13512), 384 states have return successors, (13512), 13152 states have call predecessors, (13512), 13512 states have call successors, (13512) [2025-03-03 20:07:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71589 states to 71589 states and 118636 transitions. [2025-03-03 20:07:22,476 INFO L78 Accepts]: Start accepts. Automaton has 71589 states and 118636 transitions. Word has length 726 [2025-03-03 20:07:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:22,477 INFO L471 AbstractCegarLoop]: Abstraction has 71589 states and 118636 transitions. [2025-03-03 20:07:22,477 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, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 71589 states and 118636 transitions. [2025-03-03 20:07:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-03-03 20:07:22,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:22,516 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:22,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:07:22,517 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:22,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1358164721, now seen corresponding path program 1 times [2025-03-03 20:07:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:22,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860263026] [2025-03-03 20:07:22,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:22,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:22,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-03-03 20:07:22,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-03-03 20:07:22,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:22,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:23,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:23,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860263026] [2025-03-03 20:07:23,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860263026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:23,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:07:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51567911] [2025-03-03 20:07:23,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:23,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:07:23,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:23,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:07:23,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:07:23,756 INFO L87 Difference]: Start difference. First operand 71589 states and 118636 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:29,754 INFO L93 Difference]: Finished difference Result 150031 states and 249129 transitions. [2025-03-03 20:07:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:07:29,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 727 [2025-03-03 20:07:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:30,155 INFO L225 Difference]: With dead ends: 150031 [2025-03-03 20:07:30,156 INFO L226 Difference]: Without dead ends: 138125 [2025-03-03 20:07:30,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:07:30,233 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 2014 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2014 SdHoareTripleChecker+Valid, 4225 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:30,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2014 Valid, 4225 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 20:07:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138125 states. [2025-03-03 20:07:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138125 to 114837. [2025-03-03 20:07:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114837 states, 93992 states have (on average 1.6045620903906714) internal successors, (150816), 94532 states have internal predecessors, (150816), 20268 states have call successors, (20268), 576 states have call predecessors, (20268), 576 states have return successors, (20268), 19728 states have call predecessors, (20268), 20268 states have call successors, (20268) [2025-03-03 20:07:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114837 states to 114837 states and 191352 transitions. [2025-03-03 20:07:36,591 INFO L78 Accepts]: Start accepts. Automaton has 114837 states and 191352 transitions. Word has length 727 [2025-03-03 20:07:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:36,592 INFO L471 AbstractCegarLoop]: Abstraction has 114837 states and 191352 transitions. [2025-03-03 20:07:36,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-03-03 20:07:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 114837 states and 191352 transitions. [2025-03-03 20:07:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-03-03 20:07:36,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:36,630 INFO L218 NwaCegarLoop]: trace histogram [112, 112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:36,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:07:36,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:36,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:36,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1911310576, now seen corresponding path program 1 times [2025-03-03 20:07:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:36,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46003465] [2025-03-03 20:07:36,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:36,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:36,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-03-03 20:07:36,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-03-03 20:07:36,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:36,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24864 trivial. 0 not checked. [2025-03-03 20:07:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:38,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46003465] [2025-03-03 20:07:38,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46003465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:38,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:38,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:07:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664604822] [2025-03-03 20:07:38,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:38,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:07:38,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:38,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:07:38,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:07:38,376 INFO L87 Difference]: Start difference. First operand 114837 states and 191352 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-03 20:07:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:56,399 INFO L93 Difference]: Finished difference Result 649819 states and 1084289 transitions. [2025-03-03 20:07:56,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:07:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 2 states have call successors, (112), 1 states have call predecessors, (112), 1 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) Word has length 727 [2025-03-03 20:07:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:58,346 INFO L225 Difference]: With dead ends: 649819 [2025-03-03 20:07:58,346 INFO L226 Difference]: Without dead ends: 534985 [2025-03-03 20:07:58,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:07:58,678 INFO L435 NwaCegarLoop]: 1116 mSDtfsCounter, 2508 mSDsluCounter, 2615 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 3731 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:58,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2508 Valid, 3731 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 20:07:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534985 states.