./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.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_fillercodestructure_filler-ps-ci_file-66.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 48c0e642396cb981ec97788bf4c6fd139bd12f99e5b4ac8264222e0d2b78e970 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:41:20,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:41:20,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:41:20,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:41:20,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:41:20,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:41:20,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:41:20,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:41:20,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:41:20,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:41:20,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:41:20,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:41:20,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:41:20,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:41:20,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:41:20,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:41:20,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:41:20,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:41:20,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:41:20,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:41:20,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:41:20,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:41:20,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:41:20,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:41:20,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:41:20,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:41:20,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:41:20,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:41:20,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:41:20,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:41:20,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:41:20,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:41:20,767 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 -> 48c0e642396cb981ec97788bf4c6fd139bd12f99e5b4ac8264222e0d2b78e970 [2025-03-03 21:41:20,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:41:20,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:41:20,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:41:20,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:41:20,969 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:41:20,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.i [2025-03-03 21:41:22,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b234acc85/d1bf4a6c5a1140a499b70b99d3b216f9/FLAG6d50751bb [2025-03-03 21:41:22,291 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:41:22,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.i [2025-03-03 21:41:22,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b234acc85/d1bf4a6c5a1140a499b70b99d3b216f9/FLAG6d50751bb [2025-03-03 21:41:22,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b234acc85/d1bf4a6c5a1140a499b70b99d3b216f9 [2025-03-03 21:41:22,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:41:22,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:41:22,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:41:22,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:41:22,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:41:22,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33211a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22, skipping insertion in model container [2025-03-03 21:41:22,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:41:22,775 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_fillercodestructure_filler-ps-ci_file-66.i[919,932] [2025-03-03 21:41:22,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:41:22,850 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:41:22,859 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_fillercodestructure_filler-ps-ci_file-66.i[919,932] [2025-03-03 21:41:22,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:41:22,907 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:41:22,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22 WrapperNode [2025-03-03 21:41:22,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:41:22,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:41:22,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:41:22,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:41:22,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,938 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-03 21:41:22,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:41:22,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:41:22,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:41:22,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:41:22,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,959 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 21:41:22,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:41:22,973 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:41:22,973 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:41:22,973 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:41:22,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (1/1) ... [2025-03-03 21:41:22,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:41:22,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:41:22,998 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 21:41:23,002 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 21:41:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:41:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:41:23,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:41:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:41:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:41:23,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:41:23,078 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:41:23,080 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:41:23,334 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 21:41:23,334 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:41:23,342 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:41:23,342 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:41:23,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:41:23 BoogieIcfgContainer [2025-03-03 21:41:23,342 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:41:23,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:41:23,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:41:23,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:41:23,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:41:22" (1/3) ... [2025-03-03 21:41:23,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c77f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:41:23, skipping insertion in model container [2025-03-03 21:41:23,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:41:22" (2/3) ... [2025-03-03 21:41:23,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c77f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:41:23, skipping insertion in model container [2025-03-03 21:41:23,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:41:23" (3/3) ... [2025-03-03 21:41:23,351 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.i [2025-03-03 21:41:23,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:41:23,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-66.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:41:23,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:41:23,409 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;@7908cfe9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:41:23,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:41:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:41:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:41:23,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:23,421 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:23,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:23,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1304841960, now seen corresponding path program 1 times [2025-03-03 21:41:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:23,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658419399] [2025-03-03 21:41:23,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:23,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:23,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:41:23,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:41:23,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:23,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:41:23,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658419399] [2025-03-03 21:41:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658419399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:41:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481675812] [2025-03-03 21:41:23,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:23,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:41:23,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:41:23,657 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 21:41:23,659 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 21:41:23,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:41:23,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:41:23,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:23,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:23,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:41:23,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:41:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 21:41:23,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:41:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481675812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:23,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:41:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:41:23,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56004498] [2025-03-03 21:41:23,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:23,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:41:23,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:23,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:41:23,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:41:23,843 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:23,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:23,866 INFO L93 Difference]: Finished difference Result 156 states and 271 transitions. [2025-03-03 21:41:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:41:23,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-03-03 21:41:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:23,874 INFO L225 Difference]: With dead ends: 156 [2025-03-03 21:41:23,874 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 21:41:23,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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 21:41:23,880 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:23,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:41:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 21:41:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-03 21:41:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 21:41:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2025-03-03 21:41:23,912 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 150 [2025-03-03 21:41:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:23,913 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2025-03-03 21:41:23,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2025-03-03 21:41:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:41:23,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:23,918 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:23,924 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 21:41:24,122 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 21:41:24,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:24,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:24,124 INFO L85 PathProgramCache]: Analyzing trace with hash -582621270, now seen corresponding path program 1 times [2025-03-03 21:41:24,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:24,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019394949] [2025-03-03 21:41:24,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:24,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:24,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:41:24,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:41:24,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:24,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019394949] [2025-03-03 21:41:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019394949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:24,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:24,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:41:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367990626] [2025-03-03 21:41:24,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:24,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:41:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:24,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:41:24,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:41:24,440 INFO L87 Difference]: Start difference. First operand 78 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:24,590 INFO L93 Difference]: Finished difference Result 207 states and 325 transitions. [2025-03-03 21:41:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:41:24,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-03-03 21:41:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:24,594 INFO L225 Difference]: With dead ends: 207 [2025-03-03 21:41:24,594 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 21:41:24,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 21:41:24,595 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 207 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:24,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 214 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:41:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 21:41:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2025-03-03 21:41:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 95 states have internal predecessors, (138), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 21:41:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 202 transitions. [2025-03-03 21:41:24,618 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 202 transitions. Word has length 150 [2025-03-03 21:41:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:24,619 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 202 transitions. [2025-03-03 21:41:24,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 202 transitions. [2025-03-03 21:41:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 21:41:24,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:24,622 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:24,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:41:24,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:24,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:24,624 INFO L85 PathProgramCache]: Analyzing trace with hash -371270357, now seen corresponding path program 1 times [2025-03-03 21:41:24,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:24,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207825263] [2025-03-03 21:41:24,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:24,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:24,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 21:41:24,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 21:41:24,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:24,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207825263] [2025-03-03 21:41:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207825263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:25,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:25,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:41:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118916693] [2025-03-03 21:41:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:25,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:41:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:25,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:41:25,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:41:25,185 INFO L87 Difference]: Start difference. First operand 129 states and 202 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:25,357 INFO L93 Difference]: Finished difference Result 371 states and 593 transitions. [2025-03-03 21:41:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:41:25,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 21:41:25,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:25,360 INFO L225 Difference]: With dead ends: 371 [2025-03-03 21:41:25,362 INFO L226 Difference]: Without dead ends: 245 [2025-03-03 21:41:25,363 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 21:41:25,365 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 85 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:25,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 320 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:41:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-03 21:41:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 179. [2025-03-03 21:41:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 122 states have internal predecessors, (170), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 21:41:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2025-03-03 21:41:25,403 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 150 [2025-03-03 21:41:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:25,404 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2025-03-03 21:41:25,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2025-03-03 21:41:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:41:25,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:25,406 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:25,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:41:25,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:25,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash -696316136, now seen corresponding path program 1 times [2025-03-03 21:41:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957680659] [2025-03-03 21:41:25,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:25,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:25,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:41:25,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:41:25,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:25,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:28,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:28,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957680659] [2025-03-03 21:41:28,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957680659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:28,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:28,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:41:28,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078505360] [2025-03-03 21:41:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:28,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:41:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:28,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:41:28,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:41:28,412 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:29,317 INFO L93 Difference]: Finished difference Result 497 states and 737 transitions. [2025-03-03 21:41:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:41:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:41:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:29,321 INFO L225 Difference]: With dead ends: 497 [2025-03-03 21:41:29,322 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 21:41:29,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:41:29,324 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 370 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:29,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 683 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:41:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 21:41:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 269. [2025-03-03 21:41:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 201 states have (on average 1.427860696517413) internal successors, (287), 204 states have internal predecessors, (287), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:41:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 407 transitions. [2025-03-03 21:41:29,363 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 407 transitions. Word has length 151 [2025-03-03 21:41:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:29,364 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 407 transitions. [2025-03-03 21:41:29,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 407 transitions. [2025-03-03 21:41:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:41:29,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:29,366 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:29,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:41:29,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:29,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash -695392615, now seen corresponding path program 1 times [2025-03-03 21:41:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:29,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694717088] [2025-03-03 21:41:29,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:29,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:41:29,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:41:29,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:29,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:33,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694717088] [2025-03-03 21:41:33,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694717088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:33,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:33,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 21:41:33,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501990949] [2025-03-03 21:41:33,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:33,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:41:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:33,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:41:33,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:41:33,688 INFO L87 Difference]: Start difference. First operand 269 states and 407 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:35,674 INFO L93 Difference]: Finished difference Result 371 states and 530 transitions. [2025-03-03 21:41:35,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:41:35,675 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:41:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:35,678 INFO L225 Difference]: With dead ends: 371 [2025-03-03 21:41:35,679 INFO L226 Difference]: Without dead ends: 369 [2025-03-03 21:41:35,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2025-03-03 21:41:35,680 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 369 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:35,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 795 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 21:41:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-03 21:41:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 269. [2025-03-03 21:41:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 201 states have (on average 1.427860696517413) internal successors, (287), 204 states have internal predecessors, (287), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:41:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 407 transitions. [2025-03-03 21:41:35,707 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 407 transitions. Word has length 151 [2025-03-03 21:41:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:35,707 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 407 transitions. [2025-03-03 21:41:35,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 407 transitions. [2025-03-03 21:41:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:41:35,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:35,708 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:41:35,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:35,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1791196697, now seen corresponding path program 1 times [2025-03-03 21:41:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:35,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857431506] [2025-03-03 21:41:35,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:35,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:35,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:41:35,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:41:35,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:35,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:38,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857431506] [2025-03-03 21:41:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857431506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:38,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:38,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:41:38,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542170641] [2025-03-03 21:41:38,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:38,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:41:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:38,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:41:38,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:41:38,040 INFO L87 Difference]: Start difference. First operand 269 states and 407 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:39,295 INFO L93 Difference]: Finished difference Result 385 states and 546 transitions. [2025-03-03 21:41:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:41:39,295 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:41:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:39,297 INFO L225 Difference]: With dead ends: 385 [2025-03-03 21:41:39,297 INFO L226 Difference]: Without dead ends: 383 [2025-03-03 21:41:39,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2025-03-03 21:41:39,298 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 412 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:39,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 714 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:41:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-03 21:41:39,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 280. [2025-03-03 21:41:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 209 states have (on average 1.4210526315789473) internal successors, (297), 212 states have internal predecessors, (297), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:41:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 421 transitions. [2025-03-03 21:41:39,321 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 421 transitions. Word has length 151 [2025-03-03 21:41:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 421 transitions. [2025-03-03 21:41:39,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 421 transitions. [2025-03-03 21:41:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:41:39,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:39,323 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:39,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:41:39,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:39,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1792120218, now seen corresponding path program 1 times [2025-03-03 21:41:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:39,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139520675] [2025-03-03 21:41:39,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:39,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:39,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:41:39,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:41:39,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:39,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:43,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139520675] [2025-03-03 21:41:43,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139520675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:43,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:43,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 21:41:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844774347] [2025-03-03 21:41:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:43,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:41:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:43,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:41:43,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:41:43,091 INFO L87 Difference]: Start difference. First operand 280 states and 421 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:44,231 INFO L93 Difference]: Finished difference Result 382 states and 543 transitions. [2025-03-03 21:41:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:41:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:41:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:44,233 INFO L225 Difference]: With dead ends: 382 [2025-03-03 21:41:44,233 INFO L226 Difference]: Without dead ends: 380 [2025-03-03 21:41:44,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2025-03-03 21:41:44,234 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 351 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:44,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 753 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:41:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-03 21:41:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 276. [2025-03-03 21:41:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 205 states have (on average 1.4195121951219511) internal successors, (291), 208 states have internal predecessors, (291), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 21:41:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 415 transitions. [2025-03-03 21:41:44,252 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 415 transitions. Word has length 151 [2025-03-03 21:41:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:44,253 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 415 transitions. [2025-03-03 21:41:44,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 415 transitions. [2025-03-03 21:41:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:41:44,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:44,254 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:44,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:41:44,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:44,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash -567233417, now seen corresponding path program 1 times [2025-03-03 21:41:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630451876] [2025-03-03 21:41:44,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:41:44,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:41:44,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:44,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630451876] [2025-03-03 21:41:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630451876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:44,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:44,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:41:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268544186] [2025-03-03 21:41:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:44,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:41:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:44,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:41:44,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:41:44,288 INFO L87 Difference]: Start difference. First operand 276 states and 415 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:44,334 INFO L93 Difference]: Finished difference Result 682 states and 1037 transitions. [2025-03-03 21:41:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:41:44,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:41:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:44,338 INFO L225 Difference]: With dead ends: 682 [2025-03-03 21:41:44,338 INFO L226 Difference]: Without dead ends: 467 [2025-03-03 21:41:44,340 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 21:41:44,341 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 105 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:44,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 324 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:41:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-03 21:41:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2025-03-03 21:41:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 349 states have (on average 1.3724928366762177) internal successors, (479), 355 states have internal predecessors, (479), 102 states have call successors, (102), 13 states have call predecessors, (102), 13 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 21:41:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 683 transitions. [2025-03-03 21:41:44,381 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 683 transitions. Word has length 151 [2025-03-03 21:41:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:44,382 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 683 transitions. [2025-03-03 21:41:44,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 683 transitions. [2025-03-03 21:41:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:41:44,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:44,383 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:44,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:41:44,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:44,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1175576918, now seen corresponding path program 1 times [2025-03-03 21:41:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896846941] [2025-03-03 21:41:44,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:44,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:41:44,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:41:44,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:44,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:44,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:44,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896846941] [2025-03-03 21:41:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896846941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:41:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311465743] [2025-03-03 21:41:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:41:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:44,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:41:44,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:41:44,470 INFO L87 Difference]: Start difference. First operand 465 states and 683 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:44,638 INFO L93 Difference]: Finished difference Result 1197 states and 1746 transitions. [2025-03-03 21:41:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:41:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:41:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:44,643 INFO L225 Difference]: With dead ends: 1197 [2025-03-03 21:41:44,643 INFO L226 Difference]: Without dead ends: 793 [2025-03-03 21:41:44,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:41:44,644 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 91 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:44,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 382 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:41:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-03 21:41:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 751. [2025-03-03 21:41:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 580 states have (on average 1.3724137931034484) internal successors, (796), 591 states have internal predecessors, (796), 150 states have call successors, (150), 20 states have call predecessors, (150), 20 states have return successors, (150), 139 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-03 21:41:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1096 transitions. [2025-03-03 21:41:44,693 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1096 transitions. Word has length 151 [2025-03-03 21:41:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:44,694 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1096 transitions. [2025-03-03 21:41:44,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1096 transitions. [2025-03-03 21:41:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:41:44,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:44,698 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:44,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:41:44,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:44,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash -631877545, now seen corresponding path program 1 times [2025-03-03 21:41:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580059181] [2025-03-03 21:41:44,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:44,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:41:44,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:41:44,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:44,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:44,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580059181] [2025-03-03 21:41:44,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580059181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:44,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:44,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:41:44,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903069326] [2025-03-03 21:41:44,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:44,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:41:44,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:44,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:41:44,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:41:44,806 INFO L87 Difference]: Start difference. First operand 751 states and 1096 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:45,168 INFO L93 Difference]: Finished difference Result 1698 states and 2452 transitions. [2025-03-03 21:41:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:41:45,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2025-03-03 21:41:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:45,176 INFO L225 Difference]: With dead ends: 1698 [2025-03-03 21:41:45,176 INFO L226 Difference]: Without dead ends: 1050 [2025-03-03 21:41:45,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:41:45,180 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 289 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:45,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 468 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:41:45,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-03-03 21:41:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1026. [2025-03-03 21:41:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 798 states have (on average 1.3671679197994988) internal successors, (1091), 814 states have internal predecessors, (1091), 198 states have call successors, (198), 29 states have call predecessors, (198), 29 states have return successors, (198), 182 states have call predecessors, (198), 198 states have call successors, (198) [2025-03-03 21:41:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1487 transitions. [2025-03-03 21:41:45,246 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1487 transitions. Word has length 151 [2025-03-03 21:41:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:45,246 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1487 transitions. [2025-03-03 21:41:45,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1487 transitions. [2025-03-03 21:41:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 21:41:45,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:45,248 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:45,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:41:45,249 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:45,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash -989719143, now seen corresponding path program 1 times [2025-03-03 21:41:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:45,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997384494] [2025-03-03 21:41:45,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:45,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 21:41:45,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 21:41:45,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:45,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:45,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:45,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997384494] [2025-03-03 21:41:45,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997384494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:45,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:41:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135568811] [2025-03-03 21:41:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:45,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:41:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:45,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:41:45,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:41:45,434 INFO L87 Difference]: Start difference. First operand 1026 states and 1487 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:45,705 INFO L93 Difference]: Finished difference Result 2244 states and 3193 transitions. [2025-03-03 21:41:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:41:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 151 [2025-03-03 21:41:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:45,713 INFO L225 Difference]: With dead ends: 2244 [2025-03-03 21:41:45,714 INFO L226 Difference]: Without dead ends: 1321 [2025-03-03 21:41:45,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:41:45,718 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 222 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:45,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 267 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:41:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-03 21:41:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1028. [2025-03-03 21:41:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 800 states have (on average 1.36) internal successors, (1088), 816 states have internal predecessors, (1088), 198 states have call successors, (198), 29 states have call predecessors, (198), 29 states have return successors, (198), 182 states have call predecessors, (198), 198 states have call successors, (198) [2025-03-03 21:41:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1484 transitions. [2025-03-03 21:41:45,782 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1484 transitions. Word has length 151 [2025-03-03 21:41:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:45,782 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1484 transitions. [2025-03-03 21:41:45,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:41:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1484 transitions. [2025-03-03 21:41:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:41:45,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:45,784 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:45,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:41:45,785 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1713722922, now seen corresponding path program 1 times [2025-03-03 21:41:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426440434] [2025-03-03 21:41:45,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:45,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:41:45,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:41:45,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:45,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:45,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:45,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426440434] [2025-03-03 21:41:45,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426440434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:45,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:45,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:41:45,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36147070] [2025-03-03 21:41:45,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:45,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:41:45,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:45,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:41:45,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:41:45,920 INFO L87 Difference]: Start difference. First operand 1028 states and 1484 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:46,062 INFO L93 Difference]: Finished difference Result 2418 states and 3506 transitions. [2025-03-03 21:41:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:41:46,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 21:41:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:46,070 INFO L225 Difference]: With dead ends: 2418 [2025-03-03 21:41:46,070 INFO L226 Difference]: Without dead ends: 1764 [2025-03-03 21:41:46,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:41:46,073 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 162 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:46,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 359 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:41:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2025-03-03 21:41:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1492. [2025-03-03 21:41:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1158 states have (on average 1.3696027633851469) internal successors, (1586), 1184 states have internal predecessors, (1586), 294 states have call successors, (294), 39 states have call predecessors, (294), 39 states have return successors, (294), 268 states have call predecessors, (294), 294 states have call successors, (294) [2025-03-03 21:41:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2174 transitions. [2025-03-03 21:41:46,149 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2174 transitions. Word has length 152 [2025-03-03 21:41:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:46,149 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 2174 transitions. [2025-03-03 21:41:46,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2174 transitions. [2025-03-03 21:41:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:41:46,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:46,151 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:46,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:41:46,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:46,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1778161513, now seen corresponding path program 1 times [2025-03-03 21:41:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:46,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415027011] [2025-03-03 21:41:46,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:46,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:46,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:41:46,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:41:46,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:46,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415027011] [2025-03-03 21:41:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415027011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 21:41:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430958030] [2025-03-03 21:41:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:48,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:41:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:48,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:41:48,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:41:48,247 INFO L87 Difference]: Start difference. First operand 1492 states and 2174 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:50,486 INFO L93 Difference]: Finished difference Result 3452 states and 4929 transitions. [2025-03-03 21:41:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:41:50,486 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 152 [2025-03-03 21:41:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:50,495 INFO L225 Difference]: With dead ends: 3452 [2025-03-03 21:41:50,495 INFO L226 Difference]: Without dead ends: 2075 [2025-03-03 21:41:50,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=505, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:41:50,499 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 685 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:50,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 957 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:41:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2025-03-03 21:41:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1780. [2025-03-03 21:41:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1397 states have (on average 1.3586256263421619) internal successors, (1898), 1431 states have internal predecessors, (1898), 330 states have call successors, (330), 52 states have call predecessors, (330), 52 states have return successors, (330), 296 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-03 21:41:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2558 transitions. [2025-03-03 21:41:50,601 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2558 transitions. Word has length 152 [2025-03-03 21:41:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:50,602 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2558 transitions. [2025-03-03 21:41:50,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2558 transitions. [2025-03-03 21:41:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:41:50,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:50,604 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:50,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:41:50,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:50,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1779085034, now seen corresponding path program 1 times [2025-03-03 21:41:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:50,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389726847] [2025-03-03 21:41:50,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:50,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:41:50,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:41:50,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:50,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:53,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:53,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389726847] [2025-03-03 21:41:53,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389726847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:53,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:53,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 21:41:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906887323] [2025-03-03 21:41:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:53,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 21:41:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:53,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 21:41:53,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:41:53,090 INFO L87 Difference]: Start difference. First operand 1780 states and 2558 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:55,512 INFO L93 Difference]: Finished difference Result 2075 states and 2927 transitions. [2025-03-03 21:41:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 21:41:55,513 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 152 [2025-03-03 21:41:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:55,521 INFO L225 Difference]: With dead ends: 2075 [2025-03-03 21:41:55,521 INFO L226 Difference]: Without dead ends: 2073 [2025-03-03 21:41:55,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:41:55,522 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 608 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 981 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:41:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2025-03-03 21:41:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1780. [2025-03-03 21:41:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1397 states have (on average 1.3586256263421619) internal successors, (1898), 1431 states have internal predecessors, (1898), 330 states have call successors, (330), 52 states have call predecessors, (330), 52 states have return successors, (330), 296 states have call predecessors, (330), 330 states have call successors, (330) [2025-03-03 21:41:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2558 transitions. [2025-03-03 21:41:55,615 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2558 transitions. Word has length 152 [2025-03-03 21:41:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:55,616 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2558 transitions. [2025-03-03 21:41:55,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2558 transitions. [2025-03-03 21:41:55,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:41:55,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:55,618 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:55,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:41:55,618 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:55,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1420319915, now seen corresponding path program 1 times [2025-03-03 21:41:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992447472] [2025-03-03 21:41:55,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:55,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:41:55,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:41:55,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:55,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:55,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:55,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992447472] [2025-03-03 21:41:55,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992447472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:55,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:55,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:41:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180845640] [2025-03-03 21:41:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:55,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:41:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:55,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:41:55,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:41:55,800 INFO L87 Difference]: Start difference. First operand 1780 states and 2558 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:56,192 INFO L93 Difference]: Finished difference Result 4389 states and 6224 transitions. [2025-03-03 21:41:56,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:41:56,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 152 [2025-03-03 21:41:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:56,202 INFO L225 Difference]: With dead ends: 4389 [2025-03-03 21:41:56,202 INFO L226 Difference]: Without dead ends: 2781 [2025-03-03 21:41:56,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:41:56,206 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 314 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:56,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 447 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:41:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2025-03-03 21:41:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 1823. [2025-03-03 21:41:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1459 states have (on average 1.3721727210418095) internal successors, (2002), 1489 states have internal predecessors, (2002), 302 states have call successors, (302), 61 states have call predecessors, (302), 61 states have return successors, (302), 272 states have call predecessors, (302), 302 states have call successors, (302) [2025-03-03 21:41:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2606 transitions. [2025-03-03 21:41:56,303 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2606 transitions. Word has length 152 [2025-03-03 21:41:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:56,303 INFO L471 AbstractCegarLoop]: Abstraction has 1823 states and 2606 transitions. [2025-03-03 21:41:56,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:41:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2606 transitions. [2025-03-03 21:41:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:41:56,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:56,305 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:56,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 21:41:56,305 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:56,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash -259894776, now seen corresponding path program 1 times [2025-03-03 21:41:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:56,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230004157] [2025-03-03 21:41:56,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:56,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:56,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:41:56,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:41:56,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:56,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:41:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:41:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:41:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230004157] [2025-03-03 21:41:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230004157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:41:57,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:41:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:41:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354704990] [2025-03-03 21:41:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:41:57,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:41:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:41:57,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:41:57,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:41:57,771 INFO L87 Difference]: Start difference. First operand 1823 states and 2606 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:41:58,465 INFO L93 Difference]: Finished difference Result 2752 states and 3755 transitions. [2025-03-03 21:41:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:41:58,466 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 21:41:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:41:58,474 INFO L225 Difference]: With dead ends: 2752 [2025-03-03 21:41:58,474 INFO L226 Difference]: Without dead ends: 2750 [2025-03-03 21:41:58,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:41:58,475 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 310 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:41:58,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 635 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:41:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2025-03-03 21:41:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 1956. [2025-03-03 21:41:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1580 states have (on average 1.3683544303797468) internal successors, (2162), 1614 states have internal predecessors, (2162), 310 states have call successors, (310), 65 states have call predecessors, (310), 65 states have return successors, (310), 276 states have call predecessors, (310), 310 states have call successors, (310) [2025-03-03 21:41:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2782 transitions. [2025-03-03 21:41:58,589 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2782 transitions. Word has length 152 [2025-03-03 21:41:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:41:58,589 INFO L471 AbstractCegarLoop]: Abstraction has 1956 states and 2782 transitions. [2025-03-03 21:41:58,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:41:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2782 transitions. [2025-03-03 21:41:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:41:58,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:41:58,591 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:58,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 21:41:58,592 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:41:58,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:41:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -258971255, now seen corresponding path program 1 times [2025-03-03 21:41:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:41:58,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550802452] [2025-03-03 21:41:58,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:41:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:41:58,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:41:58,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:41:58,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:41:58,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:00,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550802452] [2025-03-03 21:42:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550802452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:00,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:00,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 21:42:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125063127] [2025-03-03 21:42:00,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:00,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:42:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:00,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:42:00,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:42:00,493 INFO L87 Difference]: Start difference. First operand 1956 states and 2782 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:02,118 INFO L93 Difference]: Finished difference Result 2481 states and 3432 transitions. [2025-03-03 21:42:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 21:42:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 21:42:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:02,126 INFO L225 Difference]: With dead ends: 2481 [2025-03-03 21:42:02,126 INFO L226 Difference]: Without dead ends: 2479 [2025-03-03 21:42:02,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:42:02,127 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 329 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:02,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 890 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:42:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2025-03-03 21:42:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 1941. [2025-03-03 21:42:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1565 states have (on average 1.3667731629392972) internal successors, (2139), 1599 states have internal predecessors, (2139), 310 states have call successors, (310), 65 states have call predecessors, (310), 65 states have return successors, (310), 276 states have call predecessors, (310), 310 states have call successors, (310) [2025-03-03 21:42:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2759 transitions. [2025-03-03 21:42:02,240 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2759 transitions. Word has length 152 [2025-03-03 21:42:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2759 transitions. [2025-03-03 21:42:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2759 transitions. [2025-03-03 21:42:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:42:02,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:02,242 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:02,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 21:42:02,242 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:02,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash -617736374, now seen corresponding path program 1 times [2025-03-03 21:42:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:02,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420504619] [2025-03-03 21:42:02,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:02,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:42:02,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:42:02,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:02,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:02,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:02,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420504619] [2025-03-03 21:42:02,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420504619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:02,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:02,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:42:02,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360718108] [2025-03-03 21:42:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:02,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:42:02,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:02,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:42:02,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:42:02,385 INFO L87 Difference]: Start difference. First operand 1941 states and 2759 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:02,723 INFO L93 Difference]: Finished difference Result 4898 states and 6851 transitions. [2025-03-03 21:42:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:42:02,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 21:42:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:02,734 INFO L225 Difference]: With dead ends: 4898 [2025-03-03 21:42:02,734 INFO L226 Difference]: Without dead ends: 3131 [2025-03-03 21:42:02,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:42:02,738 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 242 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:02,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 498 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:42:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2025-03-03 21:42:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 1832. [2025-03-03 21:42:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1456 states have (on average 1.3447802197802199) internal successors, (1958), 1490 states have internal predecessors, (1958), 310 states have call successors, (310), 65 states have call predecessors, (310), 65 states have return successors, (310), 276 states have call predecessors, (310), 310 states have call successors, (310) [2025-03-03 21:42:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2578 transitions. [2025-03-03 21:42:02,883 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 2578 transitions. Word has length 152 [2025-03-03 21:42:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:02,884 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 2578 transitions. [2025-03-03 21:42:02,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2578 transitions. [2025-03-03 21:42:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:42:02,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:02,886 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:02,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 21:42:02,886 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:02,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1646716169, now seen corresponding path program 1 times [2025-03-03 21:42:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:02,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146721744] [2025-03-03 21:42:02,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:02,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:02,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:42:02,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:42:02,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:02,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:05,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146721744] [2025-03-03 21:42:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146721744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:05,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:05,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 21:42:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383292735] [2025-03-03 21:42:05,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:05,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 21:42:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:05,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 21:42:05,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:42:05,524 INFO L87 Difference]: Start difference. First operand 1832 states and 2578 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:42:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:07,910 INFO L93 Difference]: Finished difference Result 3808 states and 5323 transitions. [2025-03-03 21:42:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 21:42:07,911 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 152 [2025-03-03 21:42:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:07,917 INFO L225 Difference]: With dead ends: 3808 [2025-03-03 21:42:07,917 INFO L226 Difference]: Without dead ends: 2154 [2025-03-03 21:42:07,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=330, Invalid=930, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 21:42:07,921 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 655 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:07,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 950 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:42:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2025-03-03 21:42:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1889. [2025-03-03 21:42:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1508 states have (on average 1.3474801061007957) internal successors, (2032), 1543 states have internal predecessors, (2032), 314 states have call successors, (314), 66 states have call predecessors, (314), 66 states have return successors, (314), 279 states have call predecessors, (314), 314 states have call successors, (314) [2025-03-03 21:42:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2660 transitions. [2025-03-03 21:42:08,047 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2660 transitions. Word has length 152 [2025-03-03 21:42:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:08,048 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2660 transitions. [2025-03-03 21:42:08,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:42:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2660 transitions. [2025-03-03 21:42:08,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:42:08,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:08,050 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:08,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 21:42:08,050 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:08,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1647639690, now seen corresponding path program 1 times [2025-03-03 21:42:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817771677] [2025-03-03 21:42:08,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:08,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:42:08,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:42:08,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:08,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817771677] [2025-03-03 21:42:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817771677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:10,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:10,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 21:42:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513725750] [2025-03-03 21:42:10,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:10,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 21:42:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:10,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 21:42:10,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:42:10,539 INFO L87 Difference]: Start difference. First operand 1889 states and 2660 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:42:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:12,769 INFO L93 Difference]: Finished difference Result 2169 states and 3020 transitions. [2025-03-03 21:42:12,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 21:42:12,770 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2025-03-03 21:42:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:12,780 INFO L225 Difference]: With dead ends: 2169 [2025-03-03 21:42:12,780 INFO L226 Difference]: Without dead ends: 2167 [2025-03-03 21:42:12,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 21:42:12,781 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 478 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:12,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 823 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 21:42:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2025-03-03 21:42:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1497. [2025-03-03 21:42:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1209 states have (on average 1.368899917287014) internal successors, (1655), 1230 states have internal predecessors, (1655), 234 states have call successors, (234), 53 states have call predecessors, (234), 53 states have return successors, (234), 213 states have call predecessors, (234), 234 states have call successors, (234) [2025-03-03 21:42:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2123 transitions. [2025-03-03 21:42:12,872 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2123 transitions. Word has length 152 [2025-03-03 21:42:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:12,872 INFO L471 AbstractCegarLoop]: Abstraction has 1497 states and 2123 transitions. [2025-03-03 21:42:12,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 21:42:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2123 transitions. [2025-03-03 21:42:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:42:12,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:12,874 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:12,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 21:42:12,874 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:12,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash -160738294, now seen corresponding path program 1 times [2025-03-03 21:42:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:12,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450206495] [2025-03-03 21:42:12,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:12,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:42:12,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:42:12,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:12,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:15,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450206495] [2025-03-03 21:42:15,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450206495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:15,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:15,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:42:15,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206300983] [2025-03-03 21:42:15,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:15,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:42:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:15,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:42:15,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:42:15,432 INFO L87 Difference]: Start difference. First operand 1497 states and 2123 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:16,332 INFO L93 Difference]: Finished difference Result 3238 states and 4535 transitions. [2025-03-03 21:42:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:42:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 21:42:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:16,339 INFO L225 Difference]: With dead ends: 3238 [2025-03-03 21:42:16,339 INFO L226 Difference]: Without dead ends: 2355 [2025-03-03 21:42:16,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2025-03-03 21:42:16,341 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 231 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:16,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 946 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:42:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2025-03-03 21:42:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1671. [2025-03-03 21:42:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1358 states have (on average 1.3637702503681886) internal successors, (1852), 1384 states have internal predecessors, (1852), 254 states have call successors, (254), 58 states have call predecessors, (254), 58 states have return successors, (254), 228 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-03 21:42:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2360 transitions. [2025-03-03 21:42:16,474 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2360 transitions. Word has length 152 [2025-03-03 21:42:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:16,475 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2360 transitions. [2025-03-03 21:42:16,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2360 transitions. [2025-03-03 21:42:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:42:16,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:16,476 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:16,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 21:42:16,476 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:16,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -159814773, now seen corresponding path program 1 times [2025-03-03 21:42:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176001396] [2025-03-03 21:42:16,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:16,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:16,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:42:16,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:42:16,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:16,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:19,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:19,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176001396] [2025-03-03 21:42:19,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176001396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:19,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:19,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 21:42:19,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767962267] [2025-03-03 21:42:19,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:19,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 21:42:19,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:19,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 21:42:19,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:42:19,663 INFO L87 Difference]: Start difference. First operand 1671 states and 2360 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:42:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:22,243 INFO L93 Difference]: Finished difference Result 2276 states and 3163 transitions. [2025-03-03 21:42:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 21:42:22,244 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 152 [2025-03-03 21:42:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:22,249 INFO L225 Difference]: With dead ends: 2276 [2025-03-03 21:42:22,249 INFO L226 Difference]: Without dead ends: 2274 [2025-03-03 21:42:22,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=316, Invalid=944, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 21:42:22,251 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 563 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:22,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1116 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:42:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2025-03-03 21:42:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1671. [2025-03-03 21:42:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1358 states have (on average 1.3637702503681886) internal successors, (1852), 1384 states have internal predecessors, (1852), 254 states have call successors, (254), 58 states have call predecessors, (254), 58 states have return successors, (254), 228 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-03 21:42:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2360 transitions. [2025-03-03 21:42:22,364 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2360 transitions. Word has length 152 [2025-03-03 21:42:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:22,364 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2360 transitions. [2025-03-03 21:42:22,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 21:42:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2360 transitions. [2025-03-03 21:42:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:42:22,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:22,365 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:22,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 21:42:22,366 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:22,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash -391340120, now seen corresponding path program 1 times [2025-03-03 21:42:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:22,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94877008] [2025-03-03 21:42:22,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:22,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:42:22,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:42:22,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:22,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:24,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:24,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94877008] [2025-03-03 21:42:24,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94877008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:24,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:24,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 21:42:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338283157] [2025-03-03 21:42:24,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:24,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:42:24,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:24,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:42:24,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:42:24,595 INFO L87 Difference]: Start difference. First operand 1671 states and 2360 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:25,847 INFO L93 Difference]: Finished difference Result 2143 states and 2966 transitions. [2025-03-03 21:42:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:42:25,847 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 21:42:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:25,852 INFO L225 Difference]: With dead ends: 2143 [2025-03-03 21:42:25,852 INFO L226 Difference]: Without dead ends: 2141 [2025-03-03 21:42:25,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:42:25,853 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 357 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:25,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 865 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:42:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2025-03-03 21:42:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1671. [2025-03-03 21:42:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1358 states have (on average 1.3637702503681886) internal successors, (1852), 1384 states have internal predecessors, (1852), 254 states have call successors, (254), 58 states have call predecessors, (254), 58 states have return successors, (254), 228 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-03 21:42:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2360 transitions. [2025-03-03 21:42:25,973 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2360 transitions. Word has length 152 [2025-03-03 21:42:25,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:25,973 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2360 transitions. [2025-03-03 21:42:25,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2360 transitions. [2025-03-03 21:42:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:42:25,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:25,974 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:25,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 21:42:25,974 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:25,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -390416599, now seen corresponding path program 1 times [2025-03-03 21:42:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:25,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716016952] [2025-03-03 21:42:25,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:25,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:42:25,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:42:25,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:25,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:42:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:42:28,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:42:28,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716016952] [2025-03-03 21:42:28,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716016952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:42:28,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:42:28,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 21:42:28,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042740119] [2025-03-03 21:42:28,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:42:28,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:42:28,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:42:28,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:42:28,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:42:28,341 INFO L87 Difference]: Start difference. First operand 1671 states and 2360 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:42:30,220 INFO L93 Difference]: Finished difference Result 2138 states and 2960 transitions. [2025-03-03 21:42:30,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 21:42:30,221 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2025-03-03 21:42:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:42:30,225 INFO L225 Difference]: With dead ends: 2138 [2025-03-03 21:42:30,225 INFO L226 Difference]: Without dead ends: 2136 [2025-03-03 21:42:30,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:42:30,226 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 344 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:42:30,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1004 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:42:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2025-03-03 21:42:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1675. [2025-03-03 21:42:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1362 states have (on average 1.3641703377386196) internal successors, (1858), 1388 states have internal predecessors, (1858), 254 states have call successors, (254), 58 states have call predecessors, (254), 58 states have return successors, (254), 228 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-03 21:42:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2366 transitions. [2025-03-03 21:42:30,343 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2366 transitions. Word has length 152 [2025-03-03 21:42:30,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:42:30,343 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2366 transitions. [2025-03-03 21:42:30,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 21:42:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2366 transitions. [2025-03-03 21:42:30,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 21:42:30,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:42:30,344 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:30,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 21:42:30,344 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:42:30,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:42:30,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2097096234, now seen corresponding path program 1 times [2025-03-03 21:42:30,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:42:30,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875981270] [2025-03-03 21:42:30,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:42:30,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:42:30,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 21:42:30,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 21:42:30,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:42:30,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat