./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.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_fillercode_fillercodesize_ps-cn-250_file-90.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 135ac301b840ddafcbb7b86477d3c5ee7127cca75a8084665d3a360db9d72e39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:11:32,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:11:33,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:11:33,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:11:33,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:11:33,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:11:33,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:11:33,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:11:33,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:11:33,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:11:33,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:11:33,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:11:33,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:11:33,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:11:33,115 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:11:33,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:11:33,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:11:33,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:11:33,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:11:33,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:11:33,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:11:33,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:11:33,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:11:33,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:11:33,119 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:11:33,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:11:33,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:11:33,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:11:33,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:11:33,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:11:33,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:11:33,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:11:33,119 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 -> 135ac301b840ddafcbb7b86477d3c5ee7127cca75a8084665d3a360db9d72e39 [2025-03-17 00:11:33,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:11:33,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:11:33,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:11:33,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:11:33,396 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:11:33,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.i [2025-03-17 00:11:34,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21234b70f/ec1cbf7234744c5b8ff8aa56f29d86c1/FLAGf883b5d76 [2025-03-17 00:11:35,187 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:11:35,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.i [2025-03-17 00:11:35,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21234b70f/ec1cbf7234744c5b8ff8aa56f29d86c1/FLAGf883b5d76 [2025-03-17 00:11:35,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21234b70f/ec1cbf7234744c5b8ff8aa56f29d86c1 [2025-03-17 00:11:35,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:11:35,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:11:35,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:11:35,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:11:35,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:11:35,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35, skipping insertion in model container [2025-03-17 00:11:35,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:11:35,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.i[916,929] [2025-03-17 00:11:35,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:11:35,756 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:11:35,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-90.i[916,929] [2025-03-17 00:11:35,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:11:35,857 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:11:35,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35 WrapperNode [2025-03-17 00:11:35,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:11:35,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:11:35,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:11:35,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:11:35,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,932 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2025-03-17 00:11:35,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:11:35,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:11:35,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:11:35,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:11:35,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,981 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 00:11:35,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:35,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:36,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:36,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:11:36,016 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:11:36,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:11:36,018 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:11:36,020 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (1/1) ... [2025-03-17 00:11:36,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:11:36,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:11:36,061 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 00:11:36,066 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 00:11:36,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:11:36,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:11:36,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:11:36,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:11:36,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:11:36,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:11:36,218 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:11:36,220 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:11:37,004 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: havoc property_#t~bitwise41#1; [2025-03-17 00:11:37,095 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-17 00:11:37,095 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:11:37,134 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:11:37,134 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 00:11:37,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:11:37 BoogieIcfgContainer [2025-03-17 00:11:37,134 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:11:37,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:11:37,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:11:37,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:11:37,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:11:35" (1/3) ... [2025-03-17 00:11:37,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee9b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:11:37, skipping insertion in model container [2025-03-17 00:11:37,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:35" (2/3) ... [2025-03-17 00:11:37,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee9b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:11:37, skipping insertion in model container [2025-03-17 00:11:37,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:11:37" (3/3) ... [2025-03-17 00:11:37,175 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-90.i [2025-03-17 00:11:37,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:11:37,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-90.i that has 2 procedures, 194 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:11:37,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:11:37,288 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;@56f26536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:11:37,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:11:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 137 states have internal predecessors, (222), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 00:11:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-17 00:11:37,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:37,324 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:11:37,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:37,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:37,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1274842222, now seen corresponding path program 1 times [2025-03-17 00:11:37,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:37,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087892250] [2025-03-17 00:11:37,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:37,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:37,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-17 00:11:37,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-17 00:11:37,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:37,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2025-03-17 00:11:37,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:37,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087892250] [2025-03-17 00:11:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087892250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:11:37,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599489807] [2025-03-17 00:11:37,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:37,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:11:37,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:11:37,794 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 00:11:37,796 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 00:11:37,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-17 00:11:38,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-17 00:11:38,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:38,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:38,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:11:38,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:11:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2025-03-17 00:11:38,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:11:38,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599489807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:38,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:11:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:11:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144279806] [2025-03-17 00:11:38,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:38,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:11:38,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:38,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:11:38,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:11:38,286 INFO L87 Difference]: Start difference. First operand has 194 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 137 states have internal predecessors, (222), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-17 00:11:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:38,350 INFO L93 Difference]: Finished difference Result 385 states and 717 transitions. [2025-03-17 00:11:38,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:11:38,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) Word has length 354 [2025-03-17 00:11:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:38,362 INFO L225 Difference]: With dead ends: 385 [2025-03-17 00:11:38,363 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 00:11:38,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 355 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 00:11:38,380 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:38,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:11:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 00:11:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-03-17 00:11:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 135 states have (on average 1.614814814814815) internal successors, (218), 135 states have internal predecessors, (218), 55 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 00:11:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 328 transitions. [2025-03-17 00:11:38,479 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 328 transitions. Word has length 354 [2025-03-17 00:11:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:38,481 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 328 transitions. [2025-03-17 00:11:38,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 2 states have call successors, (55) [2025-03-17 00:11:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 328 transitions. [2025-03-17 00:11:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-17 00:11:38,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:38,497 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:11:38,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:11:38,698 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 00:11:38,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:38,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash -647394001, now seen corresponding path program 1 times [2025-03-17 00:11:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:38,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493713805] [2025-03-17 00:11:38,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:38,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-17 00:11:38,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-17 00:11:38,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:38,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:11:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:39,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493713805] [2025-03-17 00:11:39,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493713805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:39,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:39,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:11:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894076324] [2025-03-17 00:11:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:39,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:11:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:39,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:11:39,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:11:39,173 INFO L87 Difference]: Start difference. First operand 192 states and 328 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:39,310 INFO L93 Difference]: Finished difference Result 508 states and 871 transitions. [2025-03-17 00:11:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:11:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 354 [2025-03-17 00:11:39,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:39,319 INFO L225 Difference]: With dead ends: 508 [2025-03-17 00:11:39,319 INFO L226 Difference]: Without dead ends: 317 [2025-03-17 00:11:39,325 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 00:11:39,327 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 217 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:39,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 687 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:11:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-17 00:11:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2025-03-17 00:11:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 238 states have (on average 1.6470588235294117) internal successors, (392), 239 states have internal predecessors, (392), 73 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-17 00:11:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 538 transitions. [2025-03-17 00:11:39,420 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 538 transitions. Word has length 354 [2025-03-17 00:11:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:39,422 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 538 transitions. [2025-03-17 00:11:39,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 538 transitions. [2025-03-17 00:11:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-17 00:11:39,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:39,430 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:11:39,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:11:39,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:39,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash -655153360, now seen corresponding path program 1 times [2025-03-17 00:11:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:39,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469064150] [2025-03-17 00:11:39,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:39,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:39,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-17 00:11:39,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-17 00:11:39,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:39,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:11:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469064150] [2025-03-17 00:11:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469064150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:39,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:39,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:11:39,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952861925] [2025-03-17 00:11:39,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:39,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:11:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:39,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:11:39,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:11:39,797 INFO L87 Difference]: Start difference. First operand 314 states and 538 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:39,913 INFO L93 Difference]: Finished difference Result 634 states and 1080 transitions. [2025-03-17 00:11:39,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:11:39,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 354 [2025-03-17 00:11:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:39,921 INFO L225 Difference]: With dead ends: 634 [2025-03-17 00:11:39,922 INFO L226 Difference]: Without dead ends: 321 [2025-03-17 00:11:39,924 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 00:11:39,925 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 182 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:39,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 698 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:11:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-17 00:11:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2025-03-17 00:11:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 states have internal predecessors, (339), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 00:11:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 449 transitions. [2025-03-17 00:11:39,963 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 449 transitions. Word has length 354 [2025-03-17 00:11:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 449 transitions. [2025-03-17 00:11:39,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 449 transitions. [2025-03-17 00:11:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-17 00:11:39,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:39,970 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:11:39,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:11:39,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:39,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:39,971 INFO L85 PathProgramCache]: Analyzing trace with hash 698156337, now seen corresponding path program 1 times [2025-03-17 00:11:39,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:39,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836588094] [2025-03-17 00:11:39,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:40,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-17 00:11:40,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-17 00:11:40,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:40,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:11:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836588094] [2025-03-17 00:11:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836588094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:40,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:40,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:11:40,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559842282] [2025-03-17 00:11:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:40,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:11:40,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:40,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:11:40,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:11:40,457 INFO L87 Difference]: Start difference. First operand 262 states and 449 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:44,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:11:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:45,575 INFO L93 Difference]: Finished difference Result 936 states and 1604 transitions. [2025-03-17 00:11:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:11:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 354 [2025-03-17 00:11:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:45,582 INFO L225 Difference]: With dead ends: 936 [2025-03-17 00:11:45,582 INFO L226 Difference]: Without dead ends: 675 [2025-03-17 00:11:45,584 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 00:11:45,584 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 550 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 93 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:45,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 924 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 227 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-17 00:11:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-17 00:11:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 669. [2025-03-17 00:11:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 535 states have (on average 1.674766355140187) internal successors, (896), 537 states have internal predecessors, (896), 127 states have call successors, (127), 6 states have call predecessors, (127), 6 states have return successors, (127), 125 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-17 00:11:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1150 transitions. [2025-03-17 00:11:45,643 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1150 transitions. Word has length 354 [2025-03-17 00:11:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:45,644 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 1150 transitions. [2025-03-17 00:11:45,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1150 transitions. [2025-03-17 00:11:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-17 00:11:45,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:45,651 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:11:45,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:11:45,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:45,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1147613039, now seen corresponding path program 1 times [2025-03-17 00:11:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:45,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822510588] [2025-03-17 00:11:45,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:45,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:45,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-17 00:11:45,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-17 00:11:45,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:11:46,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:46,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822510588] [2025-03-17 00:11:46,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822510588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:46,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:46,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:11:46,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370353830] [2025-03-17 00:11:46,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:46,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:11:46,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:46,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:11:46,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:11:46,350 INFO L87 Difference]: Start difference. First operand 669 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:46,848 INFO L93 Difference]: Finished difference Result 1789 states and 3073 transitions. [2025-03-17 00:11:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:11:46,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 354 [2025-03-17 00:11:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:46,867 INFO L225 Difference]: With dead ends: 1789 [2025-03-17 00:11:46,867 INFO L226 Difference]: Without dead ends: 1121 [2025-03-17 00:11:46,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:11:46,873 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 421 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:46,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1175 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:11:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-17 00:11:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1119. [2025-03-17 00:11:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 882 states have (on average 1.663265306122449) internal successors, (1467), 885 states have internal predecessors, (1467), 226 states have call successors, (226), 10 states have call predecessors, (226), 10 states have return successors, (226), 223 states have call predecessors, (226), 226 states have call successors, (226) [2025-03-17 00:11:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1919 transitions. [2025-03-17 00:11:47,026 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1919 transitions. Word has length 354 [2025-03-17 00:11:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:47,027 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1919 transitions. [2025-03-17 00:11:47,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1919 transitions. [2025-03-17 00:11:47,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-17 00:11:47,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:47,034 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:11:47,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:11:47,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:47,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash -532876262, now seen corresponding path program 1 times [2025-03-17 00:11:47,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:47,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355947796] [2025-03-17 00:11:47,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:47,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:47,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-17 00:11:47,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-17 00:11:47,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:47,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:11:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355947796] [2025-03-17 00:11:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355947796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:11:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349159312] [2025-03-17 00:11:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:50,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:11:50,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:50,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:11:50,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:11:50,920 INFO L87 Difference]: Start difference. First operand 1119 states and 1919 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:58,361 INFO L93 Difference]: Finished difference Result 4734 states and 7978 transitions. [2025-03-17 00:11:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:11:58,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 355 [2025-03-17 00:11:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:58,388 INFO L225 Difference]: With dead ends: 4734 [2025-03-17 00:11:58,388 INFO L226 Difference]: Without dead ends: 3616 [2025-03-17 00:11:58,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:11:58,394 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 1087 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:58,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 2155 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-03-17 00:11:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2025-03-17 00:11:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 1521. [2025-03-17 00:11:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1164 states have (on average 1.629725085910653) internal successors, (1897), 1172 states have internal predecessors, (1897), 336 states have call successors, (336), 20 states have call predecessors, (336), 20 states have return successors, (336), 328 states have call predecessors, (336), 336 states have call successors, (336) [2025-03-17 00:11:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2569 transitions. [2025-03-17 00:11:58,574 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2569 transitions. Word has length 355 [2025-03-17 00:11:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:11:58,576 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2569 transitions. [2025-03-17 00:11:58,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2569 transitions. [2025-03-17 00:11:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-17 00:11:58,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:11:58,584 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:11:58,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:11:58,585 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:11:58,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:11:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash -739953970, now seen corresponding path program 1 times [2025-03-17 00:11:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:11:58,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222136191] [2025-03-17 00:11:58,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:11:58,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:11:58,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-17 00:11:58,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-17 00:11:58,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:11:58,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:11:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:11:58,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:11:58,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222136191] [2025-03-17 00:11:58,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222136191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:11:58,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:11:58,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:11:58,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367020527] [2025-03-17 00:11:58,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:11:58,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:11:58,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:11:58,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:11:58,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:11:58,918 INFO L87 Difference]: Start difference. First operand 1521 states and 2569 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:11:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:11:59,801 INFO L93 Difference]: Finished difference Result 2977 states and 5015 transitions. [2025-03-17 00:11:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:11:59,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 355 [2025-03-17 00:11:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:11:59,823 INFO L225 Difference]: With dead ends: 2977 [2025-03-17 00:11:59,824 INFO L226 Difference]: Without dead ends: 2063 [2025-03-17 00:11:59,827 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 00:11:59,828 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 583 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:11:59,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1157 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:11:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-03-17 00:12:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2035. [2025-03-17 00:12:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 1542 states have (on average 1.6186770428015564) internal successors, (2496), 1554 states have internal predecessors, (2496), 463 states have call successors, (463), 29 states have call predecessors, (463), 29 states have return successors, (463), 451 states have call predecessors, (463), 463 states have call successors, (463) [2025-03-17 00:12:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3422 transitions. [2025-03-17 00:12:00,062 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3422 transitions. Word has length 355 [2025-03-17 00:12:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:00,063 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 3422 transitions. [2025-03-17 00:12:00,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3422 transitions. [2025-03-17 00:12:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-17 00:12:00,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:00,067 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:00,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:12:00,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:00,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash 583549044, now seen corresponding path program 1 times [2025-03-17 00:12:00,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:00,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921472959] [2025-03-17 00:12:00,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:00,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-17 00:12:00,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-17 00:12:00,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:00,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:00,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921472959] [2025-03-17 00:12:00,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921472959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:00,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:00,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:12:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216906983] [2025-03-17 00:12:00,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:00,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:12:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:00,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:12:00,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:12:00,878 INFO L87 Difference]: Start difference. First operand 2035 states and 3422 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:01,519 INFO L93 Difference]: Finished difference Result 5035 states and 8531 transitions. [2025-03-17 00:12:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:12:01,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 355 [2025-03-17 00:12:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:01,538 INFO L225 Difference]: With dead ends: 5035 [2025-03-17 00:12:01,538 INFO L226 Difference]: Without dead ends: 3001 [2025-03-17 00:12:01,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:12:01,547 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 332 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:01,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 924 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:12:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2025-03-17 00:12:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2929. [2025-03-17 00:12:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2378 states have (on average 1.6665264928511354) internal successors, (3963), 2390 states have internal predecessors, (3963), 518 states have call successors, (518), 32 states have call predecessors, (518), 32 states have return successors, (518), 506 states have call predecessors, (518), 518 states have call successors, (518) [2025-03-17 00:12:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 4999 transitions. [2025-03-17 00:12:01,854 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 4999 transitions. Word has length 355 [2025-03-17 00:12:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:01,856 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 4999 transitions. [2025-03-17 00:12:01,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 4999 transitions. [2025-03-17 00:12:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-17 00:12:01,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:01,863 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:01,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:12:01,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:01,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:01,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1677097996, now seen corresponding path program 1 times [2025-03-17 00:12:01,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:01,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903953065] [2025-03-17 00:12:01,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:01,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:01,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-17 00:12:01,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-17 00:12:01,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:01,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:02,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903953065] [2025-03-17 00:12:02,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903953065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:02,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:02,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:12:02,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032392912] [2025-03-17 00:12:02,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:02,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:12:02,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:02,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:12:02,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:12:02,292 INFO L87 Difference]: Start difference. First operand 2929 states and 4999 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:02,963 INFO L93 Difference]: Finished difference Result 7285 states and 12280 transitions. [2025-03-17 00:12:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:12:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 357 [2025-03-17 00:12:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:02,993 INFO L225 Difference]: With dead ends: 7285 [2025-03-17 00:12:02,993 INFO L226 Difference]: Without dead ends: 5111 [2025-03-17 00:12:03,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 00:12:03,002 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 362 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:03,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 938 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:12:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5111 states. [2025-03-17 00:12:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5111 to 5023. [2025-03-17 00:12:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5023 states, 3980 states have (on average 1.6319095477386936) internal successors, (6495), 4004 states have internal predecessors, (6495), 981 states have call successors, (981), 61 states have call predecessors, (981), 61 states have return successors, (981), 957 states have call predecessors, (981), 981 states have call successors, (981) [2025-03-17 00:12:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 8457 transitions. [2025-03-17 00:12:03,437 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 8457 transitions. Word has length 357 [2025-03-17 00:12:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:03,438 INFO L471 AbstractCegarLoop]: Abstraction has 5023 states and 8457 transitions. [2025-03-17 00:12:03,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 8457 transitions. [2025-03-17 00:12:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-17 00:12:03,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:03,443 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:03,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:12:03,443 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:03,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:03,444 INFO L85 PathProgramCache]: Analyzing trace with hash 927223695, now seen corresponding path program 1 times [2025-03-17 00:12:03,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:03,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665216504] [2025-03-17 00:12:03,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:03,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-17 00:12:03,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-17 00:12:03,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:03,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:04,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665216504] [2025-03-17 00:12:04,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665216504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:04,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:12:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783871766] [2025-03-17 00:12:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:04,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:12:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:04,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:12:04,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:12:04,015 INFO L87 Difference]: Start difference. First operand 5023 states and 8457 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:05,408 INFO L93 Difference]: Finished difference Result 10549 states and 17687 transitions. [2025-03-17 00:12:05,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:12:05,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 359 [2025-03-17 00:12:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:05,449 INFO L225 Difference]: With dead ends: 10549 [2025-03-17 00:12:05,450 INFO L226 Difference]: Without dead ends: 6312 [2025-03-17 00:12:05,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 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 00:12:05,468 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 492 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:05,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 603 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 00:12:05,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6312 states. [2025-03-17 00:12:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6312 to 4141. [2025-03-17 00:12:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4141 states, 3303 states have (on average 1.6309415682712685) internal successors, (5387), 3319 states have internal predecessors, (5387), 781 states have call successors, (781), 56 states have call predecessors, (781), 56 states have return successors, (781), 765 states have call predecessors, (781), 781 states have call successors, (781) [2025-03-17 00:12:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 6949 transitions. [2025-03-17 00:12:05,972 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 6949 transitions. Word has length 359 [2025-03-17 00:12:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:05,973 INFO L471 AbstractCegarLoop]: Abstraction has 4141 states and 6949 transitions. [2025-03-17 00:12:05,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 6949 transitions. [2025-03-17 00:12:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-17 00:12:05,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:05,978 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:05,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:12:05,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:05,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1379253700, now seen corresponding path program 1 times [2025-03-17 00:12:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:05,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190899909] [2025-03-17 00:12:05,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:06,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-17 00:12:06,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 00:12:06,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:06,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:06,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:06,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190899909] [2025-03-17 00:12:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190899909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:06,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:12:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509061904] [2025-03-17 00:12:06,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:06,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:12:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:06,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:12:06,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:12:06,241 INFO L87 Difference]: Start difference. First operand 4141 states and 6949 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:07,912 INFO L93 Difference]: Finished difference Result 10839 states and 18192 transitions. [2025-03-17 00:12:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:12:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-03-17 00:12:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:07,970 INFO L225 Difference]: With dead ends: 10839 [2025-03-17 00:12:07,970 INFO L226 Difference]: Without dead ends: 8777 [2025-03-17 00:12:07,981 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 00:12:07,983 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 593 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:07,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 842 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:12:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8777 states. [2025-03-17 00:12:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8777 to 4409. [2025-03-17 00:12:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 3571 states have (on average 1.6437972556706806) internal successors, (5870), 3587 states have internal predecessors, (5870), 781 states have call successors, (781), 56 states have call predecessors, (781), 56 states have return successors, (781), 765 states have call predecessors, (781), 781 states have call successors, (781) [2025-03-17 00:12:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 7432 transitions. [2025-03-17 00:12:08,640 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 7432 transitions. Word has length 360 [2025-03-17 00:12:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:08,641 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 7432 transitions. [2025-03-17 00:12:08,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 7432 transitions. [2025-03-17 00:12:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-17 00:12:08,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:08,645 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:08,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:12:08,646 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:08,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1751700070, now seen corresponding path program 1 times [2025-03-17 00:12:08,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:08,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520267601] [2025-03-17 00:12:08,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:08,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:08,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-17 00:12:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 00:12:08,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:08,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:09,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:09,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520267601] [2025-03-17 00:12:09,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520267601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:09,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:12:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835611594] [2025-03-17 00:12:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:09,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:12:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:09,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:12:09,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:12:09,040 INFO L87 Difference]: Start difference. First operand 4409 states and 7432 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:09,729 INFO L93 Difference]: Finished difference Result 7946 states and 13348 transitions. [2025-03-17 00:12:09,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:12:09,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-03-17 00:12:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:09,767 INFO L225 Difference]: With dead ends: 7946 [2025-03-17 00:12:09,767 INFO L226 Difference]: Without dead ends: 5562 [2025-03-17 00:12:09,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:12:09,780 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 323 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:09,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 581 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:12:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2025-03-17 00:12:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4338. [2025-03-17 00:12:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3500 states have (on average 1.6382857142857143) internal successors, (5734), 3516 states have internal predecessors, (5734), 781 states have call successors, (781), 56 states have call predecessors, (781), 56 states have return successors, (781), 765 states have call predecessors, (781), 781 states have call successors, (781) [2025-03-17 00:12:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7296 transitions. [2025-03-17 00:12:10,249 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7296 transitions. Word has length 360 [2025-03-17 00:12:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:10,251 INFO L471 AbstractCegarLoop]: Abstraction has 4338 states and 7296 transitions. [2025-03-17 00:12:10,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7296 transitions. [2025-03-17 00:12:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-17 00:12:10,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:10,255 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:10,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:12:10,256 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1782523003, now seen corresponding path program 1 times [2025-03-17 00:12:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:10,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632986491] [2025-03-17 00:12:10,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:10,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:10,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-17 00:12:10,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 00:12:10,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:10,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:10,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:10,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632986491] [2025-03-17 00:12:10,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632986491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:10,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:10,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:12:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169947421] [2025-03-17 00:12:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:10,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:12:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:10,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:12:10,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:12:10,425 INFO L87 Difference]: Start difference. First operand 4338 states and 7296 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:11,055 INFO L93 Difference]: Finished difference Result 8077 states and 13578 transitions. [2025-03-17 00:12:11,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:12:11,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-03-17 00:12:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:11,090 INFO L225 Difference]: With dead ends: 8077 [2025-03-17 00:12:11,090 INFO L226 Difference]: Without dead ends: 5941 [2025-03-17 00:12:11,099 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 00:12:11,100 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 311 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:11,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 903 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:12:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2025-03-17 00:12:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 5939. [2025-03-17 00:12:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5939 states, 4795 states have (on average 1.6358706986444214) internal successors, (7844), 4817 states have internal predecessors, (7844), 1067 states have call successors, (1067), 76 states have call predecessors, (1067), 76 states have return successors, (1067), 1045 states have call predecessors, (1067), 1067 states have call successors, (1067) [2025-03-17 00:12:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5939 states to 5939 states and 9978 transitions. [2025-03-17 00:12:11,882 INFO L78 Accepts]: Start accepts. Automaton has 5939 states and 9978 transitions. Word has length 360 [2025-03-17 00:12:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:11,883 INFO L471 AbstractCegarLoop]: Abstraction has 5939 states and 9978 transitions. [2025-03-17 00:12:11,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5939 states and 9978 transitions. [2025-03-17 00:12:11,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-17 00:12:11,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:11,890 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:11,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:12:11,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:11,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1410076633, now seen corresponding path program 1 times [2025-03-17 00:12:11,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:11,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209187576] [2025-03-17 00:12:11,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:11,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:11,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-17 00:12:11,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 00:12:11,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:11,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209187576] [2025-03-17 00:12:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209187576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:12,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:12:12,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434483820] [2025-03-17 00:12:12,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:12,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:12:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:12,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:12:12,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:12:12,158 INFO L87 Difference]: Start difference. First operand 5939 states and 9978 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:14,899 INFO L93 Difference]: Finished difference Result 13675 states and 22920 transitions. [2025-03-17 00:12:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:12:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-03-17 00:12:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:14,947 INFO L225 Difference]: With dead ends: 13675 [2025-03-17 00:12:14,948 INFO L226 Difference]: Without dead ends: 10124 [2025-03-17 00:12:14,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:12:14,963 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 1391 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:14,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 1498 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 00:12:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2025-03-17 00:12:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 5947. [2025-03-17 00:12:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5947 states, 4803 states have (on average 1.6352279825109306) internal successors, (7854), 4825 states have internal predecessors, (7854), 1067 states have call successors, (1067), 76 states have call predecessors, (1067), 76 states have return successors, (1067), 1045 states have call predecessors, (1067), 1067 states have call successors, (1067) [2025-03-17 00:12:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5947 states to 5947 states and 9988 transitions. [2025-03-17 00:12:15,708 INFO L78 Accepts]: Start accepts. Automaton has 5947 states and 9988 transitions. Word has length 360 [2025-03-17 00:12:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:15,709 INFO L471 AbstractCegarLoop]: Abstraction has 5947 states and 9988 transitions. [2025-03-17 00:12:15,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5947 states and 9988 transitions. [2025-03-17 00:12:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-17 00:12:15,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:15,714 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:15,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:12:15,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:15,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1774097211, now seen corresponding path program 1 times [2025-03-17 00:12:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:15,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437252424] [2025-03-17 00:12:15,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:15,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:15,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-17 00:12:15,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 00:12:15,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:15,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437252424] [2025-03-17 00:12:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437252424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:16,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:16,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:12:16,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703877502] [2025-03-17 00:12:16,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:16,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:12:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:16,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:12:16,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:12:16,296 INFO L87 Difference]: Start difference. First operand 5947 states and 9988 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:17,615 INFO L93 Difference]: Finished difference Result 12538 states and 21008 transitions. [2025-03-17 00:12:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:12:17,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-03-17 00:12:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:17,650 INFO L225 Difference]: With dead ends: 12538 [2025-03-17 00:12:17,650 INFO L226 Difference]: Without dead ends: 7598 [2025-03-17 00:12:17,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:12:17,664 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 225 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:17,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1057 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:12:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2025-03-17 00:12:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 6091. [2025-03-17 00:12:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6091 states, 4947 states have (on average 1.6284616939559329) internal successors, (8056), 4969 states have internal predecessors, (8056), 1067 states have call successors, (1067), 76 states have call predecessors, (1067), 76 states have return successors, (1067), 1045 states have call predecessors, (1067), 1067 states have call successors, (1067) [2025-03-17 00:12:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6091 states to 6091 states and 10190 transitions. [2025-03-17 00:12:18,571 INFO L78 Accepts]: Start accepts. Automaton has 6091 states and 10190 transitions. Word has length 360 [2025-03-17 00:12:18,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:18,572 INFO L471 AbstractCegarLoop]: Abstraction has 6091 states and 10190 transitions. [2025-03-17 00:12:18,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6091 states and 10190 transitions. [2025-03-17 00:12:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-17 00:12:18,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:18,577 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:18,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:12:18,577 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:18,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2072173446, now seen corresponding path program 1 times [2025-03-17 00:12:18,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:18,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061704219] [2025-03-17 00:12:18,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:18,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:18,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-17 00:12:18,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-17 00:12:18,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:18,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:19,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:19,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061704219] [2025-03-17 00:12:19,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061704219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:19,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:12:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116065811] [2025-03-17 00:12:19,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:19,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:12:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:19,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:12:19,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:12:19,222 INFO L87 Difference]: Start difference. First operand 6091 states and 10190 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:12:21,965 INFO L93 Difference]: Finished difference Result 15575 states and 25918 transitions. [2025-03-17 00:12:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:12:21,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) Word has length 360 [2025-03-17 00:12:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:12:22,014 INFO L225 Difference]: With dead ends: 15575 [2025-03-17 00:12:22,015 INFO L226 Difference]: Without dead ends: 10624 [2025-03-17 00:12:22,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:12:22,031 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 534 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:12:22,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1173 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 00:12:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10624 states. [2025-03-17 00:12:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10624 to 9278. [2025-03-17 00:12:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9278 states, 7372 states have (on average 1.61462289744981) internal successors, (11903), 7402 states have internal predecessors, (11903), 1771 states have call successors, (1771), 134 states have call predecessors, (1771), 134 states have return successors, (1771), 1741 states have call predecessors, (1771), 1771 states have call successors, (1771) [2025-03-17 00:12:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 15445 transitions. [2025-03-17 00:12:23,269 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 15445 transitions. Word has length 360 [2025-03-17 00:12:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:12:23,270 INFO L471 AbstractCegarLoop]: Abstraction has 9278 states and 15445 transitions. [2025-03-17 00:12:23,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 1 states have call predecessors, (55), 1 states have call successors, (55) [2025-03-17 00:12:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 15445 transitions. [2025-03-17 00:12:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-17 00:12:23,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:12:23,284 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:12:23,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 00:12:23,284 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:12:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:12:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1189022032, now seen corresponding path program 1 times [2025-03-17 00:12:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:12:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742321780] [2025-03-17 00:12:23,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:12:23,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:12:23,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-17 00:12:23,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-17 00:12:23,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:12:23,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:12:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2025-03-17 00:12:36,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:12:36,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742321780] [2025-03-17 00:12:36,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742321780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:12:36,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:12:36,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:12:36,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563556717] [2025-03-17 00:12:36,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:12:36,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:12:36,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:12:36,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:12:36,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:12:36,729 INFO L87 Difference]: Start difference. First operand 9278 states and 15445 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 3 states have call successors, (55), 1 states have call predecessors, (55), 1 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55)