./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_loopvsstraightlinecode_100-1loop_file-63.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 032103455c965390b2cd90e1021eb4797074287a2ad4fda3336b307fb716d96d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:07:36,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:07:36,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:07:36,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:07:36,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:07:36,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:07:36,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:07:36,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:07:36,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:07:36,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:07:36,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:07:36,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:07:36,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:07:36,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:07:36,241 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:07:36,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:07:36,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:07:36,242 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:07:36,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:07:36,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:07:36,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:07:36,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:07:36,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:07:36,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:07:36,243 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:07:36,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:07:36,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:07:36,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:07:36,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:07:36,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:07:36,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:07:36,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:07:36,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:07:36,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:07:36,244 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 -> 032103455c965390b2cd90e1021eb4797074287a2ad4fda3336b307fb716d96d [2025-03-17 03:07:36,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:07:36,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:07:36,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:07:36,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:07:36,494 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:07:36,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i [2025-03-17 03:07:37,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4019a02/32269d754673473388a95fa009e886af/FLAGd900101d4 [2025-03-17 03:07:37,904 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:07:37,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i [2025-03-17 03:07:37,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4019a02/32269d754673473388a95fa009e886af/FLAGd900101d4 [2025-03-17 03:07:37,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4019a02/32269d754673473388a95fa009e886af [2025-03-17 03:07:37,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:07:37,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:07:37,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:07:37,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:07:37,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:07:37,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:07:37" (1/1) ... [2025-03-17 03:07:37,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2078f7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:37, skipping insertion in model container [2025-03-17 03:07:37,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:07:37" (1/1) ... [2025-03-17 03:07:37,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:07:38,061 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_loopvsstraightlinecode_100-1loop_file-63.i[916,929] [2025-03-17 03:07:38,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:07:38,158 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:07:38,166 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_loopvsstraightlinecode_100-1loop_file-63.i[916,929] [2025-03-17 03:07:38,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:07:38,207 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:07:38,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38 WrapperNode [2025-03-17 03:07:38,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:07:38,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:07:38,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:07:38,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:07:38,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,272 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2025-03-17 03:07:38,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:07:38,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:07:38,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:07:38,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:07:38,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,309 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-17 03:07:38,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:07:38,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:07:38,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:07:38,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:07:38,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (1/1) ... [2025-03-17 03:07:38,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:07:38,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:07:38,355 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-17 03:07:38,359 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-17 03:07:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:07:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:07:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:07:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:07:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:07:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:07:38,445 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:07:38,447 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:07:38,786 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc property_#t~bitwise17#1;havoc property_#t~short18#1;havoc property_#t~short19#1; [2025-03-17 03:07:38,816 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-17 03:07:38,816 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:07:38,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:07:38,836 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:07:38,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:07:38 BoogieIcfgContainer [2025-03-17 03:07:38,836 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:07:38,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:07:38,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:07:38,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:07:38,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:07:37" (1/3) ... [2025-03-17 03:07:38,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaece14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:07:38, skipping insertion in model container [2025-03-17 03:07:38,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:07:38" (2/3) ... [2025-03-17 03:07:38,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaece14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:07:38, skipping insertion in model container [2025-03-17 03:07:38,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:07:38" (3/3) ... [2025-03-17 03:07:38,846 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-63.i [2025-03-17 03:07:38,857 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:07:38,859 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-63.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:07:38,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:07:38,913 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;@242884a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:07:38,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:07:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 03:07:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 03:07:38,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:38,928 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:38,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:38,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1416997924, now seen corresponding path program 1 times [2025-03-17 03:07:38,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001682742] [2025-03-17 03:07:38,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:38,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:39,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:07:39,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:07:39,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:39,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 03:07:39,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001682742] [2025-03-17 03:07:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001682742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:07:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498182298] [2025-03-17 03:07:39,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:39,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:07:39,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:07:39,223 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-17 03:07:39,225 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-17 03:07:39,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:07:39,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:07:39,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:39,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:39,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:07:39,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:07:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 03:07:39,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:07:39,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498182298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:39,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:07:39,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:07:39,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869665863] [2025-03-17 03:07:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:39,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:07:39,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:39,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:07:39,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:07:39,396 INFO L87 Difference]: Start difference. First operand has 84 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 03:07:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:39,418 INFO L93 Difference]: Finished difference Result 165 states and 281 transitions. [2025-03-17 03:07:39,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:07:39,419 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2025-03-17 03:07:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:39,426 INFO L225 Difference]: With dead ends: 165 [2025-03-17 03:07:39,426 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 03:07:39,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-17 03:07:39,432 INFO L435 NwaCegarLoop]: 124 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, 124 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-17 03:07:39,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:07:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 03:07:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 03:07:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 03:07:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2025-03-17 03:07:39,462 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 140 [2025-03-17 03:07:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:07:39,462 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2025-03-17 03:07:39,462 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 03:07:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2025-03-17 03:07:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 03:07:39,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:39,465 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:39,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:07:39,665 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-17 03:07:39,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:39,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash -878385018, now seen corresponding path program 1 times [2025-03-17 03:07:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:39,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904160538] [2025-03-17 03:07:39,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:39,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:07:39,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:07:39,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:39,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:07:40,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:40,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904160538] [2025-03-17 03:07:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904160538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:40,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:07:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:07:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291783129] [2025-03-17 03:07:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:40,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:07:40,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:40,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:07:40,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:07:40,252 INFO L87 Difference]: Start difference. First operand 80 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:40,399 INFO L93 Difference]: Finished difference Result 239 states and 365 transitions. [2025-03-17 03:07:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:07:40,400 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 03:07:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:40,403 INFO L225 Difference]: With dead ends: 239 [2025-03-17 03:07:40,404 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 03:07:40,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:07:40,405 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 89 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:07:40,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 345 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:07:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 03:07:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 125. [2025-03-17 03:07:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 03:07:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2025-03-17 03:07:40,429 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 140 [2025-03-17 03:07:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:07:40,429 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2025-03-17 03:07:40,430 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2025-03-17 03:07:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 03:07:40,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:40,431 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:40,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:07:40,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:40,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash -945391771, now seen corresponding path program 1 times [2025-03-17 03:07:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:40,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578305867] [2025-03-17 03:07:40,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:40,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:40,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:07:40,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:07:40,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:40,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:07:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578305867] [2025-03-17 03:07:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578305867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:40,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:07:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:07:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725693485] [2025-03-17 03:07:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:40,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:07:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:40,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:07:40,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:07:40,832 INFO L87 Difference]: Start difference. First operand 125 states and 192 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:40,969 INFO L93 Difference]: Finished difference Result 303 states and 457 transitions. [2025-03-17 03:07:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:07:40,970 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 03:07:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:40,973 INFO L225 Difference]: With dead ends: 303 [2025-03-17 03:07:40,974 INFO L226 Difference]: Without dead ends: 224 [2025-03-17 03:07:40,975 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-17 03:07:40,976 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 185 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:07:40,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 281 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:07:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-17 03:07:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 177. [2025-03-17 03:07:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 125 states have (on average 1.384) internal successors, (173), 126 states have internal predecessors, (173), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:07:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2025-03-17 03:07:40,992 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 140 [2025-03-17 03:07:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:07:40,993 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2025-03-17 03:07:40,993 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2025-03-17 03:07:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 03:07:40,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:40,998 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:40,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:07:40,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:40,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash 102134723, now seen corresponding path program 1 times [2025-03-17 03:07:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002422117] [2025-03-17 03:07:40,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:41,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:07:41,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:07:41,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:41,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:07:44,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:44,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002422117] [2025-03-17 03:07:44,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002422117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:44,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:07:44,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 03:07:44,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220939647] [2025-03-17 03:07:44,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:44,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:07:44,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:44,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:07:44,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:07:44,594 INFO L87 Difference]: Start difference. First operand 177 states and 269 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:45,853 INFO L93 Difference]: Finished difference Result 658 states and 972 transitions. [2025-03-17 03:07:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 03:07:45,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 03:07:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:45,857 INFO L225 Difference]: With dead ends: 658 [2025-03-17 03:07:45,857 INFO L226 Difference]: Without dead ends: 528 [2025-03-17 03:07:45,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2025-03-17 03:07:45,858 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 746 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:07:45,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 895 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:07:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-17 03:07:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 221. [2025-03-17 03:07:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 169 states have (on average 1.4082840236686391) internal successors, (238), 170 states have internal predecessors, (238), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:07:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 334 transitions. [2025-03-17 03:07:45,890 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 334 transitions. Word has length 140 [2025-03-17 03:07:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:07:45,891 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 334 transitions. [2025-03-17 03:07:45,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 334 transitions. [2025-03-17 03:07:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 03:07:45,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:45,894 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:45,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:07:45,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:45,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1844945058, now seen corresponding path program 1 times [2025-03-17 03:07:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:45,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985481325] [2025-03-17 03:07:45,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:45,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:07:45,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:07:45,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:45,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:07:48,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:48,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985481325] [2025-03-17 03:07:48,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985481325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:48,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:07:48,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:07:48,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970607938] [2025-03-17 03:07:48,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:48,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:07:48,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:48,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:07:48,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:07:48,900 INFO L87 Difference]: Start difference. First operand 221 states and 334 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:49,666 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2025-03-17 03:07:49,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 03:07:49,667 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 03:07:49,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:49,669 INFO L225 Difference]: With dead ends: 528 [2025-03-17 03:07:49,669 INFO L226 Difference]: Without dead ends: 375 [2025-03-17 03:07:49,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:07:49,670 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 333 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:07:49,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 760 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:07:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-17 03:07:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 238. [2025-03-17 03:07:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 186 states have (on average 1.424731182795699) internal successors, (265), 187 states have internal predecessors, (265), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:07:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 361 transitions. [2025-03-17 03:07:49,694 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 361 transitions. Word has length 140 [2025-03-17 03:07:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:07:49,694 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 361 transitions. [2025-03-17 03:07:49,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 361 transitions. [2025-03-17 03:07:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 03:07:49,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:49,697 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:49,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:07:49,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:49,699 INFO L85 PathProgramCache]: Analyzing trace with hash -734040858, now seen corresponding path program 1 times [2025-03-17 03:07:49,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:49,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166896353] [2025-03-17 03:07:49,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:49,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:07:49,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:07:49,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:49,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:07:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166896353] [2025-03-17 03:07:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166896353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:49,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:07:49,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:07:49,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51338429] [2025-03-17 03:07:49,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:49,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:07:49,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:49,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:07:49,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:07:49,911 INFO L87 Difference]: Start difference. First operand 238 states and 361 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:50,049 INFO L93 Difference]: Finished difference Result 442 states and 663 transitions. [2025-03-17 03:07:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:07:50,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 03:07:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:50,051 INFO L225 Difference]: With dead ends: 442 [2025-03-17 03:07:50,052 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 03:07:50,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:07:50,052 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 120 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:07:50,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 417 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:07:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 03:07:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 235. [2025-03-17 03:07:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 183 states have (on average 1.4043715846994536) internal successors, (257), 184 states have internal predecessors, (257), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:07:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 353 transitions. [2025-03-17 03:07:50,073 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 353 transitions. Word has length 140 [2025-03-17 03:07:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:07:50,074 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 353 transitions. [2025-03-17 03:07:50,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 353 transitions. [2025-03-17 03:07:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 03:07:50,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:50,075 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:50,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:07:50,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1008769477, now seen corresponding path program 1 times [2025-03-17 03:07:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:50,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027512587] [2025-03-17 03:07:50,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:50,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:07:50,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:07:50,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:50,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:07:52,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:52,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027512587] [2025-03-17 03:07:52,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027512587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:52,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:07:52,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:07:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668207577] [2025-03-17 03:07:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:52,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:07:52,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:52,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:07:52,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:07:52,764 INFO L87 Difference]: Start difference. First operand 235 states and 353 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:53,665 INFO L93 Difference]: Finished difference Result 688 states and 1011 transitions. [2025-03-17 03:07:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 03:07:53,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 03:07:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:53,668 INFO L225 Difference]: With dead ends: 688 [2025-03-17 03:07:53,668 INFO L226 Difference]: Without dead ends: 523 [2025-03-17 03:07:53,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:07:53,669 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 450 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:07:53,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 975 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:07:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-17 03:07:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 284. [2025-03-17 03:07:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 230 states have (on average 1.4) internal successors, (322), 231 states have internal predecessors, (322), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:07:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 418 transitions. [2025-03-17 03:07:53,687 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 418 transitions. Word has length 140 [2025-03-17 03:07:53,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:07:53,688 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 418 transitions. [2025-03-17 03:07:53,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 418 transitions. [2025-03-17 03:07:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 03:07:53,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:53,689 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:07:53,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1646522823, now seen corresponding path program 1 times [2025-03-17 03:07:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:53,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992715871] [2025-03-17 03:07:53,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:53,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 03:07:53,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 03:07:53,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:53,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:07:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992715871] [2025-03-17 03:07:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992715871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:07:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:07:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649811884] [2025-03-17 03:07:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:53,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:07:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:53,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:07:53,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:07:53,733 INFO L87 Difference]: Start difference. First operand 284 states and 418 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:53,750 INFO L93 Difference]: Finished difference Result 478 states and 710 transitions. [2025-03-17 03:07:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:07:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-17 03:07:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:53,752 INFO L225 Difference]: With dead ends: 478 [2025-03-17 03:07:53,752 INFO L226 Difference]: Without dead ends: 286 [2025-03-17 03:07:53,753 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-17 03:07:53,753 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:07:53,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:07:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-17 03:07:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-03-17 03:07:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 232 states have (on average 1.396551724137931) internal successors, (324), 233 states have internal predecessors, (324), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:07:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 420 transitions. [2025-03-17 03:07:53,786 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 420 transitions. Word has length 140 [2025-03-17 03:07:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:07:53,789 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 420 transitions. [2025-03-17 03:07:53,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 420 transitions. [2025-03-17 03:07:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:07:53,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:53,790 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:53,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:07:53,791 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:53,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash -895762220, now seen corresponding path program 1 times [2025-03-17 03:07:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461900229] [2025-03-17 03:07:53,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:53,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:07:53,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:07:53,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:53,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:07:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461900229] [2025-03-17 03:07:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461900229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:57,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:07:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 03:07:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044715296] [2025-03-17 03:07:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:57,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:07:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:57,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:07:57,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:07:57,269 INFO L87 Difference]: Start difference. First operand 286 states and 420 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:58,676 INFO L93 Difference]: Finished difference Result 784 states and 1147 transitions. [2025-03-17 03:07:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 03:07:58,677 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 03:07:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:58,679 INFO L225 Difference]: With dead ends: 784 [2025-03-17 03:07:58,679 INFO L226 Difference]: Without dead ends: 547 [2025-03-17 03:07:58,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2025-03-17 03:07:58,680 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 536 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:07:58,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1101 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:07:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-17 03:07:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 375. [2025-03-17 03:07:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 321 states have (on average 1.4330218068535825) internal successors, (460), 322 states have internal predecessors, (460), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:07:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 556 transitions. [2025-03-17 03:07:58,711 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 556 transitions. Word has length 141 [2025-03-17 03:07:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:07:58,711 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 556 transitions. [2025-03-17 03:07:58,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 556 transitions. [2025-03-17 03:07:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:07:58,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:07:58,715 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:07:58,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:07:58,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:07:58,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:07:58,715 INFO L85 PathProgramCache]: Analyzing trace with hash 847048115, now seen corresponding path program 1 times [2025-03-17 03:07:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:07:58,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647563418] [2025-03-17 03:07:58,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:07:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:07:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:07:58,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:07:58,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:07:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:07:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:07:59,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:07:59,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647563418] [2025-03-17 03:07:59,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647563418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:07:59,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:07:59,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:07:59,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564114166] [2025-03-17 03:07:59,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:07:59,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:07:59,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:07:59,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:07:59,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:07:59,287 INFO L87 Difference]: Start difference. First operand 375 states and 556 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:07:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:07:59,976 INFO L93 Difference]: Finished difference Result 728 states and 1053 transitions. [2025-03-17 03:07:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 03:07:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 03:07:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:07:59,979 INFO L225 Difference]: With dead ends: 728 [2025-03-17 03:07:59,979 INFO L226 Difference]: Without dead ends: 538 [2025-03-17 03:07:59,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:07:59,980 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 403 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:07:59,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1001 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:07:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-17 03:08:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 440. [2025-03-17 03:08:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 383 states have (on average 1.4386422976501305) internal successors, (551), 385 states have internal predecessors, (551), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 03:08:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 651 transitions. [2025-03-17 03:08:00,009 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 651 transitions. Word has length 141 [2025-03-17 03:08:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:00,009 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 651 transitions. [2025-03-17 03:08:00,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 651 transitions. [2025-03-17 03:08:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:08:00,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:00,011 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:00,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 03:08:00,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:00,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:00,012 INFO L85 PathProgramCache]: Analyzing trace with hash -684411307, now seen corresponding path program 1 times [2025-03-17 03:08:00,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:00,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924437088] [2025-03-17 03:08:00,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:00,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:00,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:08:00,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:08:00,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:00,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:00,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:00,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924437088] [2025-03-17 03:08:00,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924437088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:00,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:00,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:08:00,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794569055] [2025-03-17 03:08:00,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:00,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:08:00,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:00,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:08:00,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:08:00,173 INFO L87 Difference]: Start difference. First operand 440 states and 651 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:00,439 INFO L93 Difference]: Finished difference Result 1017 states and 1497 transitions. [2025-03-17 03:08:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:08:00,440 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 03:08:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:00,443 INFO L225 Difference]: With dead ends: 1017 [2025-03-17 03:08:00,443 INFO L226 Difference]: Without dead ends: 796 [2025-03-17 03:08:00,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:08:00,444 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 322 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:00,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 592 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:08:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-17 03:08:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 570. [2025-03-17 03:08:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 488 states have (on average 1.4241803278688525) internal successors, (695), 491 states have internal predecessors, (695), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:08:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 839 transitions. [2025-03-17 03:08:00,481 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 839 transitions. Word has length 141 [2025-03-17 03:08:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:00,482 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 839 transitions. [2025-03-17 03:08:00,483 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 839 transitions. [2025-03-17 03:08:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:08:00,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:00,484 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:00,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 03:08:00,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:00,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:00,485 INFO L85 PathProgramCache]: Analyzing trace with hash 363115187, now seen corresponding path program 1 times [2025-03-17 03:08:00,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:00,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403912514] [2025-03-17 03:08:00,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:00,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:08:00,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:08:00,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:00,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:00,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403912514] [2025-03-17 03:08:00,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403912514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:00,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:00,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:08:00,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397451341] [2025-03-17 03:08:00,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:00,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:08:00,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:00,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:08:00,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:08:00,633 INFO L87 Difference]: Start difference. First operand 570 states and 839 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:00,744 INFO L93 Difference]: Finished difference Result 1012 states and 1500 transitions. [2025-03-17 03:08:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:08:00,745 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 03:08:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:00,748 INFO L225 Difference]: With dead ends: 1012 [2025-03-17 03:08:00,748 INFO L226 Difference]: Without dead ends: 792 [2025-03-17 03:08:00,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:08:00,751 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 163 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:00,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 614 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:08:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-17 03:08:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 577. [2025-03-17 03:08:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 495 states have (on average 1.4181818181818182) internal successors, (702), 498 states have internal predecessors, (702), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:08:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 846 transitions. [2025-03-17 03:08:00,784 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 846 transitions. Word has length 141 [2025-03-17 03:08:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:00,785 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 846 transitions. [2025-03-17 03:08:00,785 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 846 transitions. [2025-03-17 03:08:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:08:00,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:00,787 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:00,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 03:08:00,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:00,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2105925522, now seen corresponding path program 1 times [2025-03-17 03:08:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:00,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994210440] [2025-03-17 03:08:00,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:00,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:00,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:08:00,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:08:00,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:00,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:02,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994210440] [2025-03-17 03:08:02,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994210440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:02,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:02,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 03:08:02,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78389151] [2025-03-17 03:08:02,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:02,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:08:02,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:02,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:08:02,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:08:02,828 INFO L87 Difference]: Start difference. First operand 577 states and 846 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:03,464 INFO L93 Difference]: Finished difference Result 1158 states and 1674 transitions. [2025-03-17 03:08:03,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:08:03,465 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 03:08:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:03,468 INFO L225 Difference]: With dead ends: 1158 [2025-03-17 03:08:03,468 INFO L226 Difference]: Without dead ends: 840 [2025-03-17 03:08:03,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:08:03,471 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 330 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:03,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 959 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:08:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-17 03:08:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 614. [2025-03-17 03:08:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 532 states have (on average 1.4210526315789473) internal successors, (756), 535 states have internal predecessors, (756), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:08:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 900 transitions. [2025-03-17 03:08:03,498 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 900 transitions. Word has length 141 [2025-03-17 03:08:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:03,498 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 900 transitions. [2025-03-17 03:08:03,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 900 transitions. [2025-03-17 03:08:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:08:03,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:03,500 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:03,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 03:08:03,500 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:03,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1108853169, now seen corresponding path program 1 times [2025-03-17 03:08:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:03,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897315480] [2025-03-17 03:08:03,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:03,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:03,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:08:03,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:08:03,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:03,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:05,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897315480] [2025-03-17 03:08:05,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897315480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:05,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:05,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 03:08:05,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834476358] [2025-03-17 03:08:05,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:05,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 03:08:05,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:05,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 03:08:05,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 03:08:05,423 INFO L87 Difference]: Start difference. First operand 614 states and 900 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:06,659 INFO L93 Difference]: Finished difference Result 997 states and 1432 transitions. [2025-03-17 03:08:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 03:08:06,659 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 03:08:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:06,664 INFO L225 Difference]: With dead ends: 997 [2025-03-17 03:08:06,664 INFO L226 Difference]: Without dead ends: 717 [2025-03-17 03:08:06,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2025-03-17 03:08:06,666 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 488 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:06,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1347 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:08:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-17 03:08:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 614. [2025-03-17 03:08:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 531 states have (on average 1.4180790960451977) internal successors, (753), 534 states have internal predecessors, (753), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:08:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 897 transitions. [2025-03-17 03:08:06,713 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 897 transitions. Word has length 141 [2025-03-17 03:08:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:06,714 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 897 transitions. [2025-03-17 03:08:06,714 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 897 transitions. [2025-03-17 03:08:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:08:06,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:06,716 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:06,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:08:06,716 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:06,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1944294805, now seen corresponding path program 1 times [2025-03-17 03:08:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577250593] [2025-03-17 03:08:06,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:06,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:08:06,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:08:06,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:06,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:08,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577250593] [2025-03-17 03:08:08,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577250593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:08,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:08,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 03:08:08,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094848492] [2025-03-17 03:08:08,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:08,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 03:08:08,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:08,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 03:08:08,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:08:08,818 INFO L87 Difference]: Start difference. First operand 614 states and 897 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:09,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:09,703 INFO L93 Difference]: Finished difference Result 1200 states and 1732 transitions. [2025-03-17 03:08:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:08:09,704 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 03:08:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:09,707 INFO L225 Difference]: With dead ends: 1200 [2025-03-17 03:08:09,708 INFO L226 Difference]: Without dead ends: 1013 [2025-03-17 03:08:09,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:08:09,709 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 508 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:09,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 985 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:08:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-17 03:08:09,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 614. [2025-03-17 03:08:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 531 states have (on average 1.4180790960451977) internal successors, (753), 534 states have internal predecessors, (753), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:08:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 897 transitions. [2025-03-17 03:08:09,737 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 897 transitions. Word has length 141 [2025-03-17 03:08:09,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:09,737 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 897 transitions. [2025-03-17 03:08:09,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 897 transitions. [2025-03-17 03:08:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 03:08:09,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:09,739 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:09,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 03:08:09,739 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:09,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:09,740 INFO L85 PathProgramCache]: Analyzing trace with hash -734479373, now seen corresponding path program 1 times [2025-03-17 03:08:09,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:09,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7631546] [2025-03-17 03:08:09,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:09,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:09,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 03:08:09,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 03:08:09,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:09,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:09,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:09,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7631546] [2025-03-17 03:08:09,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7631546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:09,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:08:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024230069] [2025-03-17 03:08:09,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:09,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:08:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:09,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:08:09,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:08:09,803 INFO L87 Difference]: Start difference. First operand 614 states and 897 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:09,856 INFO L93 Difference]: Finished difference Result 1275 states and 1853 transitions. [2025-03-17 03:08:09,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:08:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-17 03:08:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:09,860 INFO L225 Difference]: With dead ends: 1275 [2025-03-17 03:08:09,860 INFO L226 Difference]: Without dead ends: 915 [2025-03-17 03:08:09,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:08:09,862 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 60 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:09,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 333 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:08:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-17 03:08:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 910. [2025-03-17 03:08:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 799 states have (on average 1.4042553191489362) internal successors, (1122), 807 states have internal predecessors, (1122), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 03:08:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1310 transitions. [2025-03-17 03:08:09,903 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1310 transitions. Word has length 141 [2025-03-17 03:08:09,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:09,904 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1310 transitions. [2025-03-17 03:08:09,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1310 transitions. [2025-03-17 03:08:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:08:09,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:09,906 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:09,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 03:08:09,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1480638330, now seen corresponding path program 1 times [2025-03-17 03:08:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:09,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249377658] [2025-03-17 03:08:09,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:09,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:08:09,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:08:09,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:09,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:11,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:11,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249377658] [2025-03-17 03:08:11,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249377658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:11,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:08:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053481740] [2025-03-17 03:08:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:11,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:08:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:11,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:08:11,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:08:11,681 INFO L87 Difference]: Start difference. First operand 910 states and 1310 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:12,321 INFO L93 Difference]: Finished difference Result 1514 states and 2159 transitions. [2025-03-17 03:08:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:08:12,322 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-17 03:08:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:12,325 INFO L225 Difference]: With dead ends: 1514 [2025-03-17 03:08:12,325 INFO L226 Difference]: Without dead ends: 1166 [2025-03-17 03:08:12,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-03-17 03:08:12,326 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 375 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:12,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 929 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:08:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-03-17 03:08:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 935. [2025-03-17 03:08:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 824 states have (on average 1.4053398058252426) internal successors, (1158), 832 states have internal predecessors, (1158), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 03:08:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1346 transitions. [2025-03-17 03:08:12,365 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1346 transitions. Word has length 142 [2025-03-17 03:08:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:12,366 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1346 transitions. [2025-03-17 03:08:12,366 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1346 transitions. [2025-03-17 03:08:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:08:12,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:12,367 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:12,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 03:08:12,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:12,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:12,368 INFO L85 PathProgramCache]: Analyzing trace with hash -326816133, now seen corresponding path program 1 times [2025-03-17 03:08:12,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:12,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037783924] [2025-03-17 03:08:12,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:12,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:08:12,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:08:12,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:12,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:12,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:12,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037783924] [2025-03-17 03:08:12,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037783924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:12,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:08:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87103137] [2025-03-17 03:08:12,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:12,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:08:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:12,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:08:12,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:08:12,472 INFO L87 Difference]: Start difference. First operand 935 states and 1346 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:12,578 INFO L93 Difference]: Finished difference Result 1713 states and 2469 transitions. [2025-03-17 03:08:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:08:12,579 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-17 03:08:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:12,582 INFO L225 Difference]: With dead ends: 1713 [2025-03-17 03:08:12,582 INFO L226 Difference]: Without dead ends: 1188 [2025-03-17 03:08:12,583 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-17 03:08:12,584 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 124 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:12,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 326 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:08:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-03-17 03:08:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 937. [2025-03-17 03:08:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 826 states have (on average 1.400726392251816) internal successors, (1157), 834 states have internal predecessors, (1157), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 03:08:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1345 transitions. [2025-03-17 03:08:12,637 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1345 transitions. Word has length 142 [2025-03-17 03:08:12,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:12,637 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1345 transitions. [2025-03-17 03:08:12,638 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1345 transitions. [2025-03-17 03:08:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:08:12,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:12,639 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:12,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 03:08:12,640 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:12,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash 560687548, now seen corresponding path program 1 times [2025-03-17 03:08:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:12,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405554690] [2025-03-17 03:08:12,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:12,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:08:12,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:08:12,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:12,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405554690] [2025-03-17 03:08:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405554690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:15,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:15,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 03:08:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447288910] [2025-03-17 03:08:15,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:15,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 03:08:15,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:15,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 03:08:15,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:08:15,923 INFO L87 Difference]: Start difference. First operand 937 states and 1345 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:17,716 INFO L93 Difference]: Finished difference Result 1378 states and 1954 transitions. [2025-03-17 03:08:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 03:08:17,717 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-17 03:08:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:17,720 INFO L225 Difference]: With dead ends: 1378 [2025-03-17 03:08:17,720 INFO L226 Difference]: Without dead ends: 1042 [2025-03-17 03:08:17,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2025-03-17 03:08:17,721 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 573 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:17,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1032 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:08:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-03-17 03:08:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 938. [2025-03-17 03:08:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 827 states have (on average 1.400241837968561) internal successors, (1158), 835 states have internal predecessors, (1158), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 03:08:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1346 transitions. [2025-03-17 03:08:17,762 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1346 transitions. Word has length 142 [2025-03-17 03:08:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:17,762 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1346 transitions. [2025-03-17 03:08:17,763 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1346 transitions. [2025-03-17 03:08:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:08:17,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:17,764 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:17,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 03:08:17,764 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:17,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1344211646, now seen corresponding path program 1 times [2025-03-17 03:08:17,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:17,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244831413] [2025-03-17 03:08:17,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:17,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:08:17,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:08:17,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:17,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:20,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244831413] [2025-03-17 03:08:20,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244831413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:20,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:20,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 03:08:20,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004383395] [2025-03-17 03:08:20,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:20,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 03:08:20,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:20,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 03:08:20,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:08:20,902 INFO L87 Difference]: Start difference. First operand 938 states and 1346 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:22,499 INFO L93 Difference]: Finished difference Result 1362 states and 1935 transitions. [2025-03-17 03:08:22,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 03:08:22,500 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-17 03:08:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:22,503 INFO L225 Difference]: With dead ends: 1362 [2025-03-17 03:08:22,503 INFO L226 Difference]: Without dead ends: 1026 [2025-03-17 03:08:22,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2025-03-17 03:08:22,505 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 449 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:22,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1140 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 03:08:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-03-17 03:08:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 935. [2025-03-17 03:08:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 824 states have (on average 1.4004854368932038) internal successors, (1154), 832 states have internal predecessors, (1154), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 03:08:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1342 transitions. [2025-03-17 03:08:22,550 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1342 transitions. Word has length 142 [2025-03-17 03:08:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:22,550 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1342 transitions. [2025-03-17 03:08:22,551 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), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1342 transitions. [2025-03-17 03:08:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:08:22,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:22,552 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:22,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 03:08:22,553 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:22,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:22,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2081734109, now seen corresponding path program 1 times [2025-03-17 03:08:22,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:22,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341897314] [2025-03-17 03:08:22,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:22,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:22,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:08:22,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:08:22,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:22,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:22,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:22,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341897314] [2025-03-17 03:08:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341897314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:22,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:22,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:08:22,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537690162] [2025-03-17 03:08:22,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:22,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:08:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:22,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:08:22,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:08:22,717 INFO L87 Difference]: Start difference. First operand 935 states and 1342 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:22,831 INFO L93 Difference]: Finished difference Result 1606 states and 2317 transitions. [2025-03-17 03:08:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:08:22,831 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-17 03:08:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:22,835 INFO L225 Difference]: With dead ends: 1606 [2025-03-17 03:08:22,835 INFO L226 Difference]: Without dead ends: 1076 [2025-03-17 03:08:22,837 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-17 03:08:22,837 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 136 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:22,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 411 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:08:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-03-17 03:08:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 903. [2025-03-17 03:08:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 792 states have (on average 1.3977272727272727) internal successors, (1107), 800 states have internal predecessors, (1107), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 03:08:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1295 transitions. [2025-03-17 03:08:22,881 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1295 transitions. Word has length 142 [2025-03-17 03:08:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:22,882 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1295 transitions. [2025-03-17 03:08:22,882 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1295 transitions. [2025-03-17 03:08:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:08:22,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:22,883 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:22,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 03:08:22,883 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:22,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash 43677820, now seen corresponding path program 1 times [2025-03-17 03:08:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:22,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939800755] [2025-03-17 03:08:22,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:22,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:22,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:08:22,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:08:22,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:22,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:24,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:24,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939800755] [2025-03-17 03:08:24,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939800755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:24,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:24,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:08:24,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887291217] [2025-03-17 03:08:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:24,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:08:24,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:24,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:08:24,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:08:24,586 INFO L87 Difference]: Start difference. First operand 903 states and 1295 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:25,551 INFO L93 Difference]: Finished difference Result 1605 states and 2276 transitions. [2025-03-17 03:08:25,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 03:08:25,553 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-17 03:08:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:25,556 INFO L225 Difference]: With dead ends: 1605 [2025-03-17 03:08:25,556 INFO L226 Difference]: Without dead ends: 1140 [2025-03-17 03:08:25,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-03-17 03:08:25,559 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 343 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:25,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1103 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:08:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-17 03:08:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 926. [2025-03-17 03:08:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 815 states have (on average 1.4) internal successors, (1141), 823 states have internal predecessors, (1141), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 03:08:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1329 transitions. [2025-03-17 03:08:25,604 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1329 transitions. Word has length 142 [2025-03-17 03:08:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:25,605 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1329 transitions. [2025-03-17 03:08:25,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1329 transitions. [2025-03-17 03:08:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:08:25,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:25,606 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:25,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 03:08:25,607 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:25,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash -800794051, now seen corresponding path program 1 times [2025-03-17 03:08:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:25,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344986224] [2025-03-17 03:08:25,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:25,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:25,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:08:25,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:08:25,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:25,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 03:08:27,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:27,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344986224] [2025-03-17 03:08:27,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344986224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:27,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:27,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:08:27,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606251683] [2025-03-17 03:08:27,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:27,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:08:27,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:27,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:08:27,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:08:27,103 INFO L87 Difference]: Start difference. First operand 926 states and 1329 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:27,943 INFO L93 Difference]: Finished difference Result 1461 states and 2086 transitions. [2025-03-17 03:08:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 03:08:27,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-17 03:08:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:27,946 INFO L225 Difference]: With dead ends: 1461 [2025-03-17 03:08:27,946 INFO L226 Difference]: Without dead ends: 996 [2025-03-17 03:08:27,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:08:27,947 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 374 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:27,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1085 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:08:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-17 03:08:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 907. [2025-03-17 03:08:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 796 states have (on average 1.399497487437186) internal successors, (1114), 804 states have internal predecessors, (1114), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 03:08:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1302 transitions. [2025-03-17 03:08:27,991 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1302 transitions. Word has length 142 [2025-03-17 03:08:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:27,992 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1302 transitions. [2025-03-17 03:08:27,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 03:08:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1302 transitions. [2025-03-17 03:08:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 03:08:27,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:27,993 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:27,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 03:08:27,993 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:27,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1258774278, now seen corresponding path program 1 times [2025-03-17 03:08:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:27,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590847656] [2025-03-17 03:08:27,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:28,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 03:08:28,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 03:08:28,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:28,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:46,850 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 151 DAG size of output: 150 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)