./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.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 a356de088718b875f6f2396a50433e83aa6fe2b03aff9fb8f00ce9106af95d3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:46:22,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:46:22,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:46:22,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:46:22,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:46:22,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:46:22,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:46:22,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:46:22,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:46:22,115 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:46:22,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:46:22,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:46:22,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:46:22,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:46:22,116 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:46:22,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:46:22,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:46:22,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:46:22,117 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:46:22,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:46:22,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:46:22,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:46:22,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:46:22,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:46:22,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:46:22,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:46:22,118 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:46:22,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:46:22,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:46:22,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:46:22,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:46:22,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:46:22,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:46:22,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:46:22,119 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a356de088718b875f6f2396a50433e83aa6fe2b03aff9fb8f00ce9106af95d3b [2025-03-08 10:46:22,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:46:22,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:46:22,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:46:22,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:46:22,328 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:46:22,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2025-03-08 10:46:23,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738855ae7/569a1e9a538847cd9c67c8b2521a2d6a/FLAGf7adcba65 [2025-03-08 10:46:23,746 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:46:23,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2025-03-08 10:46:23,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738855ae7/569a1e9a538847cd9c67c8b2521a2d6a/FLAGf7adcba65 [2025-03-08 10:46:24,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/738855ae7/569a1e9a538847cd9c67c8b2521a2d6a [2025-03-08 10:46:24,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:46:24,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:46:24,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:46:24,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:46:24,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:46:24,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300332b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24, skipping insertion in model container [2025-03-08 10:46:24,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:46:24,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i[915,928] [2025-03-08 10:46:24,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:46:24,272 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:46:24,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i[915,928] [2025-03-08 10:46:24,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:46:24,326 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:46:24,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24 WrapperNode [2025-03-08 10:46:24,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:46:24,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:46:24,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:46:24,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:46:24,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,366 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2025-03-08 10:46:24,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:46:24,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:46:24,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:46:24,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:46:24,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,386 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-08 10:46:24,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:46:24,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:46:24,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:46:24,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:46:24,398 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (1/1) ... [2025-03-08 10:46:24,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:46:24,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:46:24,425 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-08 10:46:24,428 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-08 10:46:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:46:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:46:24,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:46:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:46:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:46:24,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:46:24,511 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:46:24,513 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:46:24,826 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L160: havoc property_#t~bitwise19#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1; [2025-03-08 10:46:24,852 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-08 10:46:24,854 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:46:24,873 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:46:24,873 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:46:24,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:24 BoogieIcfgContainer [2025-03-08 10:46:24,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:46:24,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:46:24,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:46:24,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:46:24,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:46:24" (1/3) ... [2025-03-08 10:46:24,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206e66c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:24, skipping insertion in model container [2025-03-08 10:46:24,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:24" (2/3) ... [2025-03-08 10:46:24,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206e66c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:24, skipping insertion in model container [2025-03-08 10:46:24,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:24" (3/3) ... [2025-03-08 10:46:24,884 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2025-03-08 10:46:24,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:46:24,895 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-34.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:46:24,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:46:24,941 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;@a1b9bed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:46:24,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:46:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:46:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 10:46:24,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:24,952 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:24,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:24,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:24,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1277446659, now seen corresponding path program 1 times [2025-03-08 10:46:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159409460] [2025-03-08 10:46:24,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:25,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 10:46:25,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 10:46:25,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:25,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 10:46:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159409460] [2025-03-08 10:46:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159409460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:46:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076940022] [2025-03-08 10:46:25,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:25,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:46:25,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:46:25,200 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-08 10:46:25,201 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-08 10:46:25,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 10:46:25,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 10:46:25,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:25,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:25,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:46:25,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:46:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 10:46:25,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:46:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076940022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:46:25,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:46:25,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104865402] [2025-03-08 10:46:25,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:25,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:46:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:25,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:46:25,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:46:25,411 INFO L87 Difference]: Start difference. First operand has 85 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 10:46:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:25,434 INFO L93 Difference]: Finished difference Result 164 states and 277 transitions. [2025-03-08 10:46:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:46:25,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-03-08 10:46:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:25,443 INFO L225 Difference]: With dead ends: 164 [2025-03-08 10:46:25,443 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 10:46:25,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-08 10:46:25,449 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:25,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:46:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 10:46:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-08 10:46:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 10:46:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2025-03-08 10:46:25,484 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 145 [2025-03-08 10:46:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:25,485 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2025-03-08 10:46:25,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 10:46:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2025-03-08 10:46:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 10:46:25,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:25,489 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:25,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:46:25,694 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-08 10:46:25,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:25,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash -865278977, now seen corresponding path program 1 times [2025-03-08 10:46:25,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:25,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91422219] [2025-03-08 10:46:25,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:25,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 10:46:25,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 10:46:25,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:25,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:26,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91422219] [2025-03-08 10:46:26,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91422219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:26,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:26,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:46:26,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115587530] [2025-03-08 10:46:26,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:26,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:46:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:26,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:46:26,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:46:26,161 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:26,323 INFO L93 Difference]: Finished difference Result 270 states and 414 transitions. [2025-03-08 10:46:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:46:26,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-03-08 10:46:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:26,326 INFO L225 Difference]: With dead ends: 270 [2025-03-08 10:46:26,326 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 10:46:26,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:46:26,327 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 135 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:26,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 379 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:46:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 10:46:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2025-03-08 10:46:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 10:46:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2025-03-08 10:46:26,360 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 145 [2025-03-08 10:46:26,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:26,360 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2025-03-08 10:46:26,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:26,362 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2025-03-08 10:46:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 10:46:26,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:26,364 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:26,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:46:26,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:26,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1910678592, now seen corresponding path program 1 times [2025-03-08 10:46:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:26,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545475677] [2025-03-08 10:46:26,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:26,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:26,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 10:46:26,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 10:46:26,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:26,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545475677] [2025-03-08 10:46:26,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545475677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:26,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:26,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:46:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263079362] [2025-03-08 10:46:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:26,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:46:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:26,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:46:26,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:46:26,571 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:26,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:26,816 INFO L93 Difference]: Finished difference Result 472 states and 724 transitions. [2025-03-08 10:46:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:46:26,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-03-08 10:46:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:26,819 INFO L225 Difference]: With dead ends: 472 [2025-03-08 10:46:26,819 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 10:46:26,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:46:26,824 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 149 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:26,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 468 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:46:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 10:46:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 165. [2025-03-08 10:46:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 118 states have (on average 1.38135593220339) internal successors, (163), 118 states have internal predecessors, (163), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 10:46:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2025-03-08 10:46:26,859 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 146 [2025-03-08 10:46:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:26,859 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2025-03-08 10:46:26,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2025-03-08 10:46:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 10:46:26,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:26,861 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:26,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:46:26,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:26,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash 960640443, now seen corresponding path program 1 times [2025-03-08 10:46:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:26,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505783097] [2025-03-08 10:46:26,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:26,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:26,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 10:46:26,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 10:46:26,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:26,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505783097] [2025-03-08 10:46:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505783097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:27,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:27,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:46:27,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800864844] [2025-03-08 10:46:27,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:27,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:46:27,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:27,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:46:27,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:46:27,289 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:27,541 INFO L93 Difference]: Finished difference Result 439 states and 667 transitions. [2025-03-08 10:46:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:46:27,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-03-08 10:46:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:27,544 INFO L225 Difference]: With dead ends: 439 [2025-03-08 10:46:27,544 INFO L226 Difference]: Without dead ends: 277 [2025-03-08 10:46:27,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:46:27,546 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 88 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:27,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 300 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:46:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-08 10:46:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 221. [2025-03-08 10:46:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 151 states have internal predecessors, (204), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:46:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 336 transitions. [2025-03-08 10:46:27,587 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 336 transitions. Word has length 147 [2025-03-08 10:46:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:27,587 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 336 transitions. [2025-03-08 10:46:27,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 336 transitions. [2025-03-08 10:46:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 10:46:27,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:27,589 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:27,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:46:27,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:27,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1466199068, now seen corresponding path program 1 times [2025-03-08 10:46:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925488117] [2025-03-08 10:46:27,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:27,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 10:46:27,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 10:46:27,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:27,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:29,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925488117] [2025-03-08 10:46:29,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925488117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:29,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:29,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 10:46:29,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296553659] [2025-03-08 10:46:29,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:29,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:46:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:29,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:46:29,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:46:29,889 INFO L87 Difference]: Start difference. First operand 221 states and 336 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:30,309 INFO L93 Difference]: Finished difference Result 447 states and 677 transitions. [2025-03-08 10:46:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:46:30,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-03-08 10:46:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:30,313 INFO L225 Difference]: With dead ends: 447 [2025-03-08 10:46:30,313 INFO L226 Difference]: Without dead ends: 285 [2025-03-08 10:46:30,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:46:30,314 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 166 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:30,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 571 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:46:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-08 10:46:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 227. [2025-03-08 10:46:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 157 states have internal predecessors, (212), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:46:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 344 transitions. [2025-03-08 10:46:30,359 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 344 transitions. Word has length 147 [2025-03-08 10:46:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:30,359 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 344 transitions. [2025-03-08 10:46:30,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 344 transitions. [2025-03-08 10:46:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 10:46:30,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:30,362 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:30,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:46:30,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:30,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash -83375625, now seen corresponding path program 1 times [2025-03-08 10:46:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224704643] [2025-03-08 10:46:30,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:30,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 10:46:30,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 10:46:30,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:30,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:37,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:37,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224704643] [2025-03-08 10:46:37,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224704643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:37,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 10:46:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175747205] [2025-03-08 10:46:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:37,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:46:37,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:37,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:46:37,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:46:37,765 INFO L87 Difference]: Start difference. First operand 227 states and 344 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:42,647 INFO L93 Difference]: Finished difference Result 685 states and 999 transitions. [2025-03-08 10:46:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 10:46:42,648 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-03-08 10:46:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:42,650 INFO L225 Difference]: With dead ends: 685 [2025-03-08 10:46:42,650 INFO L226 Difference]: Without dead ends: 506 [2025-03-08 10:46:42,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-03-08 10:46:42,651 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 563 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:42,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 787 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 10:46:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-08 10:46:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 302. [2025-03-08 10:46:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 232 states have internal predecessors, (317), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:46:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 449 transitions. [2025-03-08 10:46:42,681 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 449 transitions. Word has length 147 [2025-03-08 10:46:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:42,681 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 449 transitions. [2025-03-08 10:46:42,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 449 transitions. [2025-03-08 10:46:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 10:46:42,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:42,683 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:42,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:46:42,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:42,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash 804128056, now seen corresponding path program 1 times [2025-03-08 10:46:42,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:42,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529180881] [2025-03-08 10:46:42,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:42,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 10:46:42,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 10:46:42,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:42,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:44,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:44,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529180881] [2025-03-08 10:46:44,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529180881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:44,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:46:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026735104] [2025-03-08 10:46:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:44,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:46:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:44,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:46:44,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:46:44,128 INFO L87 Difference]: Start difference. First operand 302 states and 449 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:44,898 INFO L93 Difference]: Finished difference Result 635 states and 943 transitions. [2025-03-08 10:46:44,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:46:44,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-03-08 10:46:44,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:44,901 INFO L225 Difference]: With dead ends: 635 [2025-03-08 10:46:44,901 INFO L226 Difference]: Without dead ends: 457 [2025-03-08 10:46:44,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:46:44,902 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 342 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:44,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 494 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:46:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-08 10:46:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 343. [2025-03-08 10:46:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 273 states have (on average 1.347985347985348) internal successors, (368), 273 states have internal predecessors, (368), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:46:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 500 transitions. [2025-03-08 10:46:44,932 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 500 transitions. Word has length 147 [2025-03-08 10:46:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:44,932 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 500 transitions. [2025-03-08 10:46:44,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 500 transitions. [2025-03-08 10:46:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 10:46:44,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:44,934 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:44,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:46:44,934 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:44,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:44,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1890830088, now seen corresponding path program 1 times [2025-03-08 10:46:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:44,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903682449] [2025-03-08 10:46:44,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:44,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 10:46:44,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 10:46:44,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:44,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:46,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:46,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903682449] [2025-03-08 10:46:46,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903682449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:46,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:46,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:46:46,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968775557] [2025-03-08 10:46:46,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:46,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:46:46,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:46,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:46:46,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:46:46,003 INFO L87 Difference]: Start difference. First operand 343 states and 500 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 10:46:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:46,715 INFO L93 Difference]: Finished difference Result 645 states and 938 transitions. [2025-03-08 10:46:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 10:46:46,716 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2025-03-08 10:46:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:46,718 INFO L225 Difference]: With dead ends: 645 [2025-03-08 10:46:46,718 INFO L226 Difference]: Without dead ends: 469 [2025-03-08 10:46:46,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:46:46,718 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 445 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:46,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 495 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:46:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-08 10:46:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 379. [2025-03-08 10:46:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 309 states have (on average 1.372168284789644) internal successors, (424), 309 states have internal predecessors, (424), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:46:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 556 transitions. [2025-03-08 10:46:46,748 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 556 transitions. Word has length 147 [2025-03-08 10:46:46,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:46,749 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 556 transitions. [2025-03-08 10:46:46,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 10:46:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 556 transitions. [2025-03-08 10:46:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:46:46,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:46,750 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:46,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:46:46,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:46,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:46,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2121733659, now seen corresponding path program 1 times [2025-03-08 10:46:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:46,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551254943] [2025-03-08 10:46:46,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:46,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:46,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:46:46,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:46:46,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:46,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551254943] [2025-03-08 10:46:48,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551254943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:48,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:48,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:46:48,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126197725] [2025-03-08 10:46:48,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:48,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:46:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:48,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:46:48,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:46:48,551 INFO L87 Difference]: Start difference. First operand 379 states and 556 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:49,637 INFO L93 Difference]: Finished difference Result 734 states and 1070 transitions. [2025-03-08 10:46:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 10:46:49,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-03-08 10:46:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:49,640 INFO L225 Difference]: With dead ends: 734 [2025-03-08 10:46:49,640 INFO L226 Difference]: Without dead ends: 572 [2025-03-08 10:46:49,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:46:49,644 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 364 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:49,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 444 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:46:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-08 10:46:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 403. [2025-03-08 10:46:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 331 states have (on average 1.353474320241692) internal successors, (448), 331 states have internal predecessors, (448), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:46:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 580 transitions. [2025-03-08 10:46:49,675 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 580 transitions. Word has length 148 [2025-03-08 10:46:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:49,675 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 580 transitions. [2025-03-08 10:46:49,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 580 transitions. [2025-03-08 10:46:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:46:49,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:49,677 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:49,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:46:49,678 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1703979851, now seen corresponding path program 1 times [2025-03-08 10:46:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954692390] [2025-03-08 10:46:49,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:49,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:49,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:46:49,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:46:49,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:49,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954692390] [2025-03-08 10:46:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954692390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 10:46:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238521781] [2025-03-08 10:46:53,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:53,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 10:46:53,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:53,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 10:46:53,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:46:53,121 INFO L87 Difference]: Start difference. First operand 403 states and 580 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:46:54,882 INFO L93 Difference]: Finished difference Result 831 states and 1182 transitions. [2025-03-08 10:46:54,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 10:46:54,882 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-03-08 10:46:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:46:54,884 INFO L225 Difference]: With dead ends: 831 [2025-03-08 10:46:54,885 INFO L226 Difference]: Without dead ends: 524 [2025-03-08 10:46:54,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-03-08 10:46:54,886 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 371 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:46:54,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 761 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:46:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-08 10:46:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 426. [2025-03-08 10:46:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 354 states have (on average 1.3531073446327684) internal successors, (479), 354 states have internal predecessors, (479), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:46:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 611 transitions. [2025-03-08 10:46:54,911 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 611 transitions. Word has length 148 [2025-03-08 10:46:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:46:54,912 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 611 transitions. [2025-03-08 10:46:54,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:46:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 611 transitions. [2025-03-08 10:46:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 10:46:54,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:46:54,913 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:46:54,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:46:54,913 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:46:54,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:46:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash 783532982, now seen corresponding path program 1 times [2025-03-08 10:46:54,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:46:54,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585774648] [2025-03-08 10:46:54,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:46:54,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:46:54,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 10:46:54,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 10:46:54,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:46:54,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:46:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:46:58,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:46:58,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585774648] [2025-03-08 10:46:58,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585774648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:46:58,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:46:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 10:46:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435230040] [2025-03-08 10:46:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:46:58,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 10:46:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:46:58,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 10:46:58,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:46:58,672 INFO L87 Difference]: Start difference. First operand 426 states and 611 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:47:00,195 INFO L93 Difference]: Finished difference Result 700 states and 993 transitions. [2025-03-08 10:47:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:47:00,195 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-03-08 10:47:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:47:00,197 INFO L225 Difference]: With dead ends: 700 [2025-03-08 10:47:00,197 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 10:47:00,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 10:47:00,199 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 283 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:47:00,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 771 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:47:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 10:47:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 418. [2025-03-08 10:47:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 346 states have (on average 1.3439306358381502) internal successors, (465), 346 states have internal predecessors, (465), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:47:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 597 transitions. [2025-03-08 10:47:00,222 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 597 transitions. Word has length 148 [2025-03-08 10:47:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:47:00,223 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 597 transitions. [2025-03-08 10:47:00,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 597 transitions. [2025-03-08 10:47:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 10:47:00,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:47:00,224 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:47:00,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:47:00,224 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:47:00,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:47:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -138206053, now seen corresponding path program 1 times [2025-03-08 10:47:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:47:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554582077] [2025-03-08 10:47:00,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:47:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:47:00,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:47:00,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:47:00,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:47:00,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:47:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:47:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:47:02,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554582077] [2025-03-08 10:47:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554582077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:47:02,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:47:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:47:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129725237] [2025-03-08 10:47:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:47:02,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:47:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:47:02,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:47:02,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:47:02,310 INFO L87 Difference]: Start difference. First operand 418 states and 597 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:47:03,601 INFO L93 Difference]: Finished difference Result 837 states and 1200 transitions. [2025-03-08 10:47:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 10:47:03,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-08 10:47:03,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:47:03,606 INFO L225 Difference]: With dead ends: 837 [2025-03-08 10:47:03,606 INFO L226 Difference]: Without dead ends: 659 [2025-03-08 10:47:03,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-08 10:47:03,607 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 318 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:47:03,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 542 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:47:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-08 10:47:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 426. [2025-03-08 10:47:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 354 states have (on average 1.3418079096045197) internal successors, (475), 354 states have internal predecessors, (475), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:47:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 607 transitions. [2025-03-08 10:47:03,643 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 607 transitions. Word has length 149 [2025-03-08 10:47:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:47:03,643 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 607 transitions. [2025-03-08 10:47:03,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 607 transitions. [2025-03-08 10:47:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 10:47:03,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:47:03,645 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:47:03,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:47:03,645 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:47:03,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:47:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1945660516, now seen corresponding path program 1 times [2025-03-08 10:47:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:47:03,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771822269] [2025-03-08 10:47:03,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:47:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:47:03,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:47:03,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:47:03,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:47:03,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:47:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:47:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:47:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771822269] [2025-03-08 10:47:05,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771822269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:47:05,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:47:05,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 10:47:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295907815] [2025-03-08 10:47:05,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:47:05,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:47:05,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:47:05,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:47:05,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:47:05,231 INFO L87 Difference]: Start difference. First operand 426 states and 607 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:47:06,130 INFO L93 Difference]: Finished difference Result 684 states and 974 transitions. [2025-03-08 10:47:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:47:06,130 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-08 10:47:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:47:06,132 INFO L225 Difference]: With dead ends: 684 [2025-03-08 10:47:06,132 INFO L226 Difference]: Without dead ends: 486 [2025-03-08 10:47:06,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:47:06,133 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 245 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:47:06,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 473 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:47:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-08 10:47:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 396. [2025-03-08 10:47:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 324 states have (on average 1.3425925925925926) internal successors, (435), 324 states have internal predecessors, (435), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:47:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 567 transitions. [2025-03-08 10:47:06,157 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 567 transitions. Word has length 149 [2025-03-08 10:47:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:47:06,158 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 567 transitions. [2025-03-08 10:47:06,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 567 transitions. [2025-03-08 10:47:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 10:47:06,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:47:06,159 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:47:06,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 10:47:06,159 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:47:06,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:47:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash -530721386, now seen corresponding path program 1 times [2025-03-08 10:47:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:47:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192094486] [2025-03-08 10:47:06,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:47:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:47:06,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:47:06,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:47:06,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:47:06,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:47:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:47:08,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:47:08,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192094486] [2025-03-08 10:47:08,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192094486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:47:08,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:47:08,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 10:47:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235131147] [2025-03-08 10:47:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:47:08,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 10:47:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:47:08,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 10:47:08,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:47:08,985 INFO L87 Difference]: Start difference. First operand 396 states and 567 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:47:13,412 INFO L93 Difference]: Finished difference Result 837 states and 1193 transitions. [2025-03-08 10:47:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 10:47:13,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-08 10:47:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:47:13,415 INFO L225 Difference]: With dead ends: 837 [2025-03-08 10:47:13,415 INFO L226 Difference]: Without dead ends: 653 [2025-03-08 10:47:13,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-03-08 10:47:13,416 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 418 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:47:13,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 460 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 10:47:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-08 10:47:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 424. [2025-03-08 10:47:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 352 states have (on average 1.3494318181818181) internal successors, (475), 352 states have internal predecessors, (475), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:47:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 607 transitions. [2025-03-08 10:47:13,442 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 607 transitions. Word has length 149 [2025-03-08 10:47:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:47:13,442 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 607 transitions. [2025-03-08 10:47:13,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 607 transitions. [2025-03-08 10:47:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 10:47:13,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:47:13,443 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:47:13,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 10:47:13,444 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:47:13,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:47:13,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1069287766, now seen corresponding path program 1 times [2025-03-08 10:47:13,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:47:13,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634610446] [2025-03-08 10:47:13,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:47:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:47:13,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:47:13,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:47:13,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:47:13,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:47:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:47:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:47:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634610446] [2025-03-08 10:47:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634610446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:47:17,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:47:17,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:47:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979565228] [2025-03-08 10:47:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:47:17,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:47:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:47:17,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:47:17,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:47:17,940 INFO L87 Difference]: Start difference. First operand 424 states and 607 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:47:18,830 INFO L93 Difference]: Finished difference Result 855 states and 1215 transitions. [2025-03-08 10:47:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 10:47:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-08 10:47:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:47:18,832 INFO L225 Difference]: With dead ends: 855 [2025-03-08 10:47:18,832 INFO L226 Difference]: Without dead ends: 578 [2025-03-08 10:47:18,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-08 10:47:18,833 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 363 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:47:18,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 537 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:47:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-08 10:47:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 428. [2025-03-08 10:47:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 356 states have (on average 1.3370786516853932) internal successors, (476), 356 states have internal predecessors, (476), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:47:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 608 transitions. [2025-03-08 10:47:18,859 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 608 transitions. Word has length 149 [2025-03-08 10:47:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:47:18,859 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 608 transitions. [2025-03-08 10:47:18,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 608 transitions. [2025-03-08 10:47:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 10:47:18,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:47:18,861 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:47:18,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 10:47:18,861 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:47:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:47:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1956791447, now seen corresponding path program 1 times [2025-03-08 10:47:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:47:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847383247] [2025-03-08 10:47:18,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:47:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:47:18,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:47:18,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:47:18,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:47:18,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:47:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 10:47:23,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:47:23,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847383247] [2025-03-08 10:47:23,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847383247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:47:23,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:47:23,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 10:47:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940996991] [2025-03-08 10:47:23,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:47:23,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:47:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:47:23,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:47:23,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:47:23,391 INFO L87 Difference]: Start difference. First operand 428 states and 608 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:47:25,352 INFO L93 Difference]: Finished difference Result 832 states and 1148 transitions. [2025-03-08 10:47:25,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 10:47:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-08 10:47:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:47:25,355 INFO L225 Difference]: With dead ends: 832 [2025-03-08 10:47:25,355 INFO L226 Difference]: Without dead ends: 632 [2025-03-08 10:47:25,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2025-03-08 10:47:25,356 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 399 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:47:25,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 795 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 10:47:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-08 10:47:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 454. [2025-03-08 10:47:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 382 states have (on average 1.3324607329842932) internal successors, (509), 382 states have internal predecessors, (509), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:47:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 641 transitions. [2025-03-08 10:47:25,382 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 641 transitions. Word has length 149 [2025-03-08 10:47:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:47:25,382 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 641 transitions. [2025-03-08 10:47:25,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 10:47:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 641 transitions. [2025-03-08 10:47:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 10:47:25,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:47:25,383 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:47:25,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 10:47:25,384 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:47:25,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:47:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1773477224, now seen corresponding path program 1 times [2025-03-08 10:47:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:47:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852400297] [2025-03-08 10:47:25,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:47:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:47:25,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 10:47:25,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 10:47:25,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:47:25,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat