./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.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_fillercodestructure_filler-pr-ci_file-52.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 b4834357d23aac5c2a51d001b1c25f4722c265308db77262bd19157b1e0789ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:16:45,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:16:45,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:16:45,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:16:45,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:16:45,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:16:45,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:16:45,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:16:45,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:16:45,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:16:45,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:16:45,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:16:45,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:16:45,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:16:45,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:16:45,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:16:45,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:16:45,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:16:45,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:16:45,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:16:45,792 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 -> b4834357d23aac5c2a51d001b1c25f4722c265308db77262bd19157b1e0789ed [2025-03-08 12:16:46,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:16:46,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:16:46,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:16:46,027 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:16:46,028 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:16:46,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2025-03-08 12:16:47,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ab0dbc9/556319fda4674becbc81648a053fc025/FLAGa90ad763a [2025-03-08 12:16:47,439 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:16:47,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2025-03-08 12:16:47,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ab0dbc9/556319fda4674becbc81648a053fc025/FLAGa90ad763a [2025-03-08 12:16:47,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ab0dbc9/556319fda4674becbc81648a053fc025 [2025-03-08 12:16:47,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:16:47,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:16:47,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:16:47,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:16:47,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:16:47,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:47,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47, skipping insertion in model container [2025-03-08 12:16:47,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:47,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:16:47,879 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_fillercodestructure_filler-pr-ci_file-52.i[919,932] [2025-03-08 12:16:47,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:16:47,931 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:16:47,938 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_fillercodestructure_filler-pr-ci_file-52.i[919,932] [2025-03-08 12:16:47,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:16:47,970 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:16:47,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47 WrapperNode [2025-03-08 12:16:47,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:16:47,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:16:47,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:16:47,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:16:47,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:47,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,004 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-03-08 12:16:48,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:16:48,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:16:48,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:16:48,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:16:48,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,039 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 12:16:48,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:16:48,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:16:48,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:16:48,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:16:48,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (1/1) ... [2025-03-08 12:16:48,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:16:48,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:16:48,079 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 12:16:48,081 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 12:16:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:16:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:16:48,098 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:16:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:16:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:16:48,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:16:48,162 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:16:48,163 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:16:48,510 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 12:16:48,510 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:16:48,525 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:16:48,525 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:16:48,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:16:48 BoogieIcfgContainer [2025-03-08 12:16:48,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:16:48,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:16:48,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:16:48,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:16:48,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:16:47" (1/3) ... [2025-03-08 12:16:48,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41328dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:16:48, skipping insertion in model container [2025-03-08 12:16:48,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:16:47" (2/3) ... [2025-03-08 12:16:48,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41328dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:16:48, skipping insertion in model container [2025-03-08 12:16:48,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:16:48" (3/3) ... [2025-03-08 12:16:48,533 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2025-03-08 12:16:48,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:16:48,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:16:48,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:16:48,599 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;@53dc847b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:16:48,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:16:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 12:16:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 12:16:48,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:48,614 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:48,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:48,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1216767678, now seen corresponding path program 1 times [2025-03-08 12:16:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:48,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-08 12:16:48,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:48,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:48,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 12:16:48,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 12:16:48,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:48,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 12:16:48,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:48,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-08 12:16:48,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666796419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:16:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256822199] [2025-03-08 12:16:48,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:48,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:16:48,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:16:48,890 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 12:16:48,892 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 12:16:48,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 12:16:49,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 12:16:49,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:49,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:49,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:16:49,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:16:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 12:16:49,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:16:49,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256822199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:49,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:16:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:16:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060929562] [2025-03-08 12:16:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:49,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:16:49,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:49,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:16:49,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:16:49,084 INFO L87 Difference]: Start difference. First operand has 79 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 12:16:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:49,114 INFO L93 Difference]: Finished difference Result 152 states and 254 transitions. [2025-03-08 12:16:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:16:49,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 125 [2025-03-08 12:16:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:49,123 INFO L225 Difference]: With dead ends: 152 [2025-03-08 12:16:49,124 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 12:16:49,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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 12:16:49,128 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:49,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:16:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 12:16:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-08 12:16:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 12:16:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2025-03-08 12:16:49,155 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 125 [2025-03-08 12:16:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:49,156 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2025-03-08 12:16:49,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 12:16:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2025-03-08 12:16:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 12:16:49,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:49,159 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:49,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 12:16:49,360 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 12:16:49,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:49,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:49,361 INFO L85 PathProgramCache]: Analyzing trace with hash -695835999, now seen corresponding path program 1 times [2025-03-08 12:16:49,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-08 12:16:49,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:49,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 12:16:49,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 12:16:49,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:49,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:16:49,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:49,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-08 12:16:49,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410511436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:49,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:49,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:16:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89072386] [2025-03-08 12:16:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:49,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:16:49,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:49,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:16:49,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:16:49,639 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:49,757 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2025-03-08 12:16:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:16:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2025-03-08 12:16:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:49,760 INFO L225 Difference]: With dead ends: 222 [2025-03-08 12:16:49,761 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 12:16:49,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:16:49,762 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 94 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:49,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 285 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:16:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 12:16:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2025-03-08 12:16:49,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 109 states have (on average 1.4403669724770642) internal successors, (157), 109 states have internal predecessors, (157), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 12:16:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2025-03-08 12:16:49,790 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 125 [2025-03-08 12:16:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:49,791 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2025-03-08 12:16:49,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2025-03-08 12:16:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 12:16:49,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:49,793 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:49,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:16:49,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:49,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:49,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2049145696, now seen corresponding path program 1 times [2025-03-08 12:16:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:49,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-03-08 12:16:49,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:49,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:49,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 12:16:49,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 12:16:49,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:49,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:16:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-03-08 12:16:49,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295655933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:49,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:49,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:16:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534262097] [2025-03-08 12:16:49,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:49,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:16:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:49,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:16:49,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:16:49,998 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:50,071 INFO L93 Difference]: Finished difference Result 356 states and 553 transitions. [2025-03-08 12:16:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:16:50,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2025-03-08 12:16:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:50,073 INFO L225 Difference]: With dead ends: 356 [2025-03-08 12:16:50,074 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 12:16:50,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:16:50,077 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 42 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:50,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 177 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:16:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 12:16:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 187. [2025-03-08 12:16:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 150 states have (on average 1.5133333333333334) internal successors, (227), 150 states have internal predecessors, (227), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 12:16:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 295 transitions. [2025-03-08 12:16:50,107 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 295 transitions. Word has length 125 [2025-03-08 12:16:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:50,107 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 295 transitions. [2025-03-08 12:16:50,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 295 transitions. [2025-03-08 12:16:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 12:16:50,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:50,110 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:50,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:16:50,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:50,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash 892988803, now seen corresponding path program 1 times [2025-03-08 12:16:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:50,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011782866] [2025-03-08 12:16:50,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:50,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 12:16:50,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 12:16:50,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:16:50,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:50,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011782866] [2025-03-08 12:16:50,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011782866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:50,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:50,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:16:50,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638484427] [2025-03-08 12:16:50,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:50,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:16:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:50,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:16:50,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:16:50,295 INFO L87 Difference]: Start difference. First operand 187 states and 295 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:50,367 INFO L93 Difference]: Finished difference Result 514 states and 809 transitions. [2025-03-08 12:16:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:16:50,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 12:16:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:50,371 INFO L225 Difference]: With dead ends: 514 [2025-03-08 12:16:50,371 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 12:16:50,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:16:50,372 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 107 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:50,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 276 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:16:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 12:16:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 246. [2025-03-08 12:16:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 209 states have (on average 1.5502392344497609) internal successors, (324), 209 states have internal predecessors, (324), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 12:16:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 392 transitions. [2025-03-08 12:16:50,398 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 392 transitions. Word has length 126 [2025-03-08 12:16:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:50,399 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 392 transitions. [2025-03-08 12:16:50,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 392 transitions. [2025-03-08 12:16:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 12:16:50,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:50,400 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:50,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:16:50,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:50,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1768662393, now seen corresponding path program 1 times [2025-03-08 12:16:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743137880] [2025-03-08 12:16:50,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:50,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 12:16:50,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 12:16:50,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:50,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:16:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743137880] [2025-03-08 12:16:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743137880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:50,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:50,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:16:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155255752] [2025-03-08 12:16:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:16:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:50,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:16:50,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:16:50,611 INFO L87 Difference]: Start difference. First operand 246 states and 392 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:50,755 INFO L93 Difference]: Finished difference Result 411 states and 642 transitions. [2025-03-08 12:16:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:16:50,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 12:16:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:50,757 INFO L225 Difference]: With dead ends: 411 [2025-03-08 12:16:50,757 INFO L226 Difference]: Without dead ends: 287 [2025-03-08 12:16:50,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:16:50,758 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 57 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:50,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 338 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:16:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-08 12:16:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2025-03-08 12:16:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 236 states have (on average 1.5042372881355932) internal successors, (355), 238 states have internal predecessors, (355), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 12:16:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 439 transitions. [2025-03-08 12:16:50,781 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 439 transitions. Word has length 126 [2025-03-08 12:16:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:50,783 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 439 transitions. [2025-03-08 12:16:50,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 439 transitions. [2025-03-08 12:16:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 12:16:50,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:50,786 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:50,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:16:50,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1740033242, now seen corresponding path program 1 times [2025-03-08 12:16:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:50,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340376917] [2025-03-08 12:16:50,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:50,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 12:16:50,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 12:16:50,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:50,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:16:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340376917] [2025-03-08 12:16:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340376917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:51,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:51,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:16:51,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454697292] [2025-03-08 12:16:51,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:51,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:16:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:51,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:16:51,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:16:51,046 INFO L87 Difference]: Start difference. First operand 283 states and 439 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:51,344 INFO L93 Difference]: Finished difference Result 545 states and 834 transitions. [2025-03-08 12:16:51,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:16:51,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 12:16:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:51,347 INFO L225 Difference]: With dead ends: 545 [2025-03-08 12:16:51,348 INFO L226 Difference]: Without dead ends: 402 [2025-03-08 12:16:51,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:16:51,350 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 282 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:51,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 546 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:16:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-08 12:16:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 348. [2025-03-08 12:16:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 273 states have (on average 1.468864468864469) internal successors, (401), 275 states have internal predecessors, (401), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:16:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 537 transitions. [2025-03-08 12:16:51,384 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 537 transitions. Word has length 126 [2025-03-08 12:16:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:51,385 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 537 transitions. [2025-03-08 12:16:51,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 537 transitions. [2025-03-08 12:16:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 12:16:51,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:51,387 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:51,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:16:51,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:51,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash -30486201, now seen corresponding path program 1 times [2025-03-08 12:16:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:51,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725616325] [2025-03-08 12:16:51,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:51,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 12:16:51,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 12:16:51,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:51,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:16:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725616325] [2025-03-08 12:16:52,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725616325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:52,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:16:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733663404] [2025-03-08 12:16:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:52,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:16:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:52,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:16:52,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:16:52,084 INFO L87 Difference]: Start difference. First operand 348 states and 537 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:16:52,321 INFO L93 Difference]: Finished difference Result 1074 states and 1658 transitions. [2025-03-08 12:16:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:16:52,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-08 12:16:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:16:52,328 INFO L225 Difference]: With dead ends: 1074 [2025-03-08 12:16:52,328 INFO L226 Difference]: Without dead ends: 729 [2025-03-08 12:16:52,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 12:16:52,331 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 155 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:16:52,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 307 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:16:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-08 12:16:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 691. [2025-03-08 12:16:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 542 states have (on average 1.4575645756457565) internal successors, (790), 546 states have internal predecessors, (790), 136 states have call successors, (136), 12 states have call predecessors, (136), 12 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 12:16:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1062 transitions. [2025-03-08 12:16:52,401 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1062 transitions. Word has length 126 [2025-03-08 12:16:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:16:52,402 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1062 transitions. [2025-03-08 12:16:52,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:16:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1062 transitions. [2025-03-08 12:16:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 12:16:52,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:16:52,403 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:16:52,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:16:52,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:16:52,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:16:52,404 INFO L85 PathProgramCache]: Analyzing trace with hash 343042549, now seen corresponding path program 1 times [2025-03-08 12:16:52,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:16:52,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001906273] [2025-03-08 12:16:52,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:16:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:16:52,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 12:16:52,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 12:16:52,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:16:52,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:16:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:16:59,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:16:59,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001906273] [2025-03-08 12:16:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001906273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:16:59,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:16:59,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 12:16:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677249858] [2025-03-08 12:16:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:16:59,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 12:16:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:16:59,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 12:16:59,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:16:59,402 INFO L87 Difference]: Start difference. First operand 691 states and 1062 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:17:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:17:00,530 INFO L93 Difference]: Finished difference Result 1758 states and 2684 transitions. [2025-03-08 12:17:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:17:00,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 128 [2025-03-08 12:17:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:17:00,539 INFO L225 Difference]: With dead ends: 1758 [2025-03-08 12:17:00,540 INFO L226 Difference]: Without dead ends: 1070 [2025-03-08 12:17:00,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-08 12:17:00,544 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 327 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:17:00,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 726 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:17:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-03-08 12:17:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 787. [2025-03-08 12:17:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 620 states have (on average 1.4483870967741936) internal successors, (898), 624 states have internal predecessors, (898), 153 states have call successors, (153), 13 states have call predecessors, (153), 13 states have return successors, (153), 149 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-08 12:17:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1204 transitions. [2025-03-08 12:17:00,606 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1204 transitions. Word has length 128 [2025-03-08 12:17:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:17:00,606 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1204 transitions. [2025-03-08 12:17:00,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 12:17:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1204 transitions. [2025-03-08 12:17:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 12:17:00,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:17:00,608 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:17:00,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:17:00,608 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:17:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:17:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1696352246, now seen corresponding path program 1 times [2025-03-08 12:17:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:17:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143458483] [2025-03-08 12:17:00,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:17:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:17:00,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 12:17:00,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 12:17:00,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:17:00,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:17:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:17:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:17:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143458483] [2025-03-08 12:17:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143458483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:17:00,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:17:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:17:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453137161] [2025-03-08 12:17:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:17:00,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:17:00,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:17:00,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:17:00,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:17:00,748 INFO L87 Difference]: Start difference. First operand 787 states and 1204 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:17:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:17:01,027 INFO L93 Difference]: Finished difference Result 1317 states and 2009 transitions. [2025-03-08 12:17:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:17:01,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-08 12:17:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:17:01,034 INFO L225 Difference]: With dead ends: 1317 [2025-03-08 12:17:01,034 INFO L226 Difference]: Without dead ends: 953 [2025-03-08 12:17:01,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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 12:17:01,036 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 202 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:17:01,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 570 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:17:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-08 12:17:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 935. [2025-03-08 12:17:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 730 states have (on average 1.4356164383561645) internal successors, (1048), 734 states have internal predecessors, (1048), 187 states have call successors, (187), 17 states have call predecessors, (187), 17 states have return successors, (187), 183 states have call predecessors, (187), 187 states have call successors, (187) [2025-03-08 12:17:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1422 transitions. [2025-03-08 12:17:01,081 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1422 transitions. Word has length 128 [2025-03-08 12:17:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:17:01,081 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1422 transitions. [2025-03-08 12:17:01,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:17:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1422 transitions. [2025-03-08 12:17:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 12:17:01,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:17:01,085 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:17:01,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:17:01,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:17:01,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:17:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1011781008, now seen corresponding path program 1 times [2025-03-08 12:17:01,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:17:01,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701087862] [2025-03-08 12:17:01,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:17:01,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:17:01,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 12:17:01,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 12:17:01,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:17:01,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:17:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:17:01,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:17:01,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701087862] [2025-03-08 12:17:01,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701087862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:17:01,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:17:01,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:17:01,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376950571] [2025-03-08 12:17:01,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:17:01,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:17:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:17:01,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:17:01,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:17:01,156 INFO L87 Difference]: Start difference. First operand 935 states and 1422 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:17:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:17:01,281 INFO L93 Difference]: Finished difference Result 1415 states and 2133 transitions. [2025-03-08 12:17:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:17:01,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-08 12:17:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:17:01,284 INFO L225 Difference]: With dead ends: 1415 [2025-03-08 12:17:01,284 INFO L226 Difference]: Without dead ends: 579 [2025-03-08 12:17:01,286 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 12:17:01,287 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 142 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:17:01,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 148 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:17:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-08 12:17:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 422. [2025-03-08 12:17:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 327 states have (on average 1.379204892966361) internal successors, (451), 327 states have internal predecessors, (451), 85 states have call successors, (85), 9 states have call predecessors, (85), 9 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 12:17:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 621 transitions. [2025-03-08 12:17:01,314 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 621 transitions. Word has length 128 [2025-03-08 12:17:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:17:01,315 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 621 transitions. [2025-03-08 12:17:01,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:17:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 621 transitions. [2025-03-08 12:17:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:17:01,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:17:01,317 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:17:01,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:17:01,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:17:01,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:17:01,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1391956646, now seen corresponding path program 1 times [2025-03-08 12:17:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:17:01,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223132194] [2025-03-08 12:17:01,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:17:01,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:17:01,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:17:01,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:17:01,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:17:01,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:17:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:17:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:17:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223132194] [2025-03-08 12:17:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223132194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:17:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:17:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:17:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852323590] [2025-03-08 12:17:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:17:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:17:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:17:01,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:17:01,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:17:01,420 INFO L87 Difference]: Start difference. First operand 422 states and 621 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:17:01,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:17:01,571 INFO L93 Difference]: Finished difference Result 773 states and 1134 transitions. [2025-03-08 12:17:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:17:01,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-08 12:17:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:17:01,573 INFO L225 Difference]: With dead ends: 773 [2025-03-08 12:17:01,573 INFO L226 Difference]: Without dead ends: 417 [2025-03-08 12:17:01,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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 12:17:01,574 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 176 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:17:01,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 350 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:17:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-08 12:17:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 274. [2025-03-08 12:17:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 217 states have (on average 1.3963133640552996) internal successors, (303), 217 states have internal predecessors, (303), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 12:17:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 405 transitions. [2025-03-08 12:17:01,596 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 405 transitions. Word has length 130 [2025-03-08 12:17:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:17:01,596 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 405 transitions. [2025-03-08 12:17:01,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:17:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 405 transitions. [2025-03-08 12:17:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:17:01,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:17:01,598 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:17:01,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 12:17:01,598 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:17:01,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:17:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash -547484775, now seen corresponding path program 1 times [2025-03-08 12:17:01,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:17:01,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341889536] [2025-03-08 12:17:01,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:17:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:17:01,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:17:01,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:17:01,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:17:01,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:17:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 12:17:01,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:17:01,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341889536] [2025-03-08 12:17:01,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341889536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:17:01,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:17:01,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:17:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164598330] [2025-03-08 12:17:01,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:17:01,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:17:01,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:17:01,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:17:01,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:17:01,750 INFO L87 Difference]: Start difference. First operand 274 states and 405 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:17:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:17:01,966 INFO L93 Difference]: Finished difference Result 535 states and 785 transitions. [2025-03-08 12:17:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:17:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-08 12:17:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:17:01,968 INFO L225 Difference]: With dead ends: 535 [2025-03-08 12:17:01,968 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 12:17:01,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:17:01,970 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 174 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:17:01,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:17:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 12:17:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2025-03-08 12:17:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 238 states have (on average 1.3991596638655461) internal successors, (333), 238 states have internal predecessors, (333), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 12:17:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 435 transitions. [2025-03-08 12:17:01,988 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 435 transitions. Word has length 130 [2025-03-08 12:17:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:17:01,989 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 435 transitions. [2025-03-08 12:17:01,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 12:17:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 435 transitions. [2025-03-08 12:17:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 12:17:01,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:17:01,990 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:17:01,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 12:17:01,990 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:17:01,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:17:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash -518855624, now seen corresponding path program 1 times [2025-03-08 12:17:01,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:17:01,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237930049] [2025-03-08 12:17:01,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:17:01,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:17:01,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 12:17:02,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 12:17:02,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:17:02,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat