./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.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_codestructure_normal_file-86.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 a9741d9253f3a1c34b363b1f78a0a60d9588ccafe85a5c037fb56edb8bf20d1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:14:17,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:14:17,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:14:17,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:14:17,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:14:17,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:14:17,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:14:17,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:14:17,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:14:17,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:14:17,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:14:17,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:14:17,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:14:17,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:14:17,091 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:14:17,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:14:17,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:14:17,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:14:17,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:14:17,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:14:17,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:14:17,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:14:17,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:14:17,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:14:17,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:14:17,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:14:17,093 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:14:17,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:14:17,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:14:17,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:14:17,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:14:17,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:14:17,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:14:17,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:14:17,094 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 -> a9741d9253f3a1c34b363b1f78a0a60d9588ccafe85a5c037fb56edb8bf20d1f [2025-03-16 23:14:17,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:14:17,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:14:17,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:14:17,294 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:14:17,296 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:14:17,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.i [2025-03-16 23:14:18,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/839e56f85/43e6659ecb0140dc80df1675743990e5/FLAGfdc699a56 [2025-03-16 23:14:18,669 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:14:18,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-86.i [2025-03-16 23:14:18,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/839e56f85/43e6659ecb0140dc80df1675743990e5/FLAGfdc699a56 [2025-03-16 23:14:19,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/839e56f85/43e6659ecb0140dc80df1675743990e5 [2025-03-16 23:14:19,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:14:19,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:14:19,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:14:19,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:14:19,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:14:19,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4ad49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19, skipping insertion in model container [2025-03-16 23:14:19,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:14:19,121 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_codestructure_normal_file-86.i[913,926] [2025-03-16 23:14:19,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:14:19,186 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:14:19,196 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_codestructure_normal_file-86.i[913,926] [2025-03-16 23:14:19,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:14:19,240 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:14:19,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19 WrapperNode [2025-03-16 23:14:19,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:14:19,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:14:19,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:14:19,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:14:19,247 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:14:19" (1/1) ... [2025-03-16 23:14:19,255 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:14:19" (1/1) ... [2025-03-16 23:14:19,289 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2025-03-16 23:14:19,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:14:19,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:14:19,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:14:19,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:14:19,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,321 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:14:19,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:14:19,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:14:19,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:14:19,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:14:19,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (1/1) ... [2025-03-16 23:14:19,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:14:19,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:14:19,369 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:14:19,372 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:14:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:14:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:14:19,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:14:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:14:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:14:19,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:14:19,450 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:14:19,452 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:14:19,702 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:14:19,702 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:14:19,711 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:14:19,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:14:19,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:14:19 BoogieIcfgContainer [2025-03-16 23:14:19,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:14:19,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:14:19,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:14:19,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:14:19,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:14:19" (1/3) ... [2025-03-16 23:14:19,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee2c0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:14:19, skipping insertion in model container [2025-03-16 23:14:19,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:14:19" (2/3) ... [2025-03-16 23:14:19,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee2c0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:14:19, skipping insertion in model container [2025-03-16 23:14:19,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:14:19" (3/3) ... [2025-03-16 23:14:19,722 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-86.i [2025-03-16 23:14:19,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:14:19,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-86.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:14:19,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:14:19,790 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;@73c2b043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:14:19,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:14:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-16 23:14:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 23:14:19,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:19,806 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:19,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:19,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash -673381337, now seen corresponding path program 1 times [2025-03-16 23:14:19,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:19,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433434309] [2025-03-16 23:14:19,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:19,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:19,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 23:14:19,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 23:14:19,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:19,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-16 23:14:20,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433434309] [2025-03-16 23:14:20,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433434309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:14:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105321076] [2025-03-16 23:14:20,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:20,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:14:20,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:14:20,075 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:14:20,076 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:14:20,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 23:14:20,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 23:14:20,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:20,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:20,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:14:20,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:14:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-16 23:14:20,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:14:20,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105321076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:20,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:14:20,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:14:20,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423791756] [2025-03-16 23:14:20,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:20,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:14:20,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:20,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:14:20,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:14:20,271 INFO L87 Difference]: Start difference. First operand has 69 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 23:14:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:14:20,291 INFO L93 Difference]: Finished difference Result 135 states and 251 transitions. [2025-03-16 23:14:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:14:20,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 181 [2025-03-16 23:14:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:14:20,297 INFO L225 Difference]: With dead ends: 135 [2025-03-16 23:14:20,297 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 23:14:20,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 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:14:20,302 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:14:20,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:14:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 23:14:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-16 23:14:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-16 23:14:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2025-03-16 23:14:20,330 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 181 [2025-03-16 23:14:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:14:20,331 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2025-03-16 23:14:20,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-16 23:14:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2025-03-16 23:14:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 23:14:20,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:20,333 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:20,340 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:14:20,534 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:14:20,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:20,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1886978138, now seen corresponding path program 1 times [2025-03-16 23:14:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:20,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938204646] [2025-03-16 23:14:20,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:20,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 23:14:20,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 23:14:20,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:14:28,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:28,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938204646] [2025-03-16 23:14:28,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938204646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:28,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:14:28,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 23:14:28,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945765370] [2025-03-16 23:14:28,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:28,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 23:14:28,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:28,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 23:14:28,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 23:14:28,737 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:14:29,995 INFO L93 Difference]: Finished difference Result 170 states and 265 transitions. [2025-03-16 23:14:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 23:14:29,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 181 [2025-03-16 23:14:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:14:30,000 INFO L225 Difference]: With dead ends: 170 [2025-03-16 23:14:30,000 INFO L226 Difference]: Without dead ends: 104 [2025-03-16 23:14:30,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:14:30,001 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 89 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:14:30,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 338 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:14:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-16 23:14:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2025-03-16 23:14:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-16 23:14:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 119 transitions. [2025-03-16 23:14:30,015 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 119 transitions. Word has length 181 [2025-03-16 23:14:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:14:30,016 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 119 transitions. [2025-03-16 23:14:30,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 119 transitions. [2025-03-16 23:14:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 23:14:30,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:30,019 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:30,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:14:30,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:30,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:30,020 INFO L85 PathProgramCache]: Analyzing trace with hash -144167803, now seen corresponding path program 1 times [2025-03-16 23:14:30,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:30,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395780328] [2025-03-16 23:14:30,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:30,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:30,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 23:14:30,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 23:14:30,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:30,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:14:30,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:30,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395780328] [2025-03-16 23:14:30,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395780328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:30,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:14:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:14:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875655273] [2025-03-16 23:14:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:30,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:14:30,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:30,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:14:30,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:14:30,080 INFO L87 Difference]: Start difference. First operand 75 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:14:30,102 INFO L93 Difference]: Finished difference Result 175 states and 274 transitions. [2025-03-16 23:14:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:14:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 181 [2025-03-16 23:14:30,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:14:30,105 INFO L225 Difference]: With dead ends: 175 [2025-03-16 23:14:30,106 INFO L226 Difference]: Without dead ends: 101 [2025-03-16 23:14:30,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:14:30,108 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 42 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:14:30,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 243 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:14:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-16 23:14:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2025-03-16 23:14:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:14:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 153 transitions. [2025-03-16 23:14:30,124 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 153 transitions. Word has length 181 [2025-03-16 23:14:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:14:30,124 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 153 transitions. [2025-03-16 23:14:30,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2025-03-16 23:14:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:14:30,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:30,126 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:30,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:14:30,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:30,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1636051967, now seen corresponding path program 1 times [2025-03-16 23:14:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:30,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31494559] [2025-03-16 23:14:30,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:30,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:14:30,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:14:30,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:30,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:14:33,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:33,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31494559] [2025-03-16 23:14:33,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31494559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:33,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:14:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:14:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316904062] [2025-03-16 23:14:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:33,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:14:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:33,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:14:33,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:14:33,026 INFO L87 Difference]: Start difference. First operand 98 states and 153 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:14:34,248 INFO L93 Difference]: Finished difference Result 155 states and 230 transitions. [2025-03-16 23:14:34,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:14:34,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:14:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:14:34,251 INFO L225 Difference]: With dead ends: 155 [2025-03-16 23:14:34,252 INFO L226 Difference]: Without dead ends: 153 [2025-03-16 23:14:34,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:14:34,253 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 73 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:14:34,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 424 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 23:14:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-16 23:14:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 104. [2025-03-16 23:14:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 63 states have internal predecessors, (86), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:14:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 164 transitions. [2025-03-16 23:14:34,264 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 164 transitions. Word has length 182 [2025-03-16 23:14:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:14:34,265 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 164 transitions. [2025-03-16 23:14:34,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2025-03-16 23:14:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:14:34,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:34,267 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:34,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:14:34,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:34,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1636081758, now seen corresponding path program 1 times [2025-03-16 23:14:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116898606] [2025-03-16 23:14:34,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:34,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:14:34,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:14:34,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:34,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:14:36,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:36,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116898606] [2025-03-16 23:14:36,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116898606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:36,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:14:36,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:14:36,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318812537] [2025-03-16 23:14:36,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:36,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:14:36,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:36,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:14:36,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:14:36,968 INFO L87 Difference]: Start difference. First operand 104 states and 164 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:14:37,571 INFO L93 Difference]: Finished difference Result 153 states and 228 transitions. [2025-03-16 23:14:37,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:14:37,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:14:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:14:37,574 INFO L225 Difference]: With dead ends: 153 [2025-03-16 23:14:37,574 INFO L226 Difference]: Without dead ends: 151 [2025-03-16 23:14:37,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:14:37,575 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 108 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:14:37,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 294 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:14:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-16 23:14:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2025-03-16 23:14:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 63 states have internal predecessors, (86), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:14:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 164 transitions. [2025-03-16 23:14:37,590 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 164 transitions. Word has length 182 [2025-03-16 23:14:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:14:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 164 transitions. [2025-03-16 23:14:37,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 164 transitions. [2025-03-16 23:14:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:14:37,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:37,595 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:37,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:14:37,595 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:37,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1723756671, now seen corresponding path program 1 times [2025-03-16 23:14:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:37,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092886804] [2025-03-16 23:14:37,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:37,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:14:37,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:14:37,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:37,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:14:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092886804] [2025-03-16 23:14:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092886804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:43,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:14:43,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:14:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887313707] [2025-03-16 23:14:43,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:43,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:14:43,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:43,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:14:43,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:14:43,558 INFO L87 Difference]: Start difference. First operand 104 states and 164 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:14:46,237 INFO L93 Difference]: Finished difference Result 137 states and 202 transitions. [2025-03-16 23:14:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:14:46,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:14:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:14:46,239 INFO L225 Difference]: With dead ends: 137 [2025-03-16 23:14:46,239 INFO L226 Difference]: Without dead ends: 135 [2025-03-16 23:14:46,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:14:46,240 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 110 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:14:46,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 392 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:14:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-16 23:14:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 105. [2025-03-16 23:14:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:14:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 166 transitions. [2025-03-16 23:14:46,251 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 166 transitions. Word has length 182 [2025-03-16 23:14:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:14:46,252 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 166 transitions. [2025-03-16 23:14:46,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 166 transitions. [2025-03-16 23:14:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:14:46,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:46,255 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:46,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:14:46,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:46,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1724680192, now seen corresponding path program 1 times [2025-03-16 23:14:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:46,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981820110] [2025-03-16 23:14:46,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:46,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:46,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:14:46,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:14:46,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:46,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:14:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981820110] [2025-03-16 23:14:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981820110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:48,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:14:48,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:14:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446264853] [2025-03-16 23:14:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:48,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:14:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:48,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:14:48,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:14:48,321 INFO L87 Difference]: Start difference. First operand 105 states and 166 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:14:48,664 INFO L93 Difference]: Finished difference Result 160 states and 238 transitions. [2025-03-16 23:14:48,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:14:48,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:14:48,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:14:48,667 INFO L225 Difference]: With dead ends: 160 [2025-03-16 23:14:48,667 INFO L226 Difference]: Without dead ends: 158 [2025-03-16 23:14:48,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:14:48,667 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 101 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:14:48,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 308 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:14:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-16 23:14:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 106. [2025-03-16 23:14:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.40625) internal successors, (90), 65 states have internal predecessors, (90), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:14:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 168 transitions. [2025-03-16 23:14:48,683 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 168 transitions. Word has length 182 [2025-03-16 23:14:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:14:48,683 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 168 transitions. [2025-03-16 23:14:48,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 168 transitions. [2025-03-16 23:14:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:14:48,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:48,688 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:14:48,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:48,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash 250853529, now seen corresponding path program 1 times [2025-03-16 23:14:48,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:48,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857786443] [2025-03-16 23:14:48,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:48,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:48,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:14:48,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:14:48,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:48,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:14:50,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857786443] [2025-03-16 23:14:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857786443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:14:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:14:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370151794] [2025-03-16 23:14:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:50,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:14:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:50,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:14:50,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:14:50,369 INFO L87 Difference]: Start difference. First operand 106 states and 168 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:14:50,898 INFO L93 Difference]: Finished difference Result 167 states and 249 transitions. [2025-03-16 23:14:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:14:50,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:14:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:14:50,900 INFO L225 Difference]: With dead ends: 167 [2025-03-16 23:14:50,900 INFO L226 Difference]: Without dead ends: 165 [2025-03-16 23:14:50,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:14:50,901 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 110 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:14:50,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 365 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:14:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-16 23:14:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 109. [2025-03-16 23:14:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:14:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 173 transitions. [2025-03-16 23:14:50,912 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 173 transitions. Word has length 182 [2025-03-16 23:14:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:14:50,914 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 173 transitions. [2025-03-16 23:14:50,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 173 transitions. [2025-03-16 23:14:50,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:14:50,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:50,915 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:50,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:14:50,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:50,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1138357210, now seen corresponding path program 1 times [2025-03-16 23:14:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:50,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061216617] [2025-03-16 23:14:50,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:50,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:14:50,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:14:50,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:50,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:14:53,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:53,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061216617] [2025-03-16 23:14:53,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061216617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:53,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:14:53,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:14:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799107276] [2025-03-16 23:14:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:53,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:14:53,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:53,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:14:53,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:14:53,195 INFO L87 Difference]: Start difference. First operand 109 states and 173 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:14:53,892 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2025-03-16 23:14:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:14:53,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:14:53,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:14:53,896 INFO L225 Difference]: With dead ends: 276 [2025-03-16 23:14:53,896 INFO L226 Difference]: Without dead ends: 168 [2025-03-16 23:14:53,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:14:53,897 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 93 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:14:53,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 388 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:14:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-16 23:14:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 115. [2025-03-16 23:14:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:14:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 183 transitions. [2025-03-16 23:14:53,907 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 183 transitions. Word has length 182 [2025-03-16 23:14:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:14:53,907 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 183 transitions. [2025-03-16 23:14:53,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:14:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 183 transitions. [2025-03-16 23:14:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:14:53,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:14:53,909 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:53,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:14:53,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:14:53,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:14:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash -914866692, now seen corresponding path program 1 times [2025-03-16 23:14:53,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:14:53,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302954107] [2025-03-16 23:14:53,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:14:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:14:53,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:14:53,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:14:53,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:14:53,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:14:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:14:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:14:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302954107] [2025-03-16 23:14:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302954107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:14:58,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:14:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:14:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455079818] [2025-03-16 23:14:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:14:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:14:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:14:58,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:14:58,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:14:58,923 INFO L87 Difference]: Start difference. First operand 115 states and 183 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:01,162 INFO L93 Difference]: Finished difference Result 177 states and 267 transitions. [2025-03-16 23:15:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:15:01,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:15:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:01,164 INFO L225 Difference]: With dead ends: 177 [2025-03-16 23:15:01,164 INFO L226 Difference]: Without dead ends: 175 [2025-03-16 23:15:01,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:01,165 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 92 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:01,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 525 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:15:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-16 23:15:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 122. [2025-03-16 23:15:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2025-03-16 23:15:01,172 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 182 [2025-03-16 23:15:01,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:01,172 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2025-03-16 23:15:01,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2025-03-16 23:15:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:15:01,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:01,174 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:01,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 23:15:01,174 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:01,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:01,174 INFO L85 PathProgramCache]: Analyzing trace with hash -943495843, now seen corresponding path program 1 times [2025-03-16 23:15:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:01,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825545353] [2025-03-16 23:15:01,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:01,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:01,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:15:01,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:15:01,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:01,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:03,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:03,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825545353] [2025-03-16 23:15:03,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825545353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:03,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:03,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:15:03,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417770888] [2025-03-16 23:15:03,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:03,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:15:03,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:03,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:15:03,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:15:03,982 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:04,984 INFO L93 Difference]: Finished difference Result 180 states and 271 transitions. [2025-03-16 23:15:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:15:04,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:15:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:04,986 INFO L225 Difference]: With dead ends: 180 [2025-03-16 23:15:04,986 INFO L226 Difference]: Without dead ends: 178 [2025-03-16 23:15:04,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:15:04,987 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 89 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:04,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 547 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:15:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-16 23:15:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 122. [2025-03-16 23:15:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2025-03-16 23:15:04,994 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 182 [2025-03-16 23:15:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:04,995 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2025-03-16 23:15:04,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2025-03-16 23:15:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:15:04,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:04,996 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:04,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 23:15:04,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:04,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1439538462, now seen corresponding path program 1 times [2025-03-16 23:15:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:04,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040625494] [2025-03-16 23:15:04,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:05,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:15:05,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:15:05,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:05,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:06,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:06,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040625494] [2025-03-16 23:15:06,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040625494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:06,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:06,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:15:06,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705426264] [2025-03-16 23:15:06,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:06,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:15:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:06,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:15:06,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:15:06,660 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:07,931 INFO L93 Difference]: Finished difference Result 173 states and 259 transitions. [2025-03-16 23:15:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:15:07,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:15:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:07,935 INFO L225 Difference]: With dead ends: 173 [2025-03-16 23:15:07,935 INFO L226 Difference]: Without dead ends: 171 [2025-03-16 23:15:07,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:07,936 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 86 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:07,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 422 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 23:15:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-16 23:15:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 124. [2025-03-16 23:15:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 198 transitions. [2025-03-16 23:15:07,945 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 198 transitions. Word has length 182 [2025-03-16 23:15:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:07,945 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 198 transitions. [2025-03-16 23:15:07,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 198 transitions. [2025-03-16 23:15:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:15:07,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:07,946 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:07,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 23:15:07,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:07,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:07,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1439568253, now seen corresponding path program 1 times [2025-03-16 23:15:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:07,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478078828] [2025-03-16 23:15:07,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:07,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:07,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:15:07,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:15:07,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:07,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:09,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:09,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478078828] [2025-03-16 23:15:09,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478078828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:09,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:09,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:15:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154769474] [2025-03-16 23:15:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:09,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:15:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:09,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:15:09,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:15:09,256 INFO L87 Difference]: Start difference. First operand 124 states and 198 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:10,119 INFO L93 Difference]: Finished difference Result 171 states and 257 transitions. [2025-03-16 23:15:10,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:15:10,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:15:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:10,122 INFO L225 Difference]: With dead ends: 171 [2025-03-16 23:15:10,122 INFO L226 Difference]: Without dead ends: 169 [2025-03-16 23:15:10,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:10,122 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 77 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:10,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 536 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:15:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-16 23:15:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 122. [2025-03-16 23:15:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 80 states have (on average 1.45) internal successors, (116), 81 states have internal predecessors, (116), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2025-03-16 23:15:10,128 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 182 [2025-03-16 23:15:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:10,128 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2025-03-16 23:15:10,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2025-03-16 23:15:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:15:10,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:10,129 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:10,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 23:15:10,129 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:10,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1528166687, now seen corresponding path program 1 times [2025-03-16 23:15:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:10,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574352667] [2025-03-16 23:15:10,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:10,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:10,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:15:10,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:15:10,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:10,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:11,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:11,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574352667] [2025-03-16 23:15:11,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574352667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:11,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:11,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:15:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544624860] [2025-03-16 23:15:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:11,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:15:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:11,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:15:11,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:15:11,308 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:11,745 INFO L93 Difference]: Finished difference Result 174 states and 261 transitions. [2025-03-16 23:15:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:15:11,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:15:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:11,746 INFO L225 Difference]: With dead ends: 174 [2025-03-16 23:15:11,746 INFO L226 Difference]: Without dead ends: 172 [2025-03-16 23:15:11,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:11,747 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 87 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:11,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 551 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:15:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-16 23:15:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 119. [2025-03-16 23:15:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2025-03-16 23:15:11,753 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 182 [2025-03-16 23:15:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:11,753 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2025-03-16 23:15:11,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2025-03-16 23:15:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:15:11,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:11,754 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:11,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 23:15:11,754 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:11,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash 54340024, now seen corresponding path program 1 times [2025-03-16 23:15:11,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:11,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117271917] [2025-03-16 23:15:11,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:11,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:11,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:15:11,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:15:11,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:11,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:12,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117271917] [2025-03-16 23:15:12,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117271917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:12,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:12,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:15:12,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221053678] [2025-03-16 23:15:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:12,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:15:12,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:12,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:15:12,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:15:12,847 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:13,586 INFO L93 Difference]: Finished difference Result 181 states and 272 transitions. [2025-03-16 23:15:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:15:13,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:15:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:13,589 INFO L225 Difference]: With dead ends: 181 [2025-03-16 23:15:13,589 INFO L226 Difference]: Without dead ends: 179 [2025-03-16 23:15:13,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:13,590 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 93 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:13,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 488 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:15:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-16 23:15:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 119. [2025-03-16 23:15:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 78 states have internal predecessors, (111), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2025-03-16 23:15:13,602 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 182 [2025-03-16 23:15:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:13,603 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2025-03-16 23:15:13,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2025-03-16 23:15:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:15:13,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:13,604 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:13,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 23:15:13,604 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:13,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:13,604 INFO L85 PathProgramCache]: Analyzing trace with hash 941843705, now seen corresponding path program 1 times [2025-03-16 23:15:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:13,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644465019] [2025-03-16 23:15:13,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:13,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:15:13,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:15:13,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:13,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:15,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644465019] [2025-03-16 23:15:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644465019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:15,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:15,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:15:15,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808145534] [2025-03-16 23:15:15,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:15,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:15:15,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:15,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:15:15,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:15:15,605 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:16,587 INFO L93 Difference]: Finished difference Result 294 states and 457 transitions. [2025-03-16 23:15:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:15:16,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:15:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:16,591 INFO L225 Difference]: With dead ends: 294 [2025-03-16 23:15:16,591 INFO L226 Difference]: Without dead ends: 176 [2025-03-16 23:15:16,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:15:16,592 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 96 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:16,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 423 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:15:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-16 23:15:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 121. [2025-03-16 23:15:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 192 transitions. [2025-03-16 23:15:16,600 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 192 transitions. Word has length 182 [2025-03-16 23:15:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:16,601 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 192 transitions. [2025-03-16 23:15:16,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 192 transitions. [2025-03-16 23:15:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:15:16,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:16,602 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:16,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 23:15:16,603 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:16,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1111380197, now seen corresponding path program 1 times [2025-03-16 23:15:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:16,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261244373] [2025-03-16 23:15:16,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:16,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:16,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:15:16,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:15:16,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:16,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261244373] [2025-03-16 23:15:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261244373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:18,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:18,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:15:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831272146] [2025-03-16 23:15:18,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:18,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:15:18,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:18,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:15:18,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:15:18,603 INFO L87 Difference]: Start difference. First operand 121 states and 192 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:19,691 INFO L93 Difference]: Finished difference Result 192 states and 291 transitions. [2025-03-16 23:15:19,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:15:19,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:15:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:19,693 INFO L225 Difference]: With dead ends: 192 [2025-03-16 23:15:19,693 INFO L226 Difference]: Without dead ends: 190 [2025-03-16 23:15:19,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:19,694 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 84 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:19,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 401 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:15:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-16 23:15:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 123. [2025-03-16 23:15:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 states have internal predecessors, (117), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 195 transitions. [2025-03-16 23:15:19,700 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 195 transitions. Word has length 182 [2025-03-16 23:15:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:19,700 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 195 transitions. [2025-03-16 23:15:19,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 195 transitions. [2025-03-16 23:15:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 23:15:19,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:19,701 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:19,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 23:15:19,701 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:19,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:19,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1140009348, now seen corresponding path program 1 times [2025-03-16 23:15:19,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:19,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118832218] [2025-03-16 23:15:19,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:19,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:19,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 23:15:19,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 23:15:19,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:19,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:20,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118832218] [2025-03-16 23:15:20,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118832218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:20,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:20,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 23:15:20,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271021603] [2025-03-16 23:15:20,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:20,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:15:20,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:20,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:15:20,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:15:20,866 INFO L87 Difference]: Start difference. First operand 123 states and 195 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:21,818 INFO L93 Difference]: Finished difference Result 195 states and 295 transitions. [2025-03-16 23:15:21,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 23:15:21,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 182 [2025-03-16 23:15:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:21,819 INFO L225 Difference]: With dead ends: 195 [2025-03-16 23:15:21,819 INFO L226 Difference]: Without dead ends: 193 [2025-03-16 23:15:21,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-16 23:15:21,820 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 101 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:21,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 410 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:15:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-16 23:15:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 120. [2025-03-16 23:15:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 190 transitions. [2025-03-16 23:15:21,826 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 190 transitions. Word has length 182 [2025-03-16 23:15:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:21,826 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 190 transitions. [2025-03-16 23:15:21,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 190 transitions. [2025-03-16 23:15:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 23:15:21,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:21,827 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:21,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 23:15:21,828 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:21,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1899681350, now seen corresponding path program 1 times [2025-03-16 23:15:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:21,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657569812] [2025-03-16 23:15:21,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:21,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 23:15:21,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 23:15:21,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:21,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:24,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:24,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657569812] [2025-03-16 23:15:24,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657569812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:24,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:24,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:15:24,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000707311] [2025-03-16 23:15:24,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:24,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:15:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:24,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:15:24,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:24,024 INFO L87 Difference]: Start difference. First operand 120 states and 190 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:24,689 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2025-03-16 23:15:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:15:24,690 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 183 [2025-03-16 23:15:24,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:24,691 INFO L225 Difference]: With dead ends: 194 [2025-03-16 23:15:24,691 INFO L226 Difference]: Without dead ends: 192 [2025-03-16 23:15:24,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:15:24,691 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 97 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:24,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 360 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:15:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-16 23:15:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 125. [2025-03-16 23:15:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 199 transitions. [2025-03-16 23:15:24,697 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 199 transitions. Word has length 183 [2025-03-16 23:15:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:24,697 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 199 transitions. [2025-03-16 23:15:24,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 199 transitions. [2025-03-16 23:15:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 23:15:24,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:24,698 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:24,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 23:15:24,699 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:24,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1899711141, now seen corresponding path program 1 times [2025-03-16 23:15:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061683004] [2025-03-16 23:15:24,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:24,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:24,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 23:15:24,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 23:15:24,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:24,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:26,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:26,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061683004] [2025-03-16 23:15:26,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061683004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:26,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:26,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:15:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863561802] [2025-03-16 23:15:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:26,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:15:26,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:26,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:15:26,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:26,528 INFO L87 Difference]: Start difference. First operand 125 states and 199 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:27,125 INFO L93 Difference]: Finished difference Result 192 states and 287 transitions. [2025-03-16 23:15:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:15:27,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 183 [2025-03-16 23:15:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:27,126 INFO L225 Difference]: With dead ends: 192 [2025-03-16 23:15:27,126 INFO L226 Difference]: Without dead ends: 190 [2025-03-16 23:15:27,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:15:27,127 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 73 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:27,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 494 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:15:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-16 23:15:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 123. [2025-03-16 23:15:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 states have internal predecessors, (117), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 195 transitions. [2025-03-16 23:15:27,133 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 195 transitions. Word has length 183 [2025-03-16 23:15:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:27,133 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 195 transitions. [2025-03-16 23:15:27,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 195 transitions. [2025-03-16 23:15:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 23:15:27,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:27,134 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:27,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 23:15:27,134 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:27,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1928310501, now seen corresponding path program 1 times [2025-03-16 23:15:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:27,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642175084] [2025-03-16 23:15:27,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:27,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 23:15:27,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 23:15:27,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:27,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642175084] [2025-03-16 23:15:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642175084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:29,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:29,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:15:29,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061609490] [2025-03-16 23:15:29,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:29,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:15:29,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:29,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:15:29,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:29,418 INFO L87 Difference]: Start difference. First operand 123 states and 195 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:30,156 INFO L93 Difference]: Finished difference Result 190 states and 285 transitions. [2025-03-16 23:15:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:15:30,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 183 [2025-03-16 23:15:30,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:30,158 INFO L225 Difference]: With dead ends: 190 [2025-03-16 23:15:30,158 INFO L226 Difference]: Without dead ends: 188 [2025-03-16 23:15:30,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:15:30,159 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 80 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:30,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 434 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:15:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-16 23:15:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 125. [2025-03-16 23:15:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 199 transitions. [2025-03-16 23:15:30,165 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 199 transitions. Word has length 183 [2025-03-16 23:15:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:30,165 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 199 transitions. [2025-03-16 23:15:30,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 199 transitions. [2025-03-16 23:15:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 23:15:30,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:30,166 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:30,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 23:15:30,166 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:30,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1928340292, now seen corresponding path program 1 times [2025-03-16 23:15:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:30,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803171190] [2025-03-16 23:15:30,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:30,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 23:15:30,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 23:15:30,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:30,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:32,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:32,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803171190] [2025-03-16 23:15:32,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803171190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:32,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:32,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:15:32,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054194371] [2025-03-16 23:15:32,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:32,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:15:32,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:32,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:15:32,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:32,160 INFO L87 Difference]: Start difference. First operand 125 states and 199 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:32,604 INFO L93 Difference]: Finished difference Result 188 states and 283 transitions. [2025-03-16 23:15:32,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:15:32,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 183 [2025-03-16 23:15:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:32,607 INFO L225 Difference]: With dead ends: 188 [2025-03-16 23:15:32,607 INFO L226 Difference]: Without dead ends: 186 [2025-03-16 23:15:32,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:15:32,608 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 67 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:32,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 434 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:15:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-16 23:15:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 123. [2025-03-16 23:15:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 82 states have internal predecessors, (117), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 195 transitions. [2025-03-16 23:15:32,615 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 195 transitions. Word has length 183 [2025-03-16 23:15:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:32,615 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 195 transitions. [2025-03-16 23:15:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 195 transitions. [2025-03-16 23:15:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 23:15:32,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:32,616 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:32,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 23:15:32,617 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:32,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash -810643092, now seen corresponding path program 1 times [2025-03-16 23:15:32,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:32,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760790408] [2025-03-16 23:15:32,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:32,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 23:15:32,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 23:15:32,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:32,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:34,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:34,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760790408] [2025-03-16 23:15:34,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760790408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:34,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:34,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:15:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402109192] [2025-03-16 23:15:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:34,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:15:34,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:34,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:15:34,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:34,901 INFO L87 Difference]: Start difference. First operand 123 states and 195 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:35,843 INFO L93 Difference]: Finished difference Result 207 states and 301 transitions. [2025-03-16 23:15:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:15:35,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 183 [2025-03-16 23:15:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:35,845 INFO L225 Difference]: With dead ends: 207 [2025-03-16 23:15:35,845 INFO L226 Difference]: Without dead ends: 205 [2025-03-16 23:15:35,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:15:35,845 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 116 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:35,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 438 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:15:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-16 23:15:35,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 127. [2025-03-16 23:15:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 202 transitions. [2025-03-16 23:15:35,851 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 202 transitions. Word has length 183 [2025-03-16 23:15:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:35,851 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 202 transitions. [2025-03-16 23:15:35,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 202 transitions. [2025-03-16 23:15:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 23:15:35,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:35,852 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:35,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 23:15:35,852 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:35,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash -810613301, now seen corresponding path program 1 times [2025-03-16 23:15:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:35,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465686352] [2025-03-16 23:15:35,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:35,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 23:15:35,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 23:15:35,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:35,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:15:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-16 23:15:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:15:40,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465686352] [2025-03-16 23:15:40,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465686352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:15:40,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:15:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:15:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704270156] [2025-03-16 23:15:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:15:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:15:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:15:40,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:15:40,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:15:40,871 INFO L87 Difference]: Start difference. First operand 127 states and 202 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:15:43,141 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2025-03-16 23:15:43,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:15:43,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 183 [2025-03-16 23:15:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:15:43,143 INFO L225 Difference]: With dead ends: 163 [2025-03-16 23:15:43,143 INFO L226 Difference]: Without dead ends: 161 [2025-03-16 23:15:43,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2025-03-16 23:15:43,143 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 127 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:15:43,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 294 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:15:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-16 23:15:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 127. [2025-03-16 23:15:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 23:15:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 202 transitions. [2025-03-16 23:15:43,149 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 202 transitions. Word has length 183 [2025-03-16 23:15:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:15:43,149 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 202 transitions. [2025-03-16 23:15:43,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-16 23:15:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 202 transitions. [2025-03-16 23:15:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-16 23:15:43,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:15:43,150 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:43,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 23:15:43,151 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:15:43,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:15:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash -722938388, now seen corresponding path program 1 times [2025-03-16 23:15:43,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:15:43,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004886869] [2025-03-16 23:15:43,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:15:43,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:15:43,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-16 23:15:43,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-16 23:15:43,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:15:43,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat