./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.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-10_file-81.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 4b9308720d07799738d2bf3272bc150196623be74b0092d021bdb1b9cd368313 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:59:22,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:59:22,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:59:22,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:59:22,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:59:22,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:59:22,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:59:22,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:59:22,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:59:22,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:59:22,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:59:22,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:59:22,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:59:22,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:59:22,214 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:59:22,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:59:22,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:59:22,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:59:22,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:59:22,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:59:22,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:59:22,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:59:22,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:59:22,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:59:22,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:59:22,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:59:22,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:59:22,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:59:22,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:59:22,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:59:22,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:59:22,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:59:22,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:59:22,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:59:22,216 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 -> 4b9308720d07799738d2bf3272bc150196623be74b0092d021bdb1b9cd368313 [2025-03-16 23:59:22,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:59:22,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:59:22,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:59:22,484 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:59:22,484 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:59:22,486 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-10_file-81.i [2025-03-16 23:59:23,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e418a15f/585e53d30051476294d6fb369ea0b052/FLAG14b3160b5 [2025-03-16 23:59:23,885 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:59:23,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.i [2025-03-16 23:59:23,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e418a15f/585e53d30051476294d6fb369ea0b052/FLAG14b3160b5 [2025-03-16 23:59:24,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e418a15f/585e53d30051476294d6fb369ea0b052 [2025-03-16 23:59:24,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:59:24,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:59:24,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:24,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:59:24,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:59:24,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3894cb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24, skipping insertion in model container [2025-03-16 23:59:24,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:59:24,340 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-10_file-81.i[915,928] [2025-03-16 23:59:24,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:24,420 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:59:24,430 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-10_file-81.i[915,928] [2025-03-16 23:59:24,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:24,482 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:59:24,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24 WrapperNode [2025-03-16 23:59:24,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:24,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:24,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:59:24,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:59:24,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,537 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2025-03-16 23:59:24,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:24,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:59:24,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:59:24,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:59:24,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,569 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-16 23:59:24,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:59:24,580 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:59:24,580 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:59:24,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:59:24,581 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (1/1) ... [2025-03-16 23:59:24,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:59:24,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:24,612 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-16 23:59:24,615 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-16 23:59:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:59:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:59:24,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:59:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:59:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:59:24,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:59:24,703 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:59:24,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:59:24,996 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-16 23:59:25,020 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:59:25,020 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:59:25,038 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:59:25,039 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:59:25,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:25 BoogieIcfgContainer [2025-03-16 23:59:25,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:59:25,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:59:25,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:59:25,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:59:25,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:59:24" (1/3) ... [2025-03-16 23:59:25,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cf2f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:25, skipping insertion in model container [2025-03-16 23:59:25,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:24" (2/3) ... [2025-03-16 23:59:25,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cf2f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:25, skipping insertion in model container [2025-03-16 23:59:25,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:25" (3/3) ... [2025-03-16 23:59:25,050 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-81.i [2025-03-16 23:59:25,060 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:59:25,061 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-81.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:59:25,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:59:25,111 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;@5c5aff92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:59:25,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:59:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 23:59:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 23:59:25,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:25,127 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:25,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:25,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1207121332, now seen corresponding path program 1 times [2025-03-16 23:59:25,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:25,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735983624] [2025-03-16 23:59:25,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:25,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 23:59:25,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 23:59:25,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:25,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-16 23:59:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:25,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735983624] [2025-03-16 23:59:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735983624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:59:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433068718] [2025-03-16 23:59:25,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:25,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:59:25,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:25,429 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-16 23:59:25,430 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-16 23:59:25,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 23:59:25,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 23:59:25,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:25,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:25,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:59:25,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-16 23:59:25,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:59:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433068718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:25,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:59:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:59:25,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199327299] [2025-03-16 23:59:25,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:25,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:59:25,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:25,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:59:25,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:59:25,638 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 50 states have internal predecessors, (67), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:59:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:25,666 INFO L93 Difference]: Finished difference Result 167 states and 297 transitions. [2025-03-16 23:59:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:59:25,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2025-03-16 23:59:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:25,672 INFO L225 Difference]: With dead ends: 167 [2025-03-16 23:59:25,672 INFO L226 Difference]: Without dead ends: 83 [2025-03-16 23:59:25,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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-16 23:59:25,676 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:25,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-16 23:59:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-16 23:59:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 23:59:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2025-03-16 23:59:25,708 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 201 [2025-03-16 23:59:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:25,708 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2025-03-16 23:59:25,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:59:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2025-03-16 23:59:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 23:59:25,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:25,711 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:25,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:59:25,915 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-16 23:59:25,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:25,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:25,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1402691635, now seen corresponding path program 1 times [2025-03-16 23:59:25,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:25,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993636867] [2025-03-16 23:59:25,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:25,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:25,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 23:59:26,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 23:59:26,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:26,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-16 23:59:26,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:26,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993636867] [2025-03-16 23:59:26,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993636867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:26,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:26,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:59:26,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623620346] [2025-03-16 23:59:26,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:26,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:59:26,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:26,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:59:26,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:59:26,465 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-16 23:59:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:26,565 INFO L93 Difference]: Finished difference Result 199 states and 305 transitions. [2025-03-16 23:59:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:59:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2025-03-16 23:59:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:26,570 INFO L225 Difference]: With dead ends: 199 [2025-03-16 23:59:26,570 INFO L226 Difference]: Without dead ends: 117 [2025-03-16 23:59:26,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:59:26,572 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 41 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:26,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 369 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:59:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-16 23:59:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2025-03-16 23:59:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 74 states have (on average 1.337837837837838) internal successors, (99), 75 states have internal predecessors, (99), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-16 23:59:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 173 transitions. [2025-03-16 23:59:26,593 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 173 transitions. Word has length 201 [2025-03-16 23:59:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:26,594 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 173 transitions. [2025-03-16 23:59:26,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-16 23:59:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 173 transitions. [2025-03-16 23:59:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 23:59:26,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:26,596 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:26,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:59:26,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:26,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:26,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1206178130, now seen corresponding path program 1 times [2025-03-16 23:59:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:26,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796482997] [2025-03-16 23:59:26,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:26,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 23:59:26,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 23:59:26,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:26,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-16 23:59:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:35,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796482997] [2025-03-16 23:59:35,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796482997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:35,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:35,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 23:59:35,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322803838] [2025-03-16 23:59:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:35,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 23:59:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:35,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 23:59:35,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:59:35,800 INFO L87 Difference]: Start difference. First operand 114 states and 173 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:59:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:37,452 INFO L93 Difference]: Finished difference Result 415 states and 616 transitions. [2025-03-16 23:59:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:59:37,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2025-03-16 23:59:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:37,456 INFO L225 Difference]: With dead ends: 415 [2025-03-16 23:59:37,456 INFO L226 Difference]: Without dead ends: 302 [2025-03-16 23:59:37,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2025-03-16 23:59:37,460 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 554 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:37,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 691 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:59:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-16 23:59:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 185. [2025-03-16 23:59:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-16 23:59:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 284 transitions. [2025-03-16 23:59:37,497 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 284 transitions. Word has length 201 [2025-03-16 23:59:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:37,498 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 284 transitions. [2025-03-16 23:59:37,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:59:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2025-03-16 23:59:37,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 23:59:37,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:37,504 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:37,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:59:37,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:37,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1291837807, now seen corresponding path program 1 times [2025-03-16 23:59:37,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:37,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671842097] [2025-03-16 23:59:37,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:37,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 23:59:37,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 23:59:37,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:37,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-16 23:59:43,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:43,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671842097] [2025-03-16 23:59:43,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671842097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:43,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:43,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:59:43,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597986770] [2025-03-16 23:59:43,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:43,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:59:43,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:43,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:59:43,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:59:43,555 INFO L87 Difference]: Start difference. First operand 185 states and 284 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-16 23:59:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:45,813 INFO L93 Difference]: Finished difference Result 404 states and 602 transitions. [2025-03-16 23:59:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 23:59:45,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2025-03-16 23:59:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:45,815 INFO L225 Difference]: With dead ends: 404 [2025-03-16 23:59:45,816 INFO L226 Difference]: Without dead ends: 291 [2025-03-16 23:59:45,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-16 23:59:45,817 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 424 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:45,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 590 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:59:45,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-16 23:59:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 185. [2025-03-16 23:59:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-16 23:59:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 284 transitions. [2025-03-16 23:59:45,837 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 284 transitions. Word has length 201 [2025-03-16 23:59:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:45,837 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 284 transitions. [2025-03-16 23:59:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-16 23:59:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2025-03-16 23:59:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 23:59:45,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:45,839 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:45,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:59:45,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:45,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1077095411, now seen corresponding path program 1 times [2025-03-16 23:59:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760125279] [2025-03-16 23:59:45,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:45,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 23:59:45,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 23:59:45,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:45,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-16 23:59:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760125279] [2025-03-16 23:59:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760125279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:46,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:46,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:59:46,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829655074] [2025-03-16 23:59:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:46,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:59:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:46,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:59:46,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:59:46,688 INFO L87 Difference]: Start difference. First operand 185 states and 284 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:59:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:47,487 INFO L93 Difference]: Finished difference Result 385 states and 582 transitions. [2025-03-16 23:59:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:59:47,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2025-03-16 23:59:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:47,489 INFO L225 Difference]: With dead ends: 385 [2025-03-16 23:59:47,489 INFO L226 Difference]: Without dead ends: 272 [2025-03-16 23:59:47,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:59:47,490 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 194 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:47,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 690 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:59:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-16 23:59:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 191. [2025-03-16 23:59:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 117 states have (on average 1.2905982905982907) internal successors, (151), 118 states have internal predecessors, (151), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-16 23:59:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 291 transitions. [2025-03-16 23:59:47,505 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 291 transitions. Word has length 201 [2025-03-16 23:59:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:47,505 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 291 transitions. [2025-03-16 23:59:47,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-16 23:59:47,506 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 291 transitions. [2025-03-16 23:59:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 23:59:47,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:47,507 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:47,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:59:47,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:47,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1711736755, now seen corresponding path program 1 times [2025-03-16 23:59:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757573319] [2025-03-16 23:59:47,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:47,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 23:59:47,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 23:59:47,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:47,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-16 23:59:53,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:53,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757573319] [2025-03-16 23:59:53,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757573319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:53,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:53,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:59:53,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622190891] [2025-03-16 23:59:53,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:53,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:59:53,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:53,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:59:53,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:59:53,375 INFO L87 Difference]: Start difference. First operand 191 states and 291 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-16 23:59:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:53,813 INFO L93 Difference]: Finished difference Result 373 states and 554 transitions. [2025-03-16 23:59:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:59:53,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2025-03-16 23:59:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:53,815 INFO L225 Difference]: With dead ends: 373 [2025-03-16 23:59:53,815 INFO L226 Difference]: Without dead ends: 260 [2025-03-16 23:59:53,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:59:53,816 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 165 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:53,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 512 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:59:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-16 23:59:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 192. [2025-03-16 23:59:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 119 states have internal predecessors, (153), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-16 23:59:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 293 transitions. [2025-03-16 23:59:53,830 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 293 transitions. Word has length 201 [2025-03-16 23:59:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:53,830 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 293 transitions. [2025-03-16 23:59:53,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-16 23:59:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 293 transitions. [2025-03-16 23:59:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 23:59:53,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:53,832 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:53,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:59:53,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:53,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 786279182, now seen corresponding path program 1 times [2025-03-16 23:59:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:53,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364599808] [2025-03-16 23:59:53,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:53,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:53,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 23:59:53,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 23:59:53,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:53,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:00:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364599808] [2025-03-17 00:00:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364599808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:01,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:01,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:00:01,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732872108] [2025-03-17 00:00:01,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:01,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:00:01,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:01,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:00:01,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:00:01,796 INFO L87 Difference]: Start difference. First operand 192 states and 293 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:02,476 INFO L93 Difference]: Finished difference Result 354 states and 530 transitions. [2025-03-17 00:00:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:00:02,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2025-03-17 00:00:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:02,480 INFO L225 Difference]: With dead ends: 354 [2025-03-17 00:00:02,480 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 00:00:02,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:00:02,480 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 87 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:02,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 571 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:00:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 00:00:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 189. [2025-03-17 00:00:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 116 states have internal predecessors, (149), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:00:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 289 transitions. [2025-03-17 00:00:02,503 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 289 transitions. Word has length 201 [2025-03-17 00:00:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:02,506 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 289 transitions. [2025-03-17 00:00:02,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 289 transitions. [2025-03-17 00:00:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:00:02,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:02,507 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:02,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:00:02,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:02,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash 779125309, now seen corresponding path program 1 times [2025-03-17 00:00:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:02,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974631400] [2025-03-17 00:00:02,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:02,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:00:02,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:00:02,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:02,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:00:09,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974631400] [2025-03-17 00:00:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974631400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:09,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:09,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:00:09,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841316414] [2025-03-17 00:00:09,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:09,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:00:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:09,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:00:09,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:00:09,553 INFO L87 Difference]: Start difference. First operand 189 states and 289 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:10,183 INFO L93 Difference]: Finished difference Result 437 states and 651 transitions. [2025-03-17 00:00:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:00:10,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-03-17 00:00:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:10,186 INFO L225 Difference]: With dead ends: 437 [2025-03-17 00:00:10,186 INFO L226 Difference]: Without dead ends: 314 [2025-03-17 00:00:10,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:00:10,187 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 230 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:10,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 636 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:00:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-17 00:00:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 202. [2025-03-17 00:00:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 128 states have (on average 1.3203125) internal successors, (169), 129 states have internal predecessors, (169), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:00:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 309 transitions. [2025-03-17 00:00:10,202 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 309 transitions. Word has length 202 [2025-03-17 00:00:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:10,203 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 309 transitions. [2025-03-17 00:00:10,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 309 transitions. [2025-03-17 00:00:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:00:10,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:10,204 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:10,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:00:10,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:10,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:10,204 INFO L85 PathProgramCache]: Analyzing trace with hash 975638814, now seen corresponding path program 1 times [2025-03-17 00:00:10,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:10,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027117893] [2025-03-17 00:00:10,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:10,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:10,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:00:10,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:00:10,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:10,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:00:13,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027117893] [2025-03-17 00:00:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027117893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:13,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:13,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:00:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850348065] [2025-03-17 00:00:13,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:13,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:00:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:13,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:00:13,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:00:13,643 INFO L87 Difference]: Start difference. First operand 202 states and 309 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:14,767 INFO L93 Difference]: Finished difference Result 536 states and 790 transitions. [2025-03-17 00:00:14,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:00:14,768 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-03-17 00:00:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:14,771 INFO L225 Difference]: With dead ends: 536 [2025-03-17 00:00:14,771 INFO L226 Difference]: Without dead ends: 400 [2025-03-17 00:00:14,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:00:14,773 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 468 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:14,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 639 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:00:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-17 00:00:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 206. [2025-03-17 00:00:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 133 states have internal predecessors, (175), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:00:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 315 transitions. [2025-03-17 00:00:14,791 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 315 transitions. Word has length 202 [2025-03-17 00:00:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:14,792 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 315 transitions. [2025-03-17 00:00:14,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 315 transitions. [2025-03-17 00:00:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:00:14,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:14,794 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:14,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:00:14,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:14,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1017826050, now seen corresponding path program 1 times [2025-03-17 00:00:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:14,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782361609] [2025-03-17 00:00:14,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:14,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:00:14,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:00:14,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:14,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:00:22,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:22,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782361609] [2025-03-17 00:00:22,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782361609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:22,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:22,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:00:22,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499469518] [2025-03-17 00:00:22,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:22,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:00:22,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:22,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:00:22,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:00:22,066 INFO L87 Difference]: Start difference. First operand 206 states and 315 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:22,860 INFO L93 Difference]: Finished difference Result 434 states and 649 transitions. [2025-03-17 00:00:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:00:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-03-17 00:00:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:22,862 INFO L225 Difference]: With dead ends: 434 [2025-03-17 00:00:22,863 INFO L226 Difference]: Without dead ends: 298 [2025-03-17 00:00:22,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:00:22,863 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 107 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:22,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 648 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:00:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-17 00:00:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 206. [2025-03-17 00:00:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 133 states have internal predecessors, (175), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:00:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 315 transitions. [2025-03-17 00:00:22,878 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 315 transitions. Word has length 202 [2025-03-17 00:00:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:22,879 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 315 transitions. [2025-03-17 00:00:22,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 315 transitions. [2025-03-17 00:00:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:00:22,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:22,880 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:22,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:00:22,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:22,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -821312545, now seen corresponding path program 1 times [2025-03-17 00:00:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:22,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735189821] [2025-03-17 00:00:22,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:22,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:00:22,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:00:22,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:22,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:00:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:26,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735189821] [2025-03-17 00:00:26,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735189821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:26,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:26,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:00:26,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834889560] [2025-03-17 00:00:26,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:26,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:00:26,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:26,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:00:26,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:00:26,977 INFO L87 Difference]: Start difference. First operand 206 states and 315 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:31,441 INFO L93 Difference]: Finished difference Result 512 states and 750 transitions. [2025-03-17 00:00:31,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 00:00:31,442 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-03-17 00:00:31,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:31,444 INFO L225 Difference]: With dead ends: 512 [2025-03-17 00:00:31,444 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 00:00:31,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-03-17 00:00:31,446 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 411 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:31,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 651 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 00:00:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 00:00:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 206. [2025-03-17 00:00:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 133 states have internal predecessors, (175), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:00:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 315 transitions. [2025-03-17 00:00:31,464 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 315 transitions. Word has length 202 [2025-03-17 00:00:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:31,464 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 315 transitions. [2025-03-17 00:00:31,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 315 transitions. [2025-03-17 00:00:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:00:31,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:31,466 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:31,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:00:31,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:31,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:31,468 INFO L85 PathProgramCache]: Analyzing trace with hash 470080189, now seen corresponding path program 1 times [2025-03-17 00:00:31,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:31,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611007661] [2025-03-17 00:00:31,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:31,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:31,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:00:31,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:00:31,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:00:35,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:35,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611007661] [2025-03-17 00:00:35,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611007661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:35,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:35,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:00:35,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518263560] [2025-03-17 00:00:35,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:35,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:00:35,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:35,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:00:35,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:00:35,788 INFO L87 Difference]: Start difference. First operand 206 states and 315 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:36,266 INFO L93 Difference]: Finished difference Result 457 states and 677 transitions. [2025-03-17 00:00:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:00:36,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-03-17 00:00:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:36,269 INFO L225 Difference]: With dead ends: 457 [2025-03-17 00:00:36,269 INFO L226 Difference]: Without dead ends: 321 [2025-03-17 00:00:36,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:00:36,271 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 200 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:36,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 514 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:00:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-17 00:00:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 206. [2025-03-17 00:00:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 133 states have internal predecessors, (175), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:00:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 315 transitions. [2025-03-17 00:00:36,288 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 315 transitions. Word has length 202 [2025-03-17 00:00:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:36,290 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 315 transitions. [2025-03-17 00:00:36,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 315 transitions. [2025-03-17 00:00:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:00:36,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:36,291 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:36,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:00:36,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:36,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:36,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1326871170, now seen corresponding path program 1 times [2025-03-17 00:00:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:36,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149461012] [2025-03-17 00:00:36,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:36,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:00:36,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:00:36,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:36,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:00:41,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149461012] [2025-03-17 00:00:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149461012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:41,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:00:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781020230] [2025-03-17 00:00:41,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:41,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:00:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:41,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:00:41,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:00:41,865 INFO L87 Difference]: Start difference. First operand 206 states and 315 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:42,754 INFO L93 Difference]: Finished difference Result 435 states and 651 transitions. [2025-03-17 00:00:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:00:42,754 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-03-17 00:00:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:42,756 INFO L225 Difference]: With dead ends: 435 [2025-03-17 00:00:42,756 INFO L226 Difference]: Without dead ends: 298 [2025-03-17 00:00:42,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-17 00:00:42,757 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 251 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:42,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 530 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:00:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-17 00:00:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 204. [2025-03-17 00:00:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 131 states have internal predecessors, (173), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:00:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2025-03-17 00:00:42,777 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 202 [2025-03-17 00:00:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:42,777 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2025-03-17 00:00:42,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2025-03-17 00:00:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:00:42,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:42,779 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:42,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:00:42,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:42,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2008290178, now seen corresponding path program 1 times [2025-03-17 00:00:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462005363] [2025-03-17 00:00:42,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:42,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:00:42,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:00:42,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:42,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:00:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462005363] [2025-03-17 00:00:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462005363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:00:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622907996] [2025-03-17 00:00:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:48,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:00:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:48,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:00:48,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:00:48,247 INFO L87 Difference]: Start difference. First operand 204 states and 313 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:48,734 INFO L93 Difference]: Finished difference Result 456 states and 682 transitions. [2025-03-17 00:00:48,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:00:48,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-03-17 00:00:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:48,737 INFO L225 Difference]: With dead ends: 456 [2025-03-17 00:00:48,737 INFO L226 Difference]: Without dead ends: 319 [2025-03-17 00:00:48,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:00:48,738 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 240 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:48,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 541 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:00:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-17 00:00:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 205. [2025-03-17 00:00:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 132 states have internal predecessors, (175), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 00:00:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 315 transitions. [2025-03-17 00:00:48,753 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 315 transitions. Word has length 202 [2025-03-17 00:00:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:48,754 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 315 transitions. [2025-03-17 00:00:48,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 315 transitions. [2025-03-17 00:00:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:00:48,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:48,755 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:48,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:00:48,755 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:48,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1811776673, now seen corresponding path program 1 times [2025-03-17 00:00:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:48,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81115603] [2025-03-17 00:00:48,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:48,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:48,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:00:48,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:00:48,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:48,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-17 00:00:48,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:00:48,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81115603] [2025-03-17 00:00:48,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81115603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:48,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:48,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:00:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670522199] [2025-03-17 00:00:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:48,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:00:48,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:00:48,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:00:48,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:00:48,891 INFO L87 Difference]: Start difference. First operand 205 states and 315 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:48,949 INFO L93 Difference]: Finished difference Result 371 states and 559 transitions. [2025-03-17 00:00:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:00:48,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-03-17 00:00:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:48,952 INFO L225 Difference]: With dead ends: 371 [2025-03-17 00:00:48,952 INFO L226 Difference]: Without dead ends: 233 [2025-03-17 00:00:48,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:00:48,953 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 58 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:48,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 370 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:00:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-17 00:00:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2025-03-17 00:00:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 123 states have internal predecessors, (163), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 00:00:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 295 transitions. [2025-03-17 00:00:48,968 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 295 transitions. Word has length 202 [2025-03-17 00:00:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:48,969 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 295 transitions. [2025-03-17 00:00:48,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-17 00:00:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 295 transitions. [2025-03-17 00:00:48,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 00:00:48,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:48,970 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:48,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:00:48,970 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:48,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:48,970 INFO L85 PathProgramCache]: Analyzing trace with hash 489725759, now seen corresponding path program 1 times [2025-03-17 00:00:48,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:00:48,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784992438] [2025-03-17 00:00:48,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:00:48,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 00:00:48,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 00:00:48,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:48,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat