./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-66.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 472f160323a45b927913d546ba36407c4908d2f65580a236f66341d4d39cf8a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:11:44,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:11:44,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:11:44,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:11:44,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:11:44,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:11:44,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:11:44,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:11:44,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:11:44,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:11:44,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:11:44,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:11:44,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:11:44,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:11:44,515 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:11:44,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:11:44,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:11:44,515 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:11:44,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:11:44,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:11:44,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:11:44,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:11:44,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:11:44,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:11:44,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:11:44,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:11:44,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:11:44,517 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:11:44,517 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:11:44,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:11:44,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:11:44,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:11:44,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:11:44,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:11:44,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:11:44,518 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:11:44,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:11:44,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:11:44,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:11:44,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:11:44,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:11:44,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:11:44,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:11:44,519 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 -> 472f160323a45b927913d546ba36407c4908d2f65580a236f66341d4d39cf8a5 [2025-03-17 02:11:44,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:11:44,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:11:44,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:11:44,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:11:44,756 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:11:44,757 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-ps-cn_file-66.i [2025-03-17 02:11:45,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98bb92002/a701164612e64618b68a90807c601f6b/FLAGe4c7a92e7 [2025-03-17 02:11:46,231 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:11:46,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-66.i [2025-03-17 02:11:46,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98bb92002/a701164612e64618b68a90807c601f6b/FLAGe4c7a92e7 [2025-03-17 02:11:46,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98bb92002/a701164612e64618b68a90807c601f6b [2025-03-17 02:11:46,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:11:46,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:11:46,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:11:46,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:11:46,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:11:46,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46, skipping insertion in model container [2025-03-17 02:11:46,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:11:46,662 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-ps-cn_file-66.i[919,932] [2025-03-17 02:11:46,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:11:46,746 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:11:46,757 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-ps-cn_file-66.i[919,932] [2025-03-17 02:11:46,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:11:46,794 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:11:46,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46 WrapperNode [2025-03-17 02:11:46,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:11:46,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:11:46,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:11:46,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:11:46,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,837 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-03-17 02:11:46,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:11:46,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:11:46,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:11:46,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:11:46,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,863 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-17 02:11:46,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:11:46,880 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:11:46,880 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:11:46,880 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:11:46,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (1/1) ... [2025-03-17 02:11:46,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:11:46,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:11:46,917 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-17 02:11:46,924 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-17 02:11:46,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:11:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:11:46,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:11:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:11:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:11:46,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:11:47,034 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:11:47,036 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:11:47,355 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 02:11:47,355 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:11:47,365 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:11:47,365 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:11:47,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:11:47 BoogieIcfgContainer [2025-03-17 02:11:47,366 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:11:47,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:11:47,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:11:47,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:11:47,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:11:46" (1/3) ... [2025-03-17 02:11:47,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b543d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:11:47, skipping insertion in model container [2025-03-17 02:11:47,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:11:46" (2/3) ... [2025-03-17 02:11:47,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b543d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:11:47, skipping insertion in model container [2025-03-17 02:11:47,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:11:47" (3/3) ... [2025-03-17 02:11:47,374 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-66.i [2025-03-17 02:11:47,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:11:47,389 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-66.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:11:47,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:11:47,443 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;@44ad0520, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:11:47,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:11:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 02:11:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:11:47,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:11:47,463 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:11:47,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:11:47,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:11:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash -900417456, now seen corresponding path program 1 times [2025-03-17 02:11:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:11:47,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851627377] [2025-03-17 02:11:47,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:11:47,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:11:47,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:11:47,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:11:47,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:11:47,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:11:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-17 02:11:47,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:11:47,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851627377] [2025-03-17 02:11:47,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851627377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:11:47,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400112509] [2025-03-17 02:11:47,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:11:47,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:11:47,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:11:47,793 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-17 02:11:47,795 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-17 02:11:47,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:11:47,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:11:47,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:11:47,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:11:48,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:11:48,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:11:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-03-17 02:11:48,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:11:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400112509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:11:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:11:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:11:48,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830344374] [2025-03-17 02:11:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:11:48,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:11:48,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:11:48,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:11:48,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:11:48,067 INFO L87 Difference]: Start difference. First operand has 109 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) 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, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-17 02:11:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:11:48,101 INFO L93 Difference]: Finished difference Result 215 states and 396 transitions. [2025-03-17 02:11:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:11:48,102 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, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 267 [2025-03-17 02:11:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:11:48,107 INFO L225 Difference]: With dead ends: 215 [2025-03-17 02:11:48,107 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 02:11:48,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 268 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-17 02:11:48,111 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:11:48,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:11:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 02:11:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 02:11:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 02:11:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2025-03-17 02:11:48,147 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 267 [2025-03-17 02:11:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:11:48,148 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2025-03-17 02:11:48,148 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, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-17 02:11:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2025-03-17 02:11:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:11:48,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:11:48,151 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:11:48,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:11:48,356 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-17 02:11:48,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:11:48,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:11:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash 391966382, now seen corresponding path program 1 times [2025-03-17 02:11:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:11:48,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657663708] [2025-03-17 02:11:48,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:11:48,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:11:48,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:11:48,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:11:48,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:11:48,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:12:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 02:12:09,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:12:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657663708] [2025-03-17 02:12:09,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657663708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:12:09,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:12:09,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 02:12:09,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862161287] [2025-03-17 02:12:09,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:12:09,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 02:12:09,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:12:09,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 02:12:09,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:12:09,337 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:12:10,170 INFO L93 Difference]: Finished difference Result 312 states and 486 transitions. [2025-03-17 02:12:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 02:12:10,172 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), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2025-03-17 02:12:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:12:10,175 INFO L225 Difference]: With dead ends: 312 [2025-03-17 02:12:10,175 INFO L226 Difference]: Without dead ends: 206 [2025-03-17 02:12:10,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:12:10,177 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 172 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:12:10,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 905 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 02:12:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-17 02:12:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2025-03-17 02:12:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:12:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 237 transitions. [2025-03-17 02:12:10,205 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 237 transitions. Word has length 267 [2025-03-17 02:12:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:12:10,206 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 237 transitions. [2025-03-17 02:12:10,206 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), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 237 transitions. [2025-03-17 02:12:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:12:10,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:12:10,210 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:12:10,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:12:10,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:12:10,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:12:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash 391996173, now seen corresponding path program 1 times [2025-03-17 02:12:10,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:12:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586539551] [2025-03-17 02:12:10,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:12:10,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:12:10,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:12:10,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:12:10,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:12:10,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:12:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 02:12:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:12:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586539551] [2025-03-17 02:12:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586539551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:12:32,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:12:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 02:12:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704671618] [2025-03-17 02:12:32,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:12:32,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 02:12:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:12:32,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 02:12:32,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:12:32,034 INFO L87 Difference]: Start difference. First operand 150 states and 237 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:12:32,717 INFO L93 Difference]: Finished difference Result 204 states and 304 transitions. [2025-03-17 02:12:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 02:12:32,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2025-03-17 02:12:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:12:32,720 INFO L225 Difference]: With dead ends: 204 [2025-03-17 02:12:32,720 INFO L226 Difference]: Without dead ends: 202 [2025-03-17 02:12:32,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:12:32,720 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 154 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:12:32,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 905 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:12:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-17 02:12:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 150. [2025-03-17 02:12:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:12:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 237 transitions. [2025-03-17 02:12:32,734 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 237 transitions. Word has length 267 [2025-03-17 02:12:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:12:32,736 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 237 transitions. [2025-03-17 02:12:32,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 237 transitions. [2025-03-17 02:12:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:12:32,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:12:32,739 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:12:32,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:12:32,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:12:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:12:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2134776717, now seen corresponding path program 1 times [2025-03-17 02:12:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:12:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694417193] [2025-03-17 02:12:32,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:12:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:12:32,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:12:32,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:12:32,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:12:32,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:12:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 02:12:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:12:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694417193] [2025-03-17 02:12:51,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694417193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:12:51,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:12:51,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 02:12:51,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364349708] [2025-03-17 02:12:51,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:12:51,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 02:12:51,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:12:51,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 02:12:51,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:12:51,051 INFO L87 Difference]: Start difference. First operand 150 states and 237 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:12:51,682 INFO L93 Difference]: Finished difference Result 206 states and 306 transitions. [2025-03-17 02:12:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 02:12:51,682 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), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2025-03-17 02:12:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:12:51,684 INFO L225 Difference]: With dead ends: 206 [2025-03-17 02:12:51,684 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 02:12:51,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:12:51,685 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 163 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:12:51,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 914 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:12:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 02:12:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 155. [2025-03-17 02:12:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:12:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 244 transitions. [2025-03-17 02:12:51,703 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 244 transitions. Word has length 267 [2025-03-17 02:12:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:12:51,704 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 244 transitions. [2025-03-17 02:12:51,704 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), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2025-03-17 02:12:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:12:51,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:12:51,706 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:12:51,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:12:51,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:12:51,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:12:51,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2134806508, now seen corresponding path program 1 times [2025-03-17 02:12:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:12:51,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004144482] [2025-03-17 02:12:51,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:12:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:12:51,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:12:51,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:12:51,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:12:51,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:12:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 02:12:56,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:12:56,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004144482] [2025-03-17 02:12:56,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004144482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:12:56,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:12:56,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 02:12:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505397554] [2025-03-17 02:12:56,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:12:56,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 02:12:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:12:56,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 02:12:56,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:12:56,183 INFO L87 Difference]: Start difference. First operand 155 states and 244 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:12:57,108 INFO L93 Difference]: Finished difference Result 214 states and 315 transitions. [2025-03-17 02:12:57,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 02:12:57,108 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2025-03-17 02:12:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:12:57,110 INFO L225 Difference]: With dead ends: 214 [2025-03-17 02:12:57,110 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 02:12:57,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:12:57,111 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 183 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:12:57,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 828 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:12:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 02:12:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 155. [2025-03-17 02:12:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:12:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 244 transitions. [2025-03-17 02:12:57,126 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 244 transitions. Word has length 267 [2025-03-17 02:12:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:12:57,126 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 244 transitions. [2025-03-17 02:12:57,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2025-03-17 02:12:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:12:57,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:12:57,128 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:12:57,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:12:57,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:12:57,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:12:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1404984977, now seen corresponding path program 1 times [2025-03-17 02:12:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:12:57,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599054349] [2025-03-17 02:12:57,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:12:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:12:57,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:12:57,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:12:57,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:12:57,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:12:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 02:12:57,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:12:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599054349] [2025-03-17 02:12:57,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599054349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:12:57,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:12:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:12:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167631705] [2025-03-17 02:12:57,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:12:57,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:12:57,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:12:57,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:12:57,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:12:57,206 INFO L87 Difference]: Start difference. First operand 155 states and 244 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:12:57,244 INFO L93 Difference]: Finished difference Result 439 states and 695 transitions. [2025-03-17 02:12:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:12:57,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2025-03-17 02:12:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:12:57,249 INFO L225 Difference]: With dead ends: 439 [2025-03-17 02:12:57,249 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 02:12:57,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:12:57,250 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 162 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:12:57,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 485 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:12:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 02:12:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2025-03-17 02:12:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 184 states have internal predecessors, (249), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 94 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 02:12:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 441 transitions. [2025-03-17 02:12:57,270 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 441 transitions. Word has length 267 [2025-03-17 02:12:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:12:57,271 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 441 transitions. [2025-03-17 02:12:57,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 441 transitions. [2025-03-17 02:12:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:12:57,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:12:57,273 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:12:57,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:12:57,273 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:12:57,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:12:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash -517481296, now seen corresponding path program 1 times [2025-03-17 02:12:57,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:12:57,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902402782] [2025-03-17 02:12:57,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:12:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:12:57,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:12:57,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:12:57,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:12:57,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:12:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 02:12:57,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:12:57,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902402782] [2025-03-17 02:12:57,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902402782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:12:57,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:12:57,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:12:57,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537395107] [2025-03-17 02:12:57,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:12:57,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:12:57,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:12:57,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:12:57,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:12:57,401 INFO L87 Difference]: Start difference. First operand 283 states and 441 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:57,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:12:57,663 INFO L93 Difference]: Finished difference Result 837 states and 1294 transitions. [2025-03-17 02:12:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:12:57,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2025-03-17 02:12:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:12:57,668 INFO L225 Difference]: With dead ends: 837 [2025-03-17 02:12:57,669 INFO L226 Difference]: Without dead ends: 555 [2025-03-17 02:12:57,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:12:57,671 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 109 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:12:57,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 504 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:12:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-17 02:12:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 514. [2025-03-17 02:12:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 317 states have (on average 1.3470031545741326) internal successors, (427), 320 states have internal predecessors, (427), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 185 states have call predecessors, (188), 188 states have call successors, (188) [2025-03-17 02:12:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 803 transitions. [2025-03-17 02:12:57,712 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 803 transitions. Word has length 267 [2025-03-17 02:12:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:12:57,712 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 803 transitions. [2025-03-17 02:12:57,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:12:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 803 transitions. [2025-03-17 02:12:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:12:57,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:12:57,714 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:12:57,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:12:57,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:12:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:12:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1225329039, now seen corresponding path program 1 times [2025-03-17 02:12:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:12:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531683060] [2025-03-17 02:12:57,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:12:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:12:57,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:12:57,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:12:57,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:12:57,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:12:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 02:12:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:12:59,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531683060] [2025-03-17 02:12:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531683060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:12:59,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:12:59,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:12:59,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424319207] [2025-03-17 02:12:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:12:59,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:12:59,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:12:59,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:12:59,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:12:59,757 INFO L87 Difference]: Start difference. First operand 514 states and 803 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, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:13:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:13:00,461 INFO L93 Difference]: Finished difference Result 648 states and 958 transitions. [2025-03-17 02:13:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:13:00,461 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, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2025-03-17 02:13:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:13:00,465 INFO L225 Difference]: With dead ends: 648 [2025-03-17 02:13:00,465 INFO L226 Difference]: Without dead ends: 646 [2025-03-17 02:13:00,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:13:00,466 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 309 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:13:00,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 701 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 02:13:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-17 02:13:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 565. [2025-03-17 02:13:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 357 states have (on average 1.330532212885154) internal successors, (475), 362 states have internal predecessors, (475), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 02:13:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 867 transitions. [2025-03-17 02:13:00,508 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 867 transitions. Word has length 267 [2025-03-17 02:13:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:13:00,508 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 867 transitions. [2025-03-17 02:13:00,509 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, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:13:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 867 transitions. [2025-03-17 02:13:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:13:00,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:13:00,510 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:13:00,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:13:00,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:13:00,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:13:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1225358830, now seen corresponding path program 1 times [2025-03-17 02:13:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:13:00,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041500462] [2025-03-17 02:13:00,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:13:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:13:00,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:13:00,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:13:00,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:13:00,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:13:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 02:13:03,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:13:03,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041500462] [2025-03-17 02:13:03,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041500462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:13:03,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:13:03,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:13:03,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003842209] [2025-03-17 02:13:03,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:13:03,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:13:03,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:13:03,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:13:03,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:13:03,212 INFO L87 Difference]: Start difference. First operand 565 states and 867 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:13:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:13:04,489 INFO L93 Difference]: Finished difference Result 646 states and 956 transitions. [2025-03-17 02:13:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:13:04,490 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), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 267 [2025-03-17 02:13:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:13:04,494 INFO L225 Difference]: With dead ends: 646 [2025-03-17 02:13:04,495 INFO L226 Difference]: Without dead ends: 644 [2025-03-17 02:13:04,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:13:04,498 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 284 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:13:04,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 691 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:13:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-17 02:13:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 565. [2025-03-17 02:13:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 357 states have (on average 1.330532212885154) internal successors, (475), 362 states have internal predecessors, (475), 196 states have call successors, (196), 11 states have call predecessors, (196), 11 states have return successors, (196), 191 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-17 02:13:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 867 transitions. [2025-03-17 02:13:04,549 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 867 transitions. Word has length 267 [2025-03-17 02:13:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:13:04,549 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 867 transitions. [2025-03-17 02:13:04,550 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), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-03-17 02:13:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 867 transitions. [2025-03-17 02:13:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-17 02:13:04,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:13:04,551 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:13:04,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:13:04,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:13:04,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:13:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash 521049101, now seen corresponding path program 1 times [2025-03-17 02:13:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:13:04,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535839538] [2025-03-17 02:13:04,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:13:04,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:13:04,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 02:13:04,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 02:13:04,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:13:04,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:13:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-03-17 02:13:04,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:13:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535839538] [2025-03-17 02:13:04,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535839538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:13:04,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:13:04,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:13:04,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523719890] [2025-03-17 02:13:04,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:13:04,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:13:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:13:04,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:13:04,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:13:04,891 INFO L87 Difference]: Start difference. First operand 565 states and 867 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-17 02:13:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:13:05,180 INFO L93 Difference]: Finished difference Result 1040 states and 1579 transitions. [2025-03-17 02:13:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:13:05,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 267 [2025-03-17 02:13:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:13:05,188 INFO L225 Difference]: With dead ends: 1040 [2025-03-17 02:13:05,188 INFO L226 Difference]: Without dead ends: 572 [2025-03-17 02:13:05,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:13:05,190 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 161 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:13:05,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 270 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:13:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-17 02:13:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 563. [2025-03-17 02:13:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 349 states have (on average 1.3008595988538683) internal successors, (454), 354 states have internal predecessors, (454), 200 states have call successors, (200), 13 states have call predecessors, (200), 13 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-17 02:13:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 854 transitions. [2025-03-17 02:13:05,236 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 854 transitions. Word has length 267 [2025-03-17 02:13:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:13:05,237 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 854 transitions. [2025-03-17 02:13:05,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-17 02:13:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 854 transitions. [2025-03-17 02:13:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-17 02:13:05,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:13:05,238 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:13:05,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:13:05,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:13:05,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:13:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1797768282, now seen corresponding path program 1 times [2025-03-17 02:13:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:13:05,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335390664] [2025-03-17 02:13:05,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:13:05,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:13:05,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 02:13:05,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 02:13:05,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:13:05,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:13:05,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965872847] [2025-03-17 02:13:05,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:13:05,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:13:05,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:13:05,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:13:05,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:13:05,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-17 02:13:05,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-17 02:13:05,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:13:05,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:13:05,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 02:13:05,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:13:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1232 proven. 414 refuted. 0 times theorem prover too weak. 2138 trivial. 0 not checked. [2025-03-17 02:13:10,280 INFO L312 TraceCheckSpWp]: Computing backward predicates...