./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_loopvsstraightlinecode_100-1loop_file-57.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 129eb72cba2ec6662c92062b72f302d538a3dfe4c41c05f2b8937451c2edd34a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:47:56,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:47:56,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:47:56,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:47:56,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:47:56,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:47:56,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:47:56,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:47:56,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:47:56,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:47:56,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:47:56,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:47:56,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:47:56,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:47:56,825 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:47:56,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:47:56,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:47:56,825 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:47:56,826 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:47:56,826 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:47:56,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:47:56,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:47:56,827 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 -> 129eb72cba2ec6662c92062b72f302d538a3dfe4c41c05f2b8937451c2edd34a [2025-03-03 22:47:57,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:47:57,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:47:57,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:47:57,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:47:57,065 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:47:57,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i [2025-03-03 22:47:58,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3723d43b9/0254b9b8b2f54f20bc31aafff09ed089/FLAGf386ff84a [2025-03-03 22:47:58,528 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:47:58,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i [2025-03-03 22:47:58,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3723d43b9/0254b9b8b2f54f20bc31aafff09ed089/FLAGf386ff84a [2025-03-03 22:47:58,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3723d43b9/0254b9b8b2f54f20bc31aafff09ed089 [2025-03-03 22:47:58,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:47:58,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:47:58,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:47:58,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:47:58,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:47:58,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:58" (1/1) ... [2025-03-03 22:47:58,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1153dfa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:58, skipping insertion in model container [2025-03-03 22:47:58,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:58" (1/1) ... [2025-03-03 22:47:58,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:47:58,984 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_loopvsstraightlinecode_100-1loop_file-57.i[916,929] [2025-03-03 22:47:59,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:47:59,091 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:47:59,100 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_loopvsstraightlinecode_100-1loop_file-57.i[916,929] [2025-03-03 22:47:59,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:47:59,158 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:47:59,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59 WrapperNode [2025-03-03 22:47:59,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:47:59,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:47:59,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:47:59,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:47:59,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,226 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2025-03-03 22:47:59,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:47:59,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:47:59,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:47:59,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:47:59,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,265 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-03 22:47:59,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:47:59,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:47:59,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:47:59,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:47:59,302 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (1/1) ... [2025-03-03 22:47:59,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:47:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:47:59,354 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-03 22:47:59,356 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-03 22:47:59,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:47:59,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:47:59,371 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:47:59,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:47:59,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:47:59,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:47:59,433 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:47:59,434 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:47:59,789 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2025-03-03 22:47:59,824 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 22:47:59,824 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:47:59,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:47:59,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:47:59,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:59 BoogieIcfgContainer [2025-03-03 22:47:59,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:47:59,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:47:59,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:47:59,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:47:59,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:47:58" (1/3) ... [2025-03-03 22:47:59,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721378b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:59, skipping insertion in model container [2025-03-03 22:47:59,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:59" (2/3) ... [2025-03-03 22:47:59,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721378b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:59, skipping insertion in model container [2025-03-03 22:47:59,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:59" (3/3) ... [2025-03-03 22:47:59,852 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-57.i [2025-03-03 22:47:59,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:47:59,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-57.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:47:59,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:47:59,944 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;@113a4bb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:47:59,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:47:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:47:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 22:47:59,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:59,962 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:47:59,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash -681757027, now seen corresponding path program 1 times [2025-03-03 22:47:59,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:47:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120352104] [2025-03-03 22:47:59,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:59,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:48:00,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 22:48:00,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 22:48:00,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:00,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:48:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2025-03-03 22:48:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:48:00,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120352104] [2025-03-03 22:48:00,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120352104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:48:00,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937083909] [2025-03-03 22:48:00,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:48:00,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:48:00,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:48:00,281 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-03 22:48:00,282 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-03 22:48:00,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 22:48:00,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 22:48:00,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:00,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:48:00,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:48:00,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:48:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2025-03-03 22:48:00,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:48:00,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937083909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:48:00,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:48:00,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:48:00,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130880070] [2025-03-03 22:48:00,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:48:00,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:48:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:48:00,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:48:00,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:48:00,520 INFO L87 Difference]: Start difference. First operand has 110 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:48:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:48:00,546 INFO L93 Difference]: Finished difference Result 217 states and 383 transitions. [2025-03-03 22:48:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:48:00,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 227 [2025-03-03 22:48:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:48:00,553 INFO L225 Difference]: With dead ends: 217 [2025-03-03 22:48:00,553 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 22:48:00,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 228 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-03 22:48:00,558 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:48:00,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:48:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 22:48:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-03 22:48:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:48:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 170 transitions. [2025-03-03 22:48:00,604 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 170 transitions. Word has length 227 [2025-03-03 22:48:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:48:00,606 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 170 transitions. [2025-03-03 22:48:00,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:48:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 170 transitions. [2025-03-03 22:48:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 22:48:00,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:48:00,612 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:48:00,621 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-03 22:48:00,813 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-03 22:48:00,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:48:00,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:48:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1942150105, now seen corresponding path program 1 times [2025-03-03 22:48:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:48:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461733441] [2025-03-03 22:48:00,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:48:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:48:00,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 22:48:01,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 22:48:01,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:01,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:48:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 22:48:15,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:48:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461733441] [2025-03-03 22:48:15,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461733441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:48:15,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:48:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 22:48:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008374497] [2025-03-03 22:48:15,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:48:15,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:48:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:48:15,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:48:15,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:48:15,906 INFO L87 Difference]: Start difference. First operand 107 states and 170 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:48:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:48:19,187 INFO L93 Difference]: Finished difference Result 511 states and 804 transitions. [2025-03-03 22:48:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:48:19,188 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 227 [2025-03-03 22:48:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:48:19,191 INFO L225 Difference]: With dead ends: 511 [2025-03-03 22:48:19,191 INFO L226 Difference]: Without dead ends: 407 [2025-03-03 22:48:19,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2025-03-03 22:48:19,197 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1018 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:48:19,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 948 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 22:48:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-03 22:48:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 192. [2025-03-03 22:48:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:48:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 306 transitions. [2025-03-03 22:48:19,238 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 306 transitions. Word has length 227 [2025-03-03 22:48:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:48:19,241 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 306 transitions. [2025-03-03 22:48:19,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:48:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 306 transitions. [2025-03-03 22:48:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 22:48:19,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:48:19,245 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:48:19,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:48:19,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:48:19,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:48:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2071232824, now seen corresponding path program 1 times [2025-03-03 22:48:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:48:19,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201514338] [2025-03-03 22:48:19,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:48:19,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:48:19,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 22:48:19,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 22:48:19,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:19,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:48:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 22:48:36,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:48:36,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201514338] [2025-03-03 22:48:36,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201514338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:48:36,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:48:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:48:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904073713] [2025-03-03 22:48:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:48:36,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:48:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:48:36,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:48:36,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:48:36,249 INFO L87 Difference]: Start difference. First operand 192 states and 306 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:48:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:48:38,364 INFO L93 Difference]: Finished difference Result 466 states and 735 transitions. [2025-03-03 22:48:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 22:48:38,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 227 [2025-03-03 22:48:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:48:38,367 INFO L225 Difference]: With dead ends: 466 [2025-03-03 22:48:38,367 INFO L226 Difference]: Without dead ends: 362 [2025-03-03 22:48:38,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2025-03-03 22:48:38,372 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 571 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:48:38,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 927 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 22:48:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-03 22:48:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 192. [2025-03-03 22:48:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:48:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 306 transitions. [2025-03-03 22:48:38,397 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 306 transitions. Word has length 227 [2025-03-03 22:48:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:48:38,398 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 306 transitions. [2025-03-03 22:48:38,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 22:48:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 306 transitions. [2025-03-03 22:48:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 22:48:38,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:48:38,401 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:48:38,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:48:38,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:48:38,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:48:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2129889322, now seen corresponding path program 1 times [2025-03-03 22:48:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:48:38,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246733101] [2025-03-03 22:48:38,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:48:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:48:38,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 22:48:38,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 22:48:38,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:38,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:48:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 22:48:55,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:48:55,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246733101] [2025-03-03 22:48:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246733101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:48:55,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:48:55,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:48:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608332537] [2025-03-03 22:48:55,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:48:55,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:48:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:48:55,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:48:55,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:48:55,390 INFO L87 Difference]: Start difference. First operand 192 states and 306 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 22:48:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:48:58,212 INFO L93 Difference]: Finished difference Result 485 states and 768 transitions. [2025-03-03 22:48:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 22:48:58,213 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2025-03-03 22:48:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:48:58,215 INFO L225 Difference]: With dead ends: 485 [2025-03-03 22:48:58,216 INFO L226 Difference]: Without dead ends: 381 [2025-03-03 22:48:58,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2025-03-03 22:48:58,217 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 623 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:48:58,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 749 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 22:48:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-03 22:48:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 197. [2025-03-03 22:48:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 122 states have (on average 1.4098360655737705) internal successors, (172), 122 states have internal predecessors, (172), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:48:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 316 transitions. [2025-03-03 22:48:58,239 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 316 transitions. Word has length 227 [2025-03-03 22:48:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:48:58,241 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 316 transitions. [2025-03-03 22:48:58,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 22:48:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 316 transitions. [2025-03-03 22:48:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 22:48:58,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:48:58,243 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:48:58,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:48:58,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:48:58,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:48:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1654543797, now seen corresponding path program 1 times [2025-03-03 22:48:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:48:58,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250602210] [2025-03-03 22:48:58,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:48:58,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:48:58,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 22:48:58,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 22:48:58,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:58,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 22:49:14,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:49:14,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250602210] [2025-03-03 22:49:14,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250602210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:49:14,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:49:14,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 22:49:14,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389831395] [2025-03-03 22:49:14,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:49:14,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:49:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:49:14,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:49:14,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:49:14,964 INFO L87 Difference]: Start difference. First operand 197 states and 316 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 22:49:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:15,972 INFO L93 Difference]: Finished difference Result 442 states and 694 transitions. [2025-03-03 22:49:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:49:15,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2025-03-03 22:49:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:15,975 INFO L225 Difference]: With dead ends: 442 [2025-03-03 22:49:15,975 INFO L226 Difference]: Without dead ends: 338 [2025-03-03 22:49:15,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:49:15,976 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 265 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:15,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 906 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 22:49:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-03 22:49:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 209. [2025-03-03 22:49:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 134 states have (on average 1.4477611940298507) internal successors, (194), 134 states have internal predecessors, (194), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:49:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 338 transitions. [2025-03-03 22:49:15,998 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 338 transitions. Word has length 227 [2025-03-03 22:49:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:16,000 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 338 transitions. [2025-03-03 22:49:16,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 22:49:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 338 transitions. [2025-03-03 22:49:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 22:49:16,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:16,002 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:16,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:49:16,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash 839537008, now seen corresponding path program 1 times [2025-03-03 22:49:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:16,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854563416] [2025-03-03 22:49:16,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:16,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:16,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 22:49:16,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 22:49:16,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:16,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 22:49:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:49:16,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854563416] [2025-03-03 22:49:16,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854563416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:49:16,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:49:16,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:49:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494620282] [2025-03-03 22:49:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:49:16,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:49:16,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:49:16,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:49:16,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:49:16,344 INFO L87 Difference]: Start difference. First operand 209 states and 338 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 22:49:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:16,646 INFO L93 Difference]: Finished difference Result 397 states and 641 transitions. [2025-03-03 22:49:16,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:49:16,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2025-03-03 22:49:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:16,649 INFO L225 Difference]: With dead ends: 397 [2025-03-03 22:49:16,651 INFO L226 Difference]: Without dead ends: 277 [2025-03-03 22:49:16,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:49:16,652 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 182 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:16,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 638 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:49:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-03 22:49:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 216. [2025-03-03 22:49:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 141 states have (on average 1.4609929078014185) internal successors, (206), 141 states have internal predecessors, (206), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 22:49:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 350 transitions. [2025-03-03 22:49:16,666 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 350 transitions. Word has length 228 [2025-03-03 22:49:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 350 transitions. [2025-03-03 22:49:16,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 22:49:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 350 transitions. [2025-03-03 22:49:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 22:49:16,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:16,669 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:49:16,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:49:16,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:16,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash 329002831, now seen corresponding path program 1 times [2025-03-03 22:49:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838184456] [2025-03-03 22:49:16,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:16,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 22:49:16,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 22:49:16,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:16,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat