./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.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_loopvsstraightlinecode_100-while_file-31.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 6172bcf472a886b23306a046bd0a20ff775f8e0d008adc455f4ef56119e5614f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:15:29,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:15:29,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:15:29,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:15:29,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:15:29,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:15:29,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:15:29,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:15:29,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:15:29,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:15:29,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:15:29,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:15:29,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:15:29,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:15:29,496 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:15:29,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:15:29,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:15:29,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:15:29,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:15:29,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:15:29,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:15:29,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:15:29,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:15:29,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:15:29,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:15:29,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:15:29,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:15:29,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:15:29,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:15:29,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:15:29,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:15:29,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:15:29,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:15:29,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:15:29,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:15:29,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:15:29,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:15:29,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:15:29,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:15:29,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:15:29,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:15:29,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:15:29,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:15:29,500 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 -> 6172bcf472a886b23306a046bd0a20ff775f8e0d008adc455f4ef56119e5614f [2025-03-17 03:15:29,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:15:29,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:15:29,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:15:29,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:15:29,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:15:29,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i [2025-03-17 03:15:30,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42f625a1/785dc5db655c4e74889bd50b08404881/FLAGec5278d16 [2025-03-17 03:15:31,126 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:15:31,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i [2025-03-17 03:15:31,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42f625a1/785dc5db655c4e74889bd50b08404881/FLAGec5278d16 [2025-03-17 03:15:31,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42f625a1/785dc5db655c4e74889bd50b08404881 [2025-03-17 03:15:31,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:15:31,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:15:31,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:15:31,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:15:31,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:15:31,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20392ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31, skipping insertion in model container [2025-03-17 03:15:31,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:15:31,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i[916,929] [2025-03-17 03:15:31,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:15:31,369 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:15:31,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-31.i[916,929] [2025-03-17 03:15:31,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:15:31,452 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:15:31,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31 WrapperNode [2025-03-17 03:15:31,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:15:31,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:15:31,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:15:31,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:15:31,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,515 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2025-03-17 03:15:31,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:15:31,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:15:31,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:15:31,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:15:31,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,544 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 03:15:31,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:15:31,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:15:31,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:15:31,573 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:15:31,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (1/1) ... [2025-03-17 03:15:31,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:15:31,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:15:31,601 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 03:15:31,605 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 03:15:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:15:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:15:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:15:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:15:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:15:31,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:15:31,687 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:15:31,689 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:15:32,093 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc property_#t~ite25#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1; [2025-03-17 03:15:32,120 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-03-17 03:15:32,121 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:15:32,142 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:15:32,143 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:15:32,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:15:32 BoogieIcfgContainer [2025-03-17 03:15:32,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:15:32,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:15:32,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:15:32,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:15:32,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:15:31" (1/3) ... [2025-03-17 03:15:32,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297080d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:15:32, skipping insertion in model container [2025-03-17 03:15:32,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:15:31" (2/3) ... [2025-03-17 03:15:32,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297080d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:15:32, skipping insertion in model container [2025-03-17 03:15:32,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:15:32" (3/3) ... [2025-03-17 03:15:32,151 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-31.i [2025-03-17 03:15:32,163 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:15:32,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-31.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:15:32,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:15:32,219 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;@2795dd22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:15:32,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:15:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:15:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 03:15:32,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:32,237 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:32,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:32,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash -560247997, now seen corresponding path program 1 times [2025-03-17 03:15:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486032535] [2025-03-17 03:15:32,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:32,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 03:15:32,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 03:15:32,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:32,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 03:15:32,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:32,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486032535] [2025-03-17 03:15:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486032535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:15:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988424502] [2025-03-17 03:15:32,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:32,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:15:32,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:15:32,548 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 03:15:32,549 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 03:15:32,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 03:15:32,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 03:15:32,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:32,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:32,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:15:32,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:15:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 03:15:32,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:15:32,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988424502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:32,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:15:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:15:32,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748491374] [2025-03-17 03:15:32,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:32,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:15:32,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:32,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:15:32,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:15:32,745 INFO L87 Difference]: Start difference. First operand has 101 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:15:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:32,784 INFO L93 Difference]: Finished difference Result 189 states and 327 transitions. [2025-03-17 03:15:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:15:32,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-03-17 03:15:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:32,796 INFO L225 Difference]: With dead ends: 189 [2025-03-17 03:15:32,797 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 03:15:32,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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 03:15:32,805 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:32,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:15:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 03:15:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 03:15:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 03:15:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2025-03-17 03:15:32,857 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 139 transitions. Word has length 169 [2025-03-17 03:15:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:32,857 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 139 transitions. [2025-03-17 03:15:32,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:15:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 139 transitions. [2025-03-17 03:15:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 03:15:32,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:32,861 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:32,869 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 03:15:33,062 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 03:15:33,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:33,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:33,064 INFO L85 PathProgramCache]: Analyzing trace with hash 274263911, now seen corresponding path program 1 times [2025-03-17 03:15:33,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:33,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791258910] [2025-03-17 03:15:33,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:33,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:33,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 03:15:33,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 03:15:33,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:33,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:33,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:33,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791258910] [2025-03-17 03:15:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791258910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:33,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:15:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147756693] [2025-03-17 03:15:33,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:33,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:15:33,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:33,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:15:33,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:15:33,611 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:33,816 INFO L93 Difference]: Finished difference Result 266 states and 416 transitions. [2025-03-17 03:15:33,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:15:33,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2025-03-17 03:15:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:33,821 INFO L225 Difference]: With dead ends: 266 [2025-03-17 03:15:33,821 INFO L226 Difference]: Without dead ends: 178 [2025-03-17 03:15:33,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:15:33,824 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 88 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:33,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 374 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:15:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-17 03:15:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 147. [2025-03-17 03:15:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 03:15:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 231 transitions. [2025-03-17 03:15:33,859 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 231 transitions. Word has length 169 [2025-03-17 03:15:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:33,860 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 231 transitions. [2025-03-17 03:15:33,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 231 transitions. [2025-03-17 03:15:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 03:15:33,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:33,864 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:15:33,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2035423240, now seen corresponding path program 1 times [2025-03-17 03:15:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694235459] [2025-03-17 03:15:33,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:33,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:33,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 03:15:33,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 03:15:33,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:33,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:34,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:34,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694235459] [2025-03-17 03:15:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694235459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:34,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:34,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:15:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994240649] [2025-03-17 03:15:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:34,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:15:34,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:34,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:15:34,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:15:34,240 INFO L87 Difference]: Start difference. First operand 147 states and 231 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:34,426 INFO L93 Difference]: Finished difference Result 266 states and 415 transitions. [2025-03-17 03:15:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:15:34,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2025-03-17 03:15:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:34,429 INFO L225 Difference]: With dead ends: 266 [2025-03-17 03:15:34,431 INFO L226 Difference]: Without dead ends: 178 [2025-03-17 03:15:34,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:15:34,434 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 86 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:34,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 376 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:15:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-17 03:15:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 148. [2025-03-17 03:15:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 03:15:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 232 transitions. [2025-03-17 03:15:34,467 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 232 transitions. Word has length 170 [2025-03-17 03:15:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:34,467 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 232 transitions. [2025-03-17 03:15:34,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 232 transitions. [2025-03-17 03:15:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 03:15:34,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:34,470 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:34,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:15:34,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:34,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1302094488, now seen corresponding path program 1 times [2025-03-17 03:15:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:34,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202995760] [2025-03-17 03:15:34,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:34,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 03:15:34,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 03:15:34,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:34,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:35,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:35,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202995760] [2025-03-17 03:15:35,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202995760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:35,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:35,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:15:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270833355] [2025-03-17 03:15:35,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:35,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:15:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:35,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:15:35,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:15:35,192 INFO L87 Difference]: Start difference. First operand 148 states and 232 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:35,757 INFO L93 Difference]: Finished difference Result 362 states and 556 transitions. [2025-03-17 03:15:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:15:35,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-17 03:15:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:35,761 INFO L225 Difference]: With dead ends: 362 [2025-03-17 03:15:35,761 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 03:15:35,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:15:35,762 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 477 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:35,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 627 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:15:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 03:15:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 236. [2025-03-17 03:15:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 153 states have internal predecessors, (205), 78 states have call successors, (78), 5 states have call predecessors, (78), 5 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 03:15:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 361 transitions. [2025-03-17 03:15:35,801 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 361 transitions. Word has length 171 [2025-03-17 03:15:35,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:35,802 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 361 transitions. [2025-03-17 03:15:35,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 361 transitions. [2025-03-17 03:15:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 03:15:35,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:35,805 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:35,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:15:35,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:35,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:35,806 INFO L85 PathProgramCache]: Analyzing trace with hash 440715847, now seen corresponding path program 1 times [2025-03-17 03:15:35,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:35,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072897836] [2025-03-17 03:15:35,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:35,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 03:15:35,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 03:15:35,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:35,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:36,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072897836] [2025-03-17 03:15:36,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072897836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:36,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:36,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:15:36,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950083850] [2025-03-17 03:15:36,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:36,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:15:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:36,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:15:36,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:15:36,251 INFO L87 Difference]: Start difference. First operand 236 states and 361 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:36,663 INFO L93 Difference]: Finished difference Result 773 states and 1157 transitions. [2025-03-17 03:15:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:15:36,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-17 03:15:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:36,668 INFO L225 Difference]: With dead ends: 773 [2025-03-17 03:15:36,669 INFO L226 Difference]: Without dead ends: 621 [2025-03-17 03:15:36,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:15:36,670 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 322 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:36,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 569 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:15:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-17 03:15:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 424. [2025-03-17 03:15:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 318 states have (on average 1.371069182389937) internal successors, (436), 321 states have internal predecessors, (436), 96 states have call successors, (96), 9 states have call predecessors, (96), 9 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 03:15:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 628 transitions. [2025-03-17 03:15:36,740 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 628 transitions. Word has length 171 [2025-03-17 03:15:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:36,741 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 628 transitions. [2025-03-17 03:15:36,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 628 transitions. [2025-03-17 03:15:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 03:15:36,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:36,743 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:36,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:15:36,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:36,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1366738616, now seen corresponding path program 1 times [2025-03-17 03:15:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:36,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797249452] [2025-03-17 03:15:36,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:36,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:36,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 03:15:36,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 03:15:36,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:36,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:37,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797249452] [2025-03-17 03:15:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797249452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:37,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:15:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552599279] [2025-03-17 03:15:37,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:37,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:15:37,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:37,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:15:37,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:15:37,050 INFO L87 Difference]: Start difference. First operand 424 states and 628 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:37,222 INFO L93 Difference]: Finished difference Result 825 states and 1228 transitions. [2025-03-17 03:15:37,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:15:37,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-03-17 03:15:37,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:37,226 INFO L225 Difference]: With dead ends: 825 [2025-03-17 03:15:37,226 INFO L226 Difference]: Without dead ends: 458 [2025-03-17 03:15:37,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:15:37,227 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 93 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:37,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 386 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:15:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-17 03:15:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 405. [2025-03-17 03:15:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 299 states have (on average 1.3612040133779264) internal successors, (407), 302 states have internal predecessors, (407), 96 states have call successors, (96), 9 states have call predecessors, (96), 9 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 03:15:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 599 transitions. [2025-03-17 03:15:37,267 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 599 transitions. Word has length 171 [2025-03-17 03:15:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:37,268 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 599 transitions. [2025-03-17 03:15:37,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 599 transitions. [2025-03-17 03:15:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 03:15:37,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:37,269 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:37,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:15:37,270 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:37,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:37,270 INFO L85 PathProgramCache]: Analyzing trace with hash -746745783, now seen corresponding path program 1 times [2025-03-17 03:15:37,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:37,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095795614] [2025-03-17 03:15:37,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:37,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:37,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 03:15:37,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 03:15:37,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:37,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095795614] [2025-03-17 03:15:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095795614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:15:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133338519] [2025-03-17 03:15:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:37,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:15:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:37,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:15:37,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:15:37,811 INFO L87 Difference]: Start difference. First operand 405 states and 599 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:38,218 INFO L93 Difference]: Finished difference Result 867 states and 1273 transitions. [2025-03-17 03:15:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:15:38,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-17 03:15:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:38,222 INFO L225 Difference]: With dead ends: 867 [2025-03-17 03:15:38,222 INFO L226 Difference]: Without dead ends: 633 [2025-03-17 03:15:38,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:15:38,228 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 256 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:38,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 498 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:15:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-17 03:15:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 380. [2025-03-17 03:15:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 293 states have (on average 1.3686006825938566) internal successors, (401), 296 states have internal predecessors, (401), 75 states have call successors, (75), 11 states have call predecessors, (75), 11 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-17 03:15:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 551 transitions. [2025-03-17 03:15:38,280 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 551 transitions. Word has length 172 [2025-03-17 03:15:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:38,281 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 551 transitions. [2025-03-17 03:15:38,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 551 transitions. [2025-03-17 03:15:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 03:15:38,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:38,282 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:38,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:15:38,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:38,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1740767050, now seen corresponding path program 1 times [2025-03-17 03:15:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819794940] [2025-03-17 03:15:38,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:38,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:38,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 03:15:38,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 03:15:38,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:38,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:38,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:38,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819794940] [2025-03-17 03:15:38,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819794940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:38,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:38,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:15:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101239793] [2025-03-17 03:15:38,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:38,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:15:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:38,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:15:38,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:15:38,533 INFO L87 Difference]: Start difference. First operand 380 states and 551 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:38,792 INFO L93 Difference]: Finished difference Result 850 states and 1249 transitions. [2025-03-17 03:15:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 03:15:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-17 03:15:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:38,796 INFO L225 Difference]: With dead ends: 850 [2025-03-17 03:15:38,796 INFO L226 Difference]: Without dead ends: 576 [2025-03-17 03:15:38,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:15:38,800 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 210 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:38,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 640 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:15:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-17 03:15:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 454. [2025-03-17 03:15:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 325 states have (on average 1.3261538461538462) internal successors, (431), 329 states have internal predecessors, (431), 114 states have call successors, (114), 14 states have call predecessors, (114), 14 states have return successors, (114), 110 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 03:15:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 659 transitions. [2025-03-17 03:15:38,864 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 659 transitions. Word has length 172 [2025-03-17 03:15:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:38,864 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 659 transitions. [2025-03-17 03:15:38,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 659 transitions. [2025-03-17 03:15:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 03:15:38,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:38,866 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:38,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:15:38,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:38,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash -297289239, now seen corresponding path program 1 times [2025-03-17 03:15:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58524788] [2025-03-17 03:15:38,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:38,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 03:15:38,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 03:15:38,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:38,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58524788] [2025-03-17 03:15:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58524788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:41,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:15:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017158514] [2025-03-17 03:15:41,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:41,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:15:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:41,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:15:41,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:15:41,697 INFO L87 Difference]: Start difference. First operand 454 states and 659 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:42,392 INFO L93 Difference]: Finished difference Result 858 states and 1241 transitions. [2025-03-17 03:15:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:15:42,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-17 03:15:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:42,397 INFO L225 Difference]: With dead ends: 858 [2025-03-17 03:15:42,397 INFO L226 Difference]: Without dead ends: 545 [2025-03-17 03:15:42,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:15:42,399 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 145 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:42,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 492 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:15:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-17 03:15:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 468. [2025-03-17 03:15:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 339 states have (on average 1.3244837758112094) internal successors, (449), 343 states have internal predecessors, (449), 114 states have call successors, (114), 14 states have call predecessors, (114), 14 states have return successors, (114), 110 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 03:15:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 677 transitions. [2025-03-17 03:15:42,447 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 677 transitions. Word has length 172 [2025-03-17 03:15:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:42,448 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 677 transitions. [2025-03-17 03:15:42,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 677 transitions. [2025-03-17 03:15:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 03:15:42,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:42,451 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:42,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:15:42,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:42,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1993710089, now seen corresponding path program 1 times [2025-03-17 03:15:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703285589] [2025-03-17 03:15:42,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:42,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 03:15:42,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 03:15:42,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:42,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:44,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:44,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703285589] [2025-03-17 03:15:44,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703285589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:44,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:44,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:15:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105667744] [2025-03-17 03:15:44,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:44,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:15:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:44,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:15:44,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:15:44,980 INFO L87 Difference]: Start difference. First operand 468 states and 677 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:45,980 INFO L93 Difference]: Finished difference Result 868 states and 1249 transitions. [2025-03-17 03:15:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:15:45,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-17 03:15:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:45,987 INFO L225 Difference]: With dead ends: 868 [2025-03-17 03:15:45,987 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 03:15:45,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:15:45,989 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 178 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:45,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 679 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:15:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 03:15:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 468. [2025-03-17 03:15:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 339 states have (on average 1.3244837758112094) internal successors, (449), 343 states have internal predecessors, (449), 114 states have call successors, (114), 14 states have call predecessors, (114), 14 states have return successors, (114), 110 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-17 03:15:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 677 transitions. [2025-03-17 03:15:46,036 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 677 transitions. Word has length 172 [2025-03-17 03:15:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:46,036 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 677 transitions. [2025-03-17 03:15:46,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 677 transitions. [2025-03-17 03:15:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 03:15:46,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:46,040 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:46,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 03:15:46,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 186255626, now seen corresponding path program 1 times [2025-03-17 03:15:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458679067] [2025-03-17 03:15:46,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:46,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 03:15:46,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 03:15:46,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:46,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:46,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:46,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458679067] [2025-03-17 03:15:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458679067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:46,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:46,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:15:46,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790947434] [2025-03-17 03:15:46,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:46,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:15:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:46,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:15:46,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:15:46,340 INFO L87 Difference]: Start difference. First operand 468 states and 677 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:46,794 INFO L93 Difference]: Finished difference Result 908 states and 1321 transitions. [2025-03-17 03:15:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:15:46,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-03-17 03:15:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:46,798 INFO L225 Difference]: With dead ends: 908 [2025-03-17 03:15:46,798 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 03:15:46,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:15:46,800 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 314 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:46,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 632 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:15:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 03:15:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 528. [2025-03-17 03:15:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 363 states have (on average 1.2947658402203857) internal successors, (470), 367 states have internal predecessors, (470), 148 states have call successors, (148), 16 states have call predecessors, (148), 16 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-17 03:15:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 766 transitions. [2025-03-17 03:15:46,850 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 766 transitions. Word has length 172 [2025-03-17 03:15:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:46,851 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 766 transitions. [2025-03-17 03:15:46,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 766 transitions. [2025-03-17 03:15:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 03:15:46,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:46,852 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:46,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 03:15:46,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:46,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash 303423535, now seen corresponding path program 1 times [2025-03-17 03:15:46,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:46,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382094930] [2025-03-17 03:15:46,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:46,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 03:15:46,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 03:15:46,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:46,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:47,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382094930] [2025-03-17 03:15:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382094930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:47,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:47,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:15:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75153343] [2025-03-17 03:15:47,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:47,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:15:47,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:47,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:15:47,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:15:47,264 INFO L87 Difference]: Start difference. First operand 528 states and 766 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:47,520 INFO L93 Difference]: Finished difference Result 1085 states and 1577 transitions. [2025-03-17 03:15:47,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:15:47,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-03-17 03:15:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:47,527 INFO L225 Difference]: With dead ends: 1085 [2025-03-17 03:15:47,527 INFO L226 Difference]: Without dead ends: 732 [2025-03-17 03:15:47,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:15:47,529 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 106 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:47,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 522 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:15:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-17 03:15:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 579. [2025-03-17 03:15:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 414 states have (on average 1.3236714975845412) internal successors, (548), 418 states have internal predecessors, (548), 148 states have call successors, (148), 16 states have call predecessors, (148), 16 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-17 03:15:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 844 transitions. [2025-03-17 03:15:47,582 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 844 transitions. Word has length 173 [2025-03-17 03:15:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:47,582 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 844 transitions. [2025-03-17 03:15:47,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 844 transitions. [2025-03-17 03:15:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 03:15:47,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:47,584 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:47,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 03:15:47,584 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:47,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1504030928, now seen corresponding path program 1 times [2025-03-17 03:15:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074697059] [2025-03-17 03:15:47,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:47,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 03:15:47,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 03:15:47,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:47,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074697059] [2025-03-17 03:15:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074697059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:50,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:50,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 03:15:50,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876878715] [2025-03-17 03:15:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:50,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 03:15:50,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:50,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 03:15:50,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:15:50,711 INFO L87 Difference]: Start difference. First operand 579 states and 844 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:53,170 INFO L93 Difference]: Finished difference Result 1007 states and 1469 transitions. [2025-03-17 03:15:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 03:15:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-03-17 03:15:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:53,175 INFO L225 Difference]: With dead ends: 1007 [2025-03-17 03:15:53,175 INFO L226 Difference]: Without dead ends: 628 [2025-03-17 03:15:53,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2025-03-17 03:15:53,177 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 464 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:53,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 904 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 03:15:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-17 03:15:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 581. [2025-03-17 03:15:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 416 states have (on average 1.3245192307692308) internal successors, (551), 420 states have internal predecessors, (551), 148 states have call successors, (148), 16 states have call predecessors, (148), 16 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-17 03:15:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 847 transitions. [2025-03-17 03:15:53,235 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 847 transitions. Word has length 173 [2025-03-17 03:15:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:53,235 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 847 transitions. [2025-03-17 03:15:53,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 847 transitions. [2025-03-17 03:15:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 03:15:53,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:53,238 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:53,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 03:15:53,238 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:53,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash 786968400, now seen corresponding path program 1 times [2025-03-17 03:15:53,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:53,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324456725] [2025-03-17 03:15:53,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:53,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:53,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 03:15:53,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 03:15:53,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:53,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324456725] [2025-03-17 03:15:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324456725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:55,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:55,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:15:55,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843014544] [2025-03-17 03:15:55,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:55,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:15:55,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:55,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:15:55,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:15:55,502 INFO L87 Difference]: Start difference. First operand 581 states and 847 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:57,021 INFO L93 Difference]: Finished difference Result 1477 states and 2147 transitions. [2025-03-17 03:15:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 03:15:57,022 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-03-17 03:15:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:57,029 INFO L225 Difference]: With dead ends: 1477 [2025-03-17 03:15:57,030 INFO L226 Difference]: Without dead ends: 1098 [2025-03-17 03:15:57,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:15:57,032 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 273 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:57,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 951 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:15:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-03-17 03:15:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 980. [2025-03-17 03:15:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 710 states have (on average 1.3464788732394366) internal successors, (956), 717 states have internal predecessors, (956), 244 states have call successors, (244), 25 states have call predecessors, (244), 25 states have return successors, (244), 237 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-17 03:15:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1444 transitions. [2025-03-17 03:15:57,107 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1444 transitions. Word has length 173 [2025-03-17 03:15:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:57,107 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1444 transitions. [2025-03-17 03:15:57,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2025-03-17 03:15:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 03:15:57,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:57,110 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:57,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:15:57,110 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:57,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash 432506254, now seen corresponding path program 1 times [2025-03-17 03:15:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857155831] [2025-03-17 03:15:57,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:57,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 03:15:57,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 03:15:57,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:57,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:15:58,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:15:58,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857155831] [2025-03-17 03:15:58,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857155831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:15:58,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:15:58,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:15:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560194730] [2025-03-17 03:15:58,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:15:58,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:15:58,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:15:58,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:15:58,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:15:58,075 INFO L87 Difference]: Start difference. First operand 980 states and 1444 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:59,032 INFO L93 Difference]: Finished difference Result 1773 states and 2619 transitions. [2025-03-17 03:15:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:15:59,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-03-17 03:15:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:59,041 INFO L225 Difference]: With dead ends: 1773 [2025-03-17 03:15:59,041 INFO L226 Difference]: Without dead ends: 1054 [2025-03-17 03:15:59,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:15:59,046 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 421 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:59,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 836 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:15:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-03-17 03:15:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 983. [2025-03-17 03:15:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 713 states have (on average 1.3464235624123422) internal successors, (960), 720 states have internal predecessors, (960), 244 states have call successors, (244), 25 states have call predecessors, (244), 25 states have return successors, (244), 237 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-17 03:15:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1448 transitions. [2025-03-17 03:15:59,159 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1448 transitions. Word has length 173 [2025-03-17 03:15:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:59,159 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1448 transitions. [2025-03-17 03:15:59,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:15:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1448 transitions. [2025-03-17 03:15:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 03:15:59,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:59,162 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:15:59,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 03:15:59,162 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:59,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:59,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1374948209, now seen corresponding path program 1 times [2025-03-17 03:15:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:15:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662385626] [2025-03-17 03:15:59,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:15:59,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 03:15:59,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 03:15:59,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:59,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:16:01,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:01,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662385626] [2025-03-17 03:16:01,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662385626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:01,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:16:01,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:16:01,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714178027] [2025-03-17 03:16:01,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:01,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:16:01,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:01,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:16:01,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:16:01,030 INFO L87 Difference]: Start difference. First operand 983 states and 1448 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:16:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:02,151 INFO L93 Difference]: Finished difference Result 1773 states and 2615 transitions. [2025-03-17 03:16:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:16:02,152 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-03-17 03:16:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:02,158 INFO L225 Difference]: With dead ends: 1773 [2025-03-17 03:16:02,159 INFO L226 Difference]: Without dead ends: 1060 [2025-03-17 03:16:02,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:16:02,161 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 47 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:02,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 774 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:16:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-03-17 03:16:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1003. [2025-03-17 03:16:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 733 states have (on average 1.3424283765347886) internal successors, (984), 740 states have internal predecessors, (984), 244 states have call successors, (244), 25 states have call predecessors, (244), 25 states have return successors, (244), 237 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-17 03:16:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1472 transitions. [2025-03-17 03:16:02,234 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1472 transitions. Word has length 173 [2025-03-17 03:16:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:02,235 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1472 transitions. [2025-03-17 03:16:02,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:16:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1472 transitions. [2025-03-17 03:16:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 03:16:02,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:02,236 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:16:02,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 03:16:02,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:02,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:02,237 INFO L85 PathProgramCache]: Analyzing trace with hash 916051119, now seen corresponding path program 1 times [2025-03-17 03:16:02,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:02,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526150118] [2025-03-17 03:16:02,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:02,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:02,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 03:16:02,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 03:16:02,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:02,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:16:03,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:03,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526150118] [2025-03-17 03:16:03,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526150118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:03,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:16:03,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:16:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631387778] [2025-03-17 03:16:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:03,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:16:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:03,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:16:03,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:16:03,326 INFO L87 Difference]: Start difference. First operand 1003 states and 1472 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:16:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:03,640 INFO L93 Difference]: Finished difference Result 1805 states and 2654 transitions. [2025-03-17 03:16:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:16:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-03-17 03:16:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:03,646 INFO L225 Difference]: With dead ends: 1805 [2025-03-17 03:16:03,646 INFO L226 Difference]: Without dead ends: 1076 [2025-03-17 03:16:03,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:16:03,649 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 54 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:03,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 612 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:16:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-03-17 03:16:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 999. [2025-03-17 03:16:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 729 states have (on average 1.3429355281207134) internal successors, (979), 736 states have internal predecessors, (979), 244 states have call successors, (244), 25 states have call predecessors, (244), 25 states have return successors, (244), 237 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-17 03:16:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1467 transitions. [2025-03-17 03:16:03,717 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1467 transitions. Word has length 173 [2025-03-17 03:16:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:03,718 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1467 transitions. [2025-03-17 03:16:03,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:16:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1467 transitions. [2025-03-17 03:16:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 03:16:03,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:03,719 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:16:03,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 03:16:03,720 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:03,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:03,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1756775541, now seen corresponding path program 1 times [2025-03-17 03:16:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:03,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366330298] [2025-03-17 03:16:03,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:03,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:03,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 03:16:03,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 03:16:03,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:03,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 03:16:04,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366330298] [2025-03-17 03:16:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366330298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:16:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925922252] [2025-03-17 03:16:04,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:04,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:04,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:04,071 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 03:16:04,076 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 03:16:04,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 03:16:04,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 03:16:04,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:04,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:04,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 03:16:04,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-17 03:16:04,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:16:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2025-03-17 03:16:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925922252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:16:04,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:16:04,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2025-03-17 03:16:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300732811] [2025-03-17 03:16:04,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:16:04,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:16:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:04,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:16:04,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:16:04,592 INFO L87 Difference]: Start difference. First operand 999 states and 1467 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-17 03:16:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:05,227 INFO L93 Difference]: Finished difference Result 1941 states and 2810 transitions. [2025-03-17 03:16:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 03:16:05,227 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 174 [2025-03-17 03:16:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:05,234 INFO L225 Difference]: With dead ends: 1941 [2025-03-17 03:16:05,234 INFO L226 Difference]: Without dead ends: 1188 [2025-03-17 03:16:05,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 341 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2025-03-17 03:16:05,238 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 219 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:05,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 799 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:16:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-03-17 03:16:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 967. [2025-03-17 03:16:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 689 states have (on average 1.3062409288824384) internal successors, (900), 696 states have internal predecessors, (900), 244 states have call successors, (244), 33 states have call predecessors, (244), 33 states have return successors, (244), 237 states have call predecessors, (244), 244 states have call successors, (244) [2025-03-17 03:16:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1388 transitions. [2025-03-17 03:16:05,332 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1388 transitions. Word has length 174 [2025-03-17 03:16:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:05,333 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1388 transitions. [2025-03-17 03:16:05,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-17 03:16:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1388 transitions. [2025-03-17 03:16:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 03:16:05,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:05,335 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:16:05,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:16:05,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 03:16:05,536 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:05,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash -186587224, now seen corresponding path program 1 times [2025-03-17 03:16:05,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:05,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431318457] [2025-03-17 03:16:05,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:05,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:05,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 03:16:05,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 03:16:05,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:05,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:16:05,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:05,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431318457] [2025-03-17 03:16:05,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431318457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:05,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:16:05,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:16:05,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244427795] [2025-03-17 03:16:05,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:05,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:16:05,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:05,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:16:05,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:16:05,745 INFO L87 Difference]: Start difference. First operand 967 states and 1388 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:16:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:06,509 INFO L93 Difference]: Finished difference Result 3791 states and 5508 transitions. [2025-03-17 03:16:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:16:06,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2025-03-17 03:16:06,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:06,525 INFO L225 Difference]: With dead ends: 3791 [2025-03-17 03:16:06,525 INFO L226 Difference]: Without dead ends: 3412 [2025-03-17 03:16:06,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:16:06,528 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 700 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:06,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 758 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:16:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2025-03-17 03:16:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 2550. [2025-03-17 03:16:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 1810 states have (on average 1.3038674033149171) internal successors, (2360), 1830 states have internal predecessors, (2360), 654 states have call successors, (654), 85 states have call predecessors, (654), 85 states have return successors, (654), 634 states have call predecessors, (654), 654 states have call successors, (654) [2025-03-17 03:16:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3668 transitions. [2025-03-17 03:16:06,843 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3668 transitions. Word has length 174 [2025-03-17 03:16:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:06,843 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 3668 transitions. [2025-03-17 03:16:06,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 03:16:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3668 transitions. [2025-03-17 03:16:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 03:16:06,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:06,846 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:16:06,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 03:16:06,846 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:06,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash 700916457, now seen corresponding path program 1 times [2025-03-17 03:16:06,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:06,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93132011] [2025-03-17 03:16:06,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:06,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 03:16:06,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 03:16:06,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:06,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:16:11,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:11,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93132011] [2025-03-17 03:16:11,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93132011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:11,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:16:11,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 03:16:11,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073400407] [2025-03-17 03:16:11,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:11,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 03:16:11,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:11,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 03:16:11,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:16:11,404 INFO L87 Difference]: Start difference. First operand 2550 states and 3668 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:16:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:13,835 INFO L93 Difference]: Finished difference Result 4678 states and 6738 transitions. [2025-03-17 03:16:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 03:16:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-17 03:16:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:13,849 INFO L225 Difference]: With dead ends: 4678 [2025-03-17 03:16:13,849 INFO L226 Difference]: Without dead ends: 2651 [2025-03-17 03:16:13,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2025-03-17 03:16:13,856 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 439 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:13,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1282 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 03:16:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2025-03-17 03:16:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 2558. [2025-03-17 03:16:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 1818 states have (on average 1.3041804180418042) internal successors, (2371), 1838 states have internal predecessors, (2371), 654 states have call successors, (654), 85 states have call predecessors, (654), 85 states have return successors, (654), 634 states have call predecessors, (654), 654 states have call successors, (654) [2025-03-17 03:16:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3679 transitions. [2025-03-17 03:16:14,212 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3679 transitions. Word has length 174 [2025-03-17 03:16:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:14,213 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3679 transitions. [2025-03-17 03:16:14,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:16:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3679 transitions. [2025-03-17 03:16:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 03:16:14,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:14,215 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:16:14,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 03:16:14,215 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:14,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:14,215 INFO L85 PathProgramCache]: Analyzing trace with hash 739923342, now seen corresponding path program 1 times [2025-03-17 03:16:14,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:14,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507682585] [2025-03-17 03:16:14,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:14,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:14,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 03:16:14,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 03:16:14,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:14,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 03:16:17,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:17,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507682585] [2025-03-17 03:16:17,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507682585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:16:17,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:16:17,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 03:16:17,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554482075] [2025-03-17 03:16:17,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:16:17,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:16:17,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:17,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:16:17,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:16:17,106 INFO L87 Difference]: Start difference. First operand 2558 states and 3679 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:16:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:16:19,203 INFO L93 Difference]: Finished difference Result 3476 states and 4986 transitions. [2025-03-17 03:16:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 03:16:19,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-17 03:16:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:16:19,220 INFO L225 Difference]: With dead ends: 3476 [2025-03-17 03:16:19,220 INFO L226 Difference]: Without dead ends: 2711 [2025-03-17 03:16:19,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2025-03-17 03:16:19,224 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 406 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:16:19,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 2098 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 03:16:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2025-03-17 03:16:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2551. [2025-03-17 03:16:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 1811 states have (on average 1.3031474323578134) internal successors, (2360), 1831 states have internal predecessors, (2360), 654 states have call successors, (654), 85 states have call predecessors, (654), 85 states have return successors, (654), 634 states have call predecessors, (654), 654 states have call successors, (654) [2025-03-17 03:16:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3668 transitions. [2025-03-17 03:16:19,440 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3668 transitions. Word has length 174 [2025-03-17 03:16:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:16:19,441 INFO L471 AbstractCegarLoop]: Abstraction has 2551 states and 3668 transitions. [2025-03-17 03:16:19,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 03:16:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3668 transitions. [2025-03-17 03:16:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 03:16:19,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:16:19,442 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:16:19,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 03:16:19,442 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:16:19,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:16:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1719182332, now seen corresponding path program 1 times [2025-03-17 03:16:19,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:16:19,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738171970] [2025-03-17 03:16:19,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:16:19,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 03:16:19,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 03:16:19,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:19,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 159 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2025-03-17 03:16:38,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:16:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738171970] [2025-03-17 03:16:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738171970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:16:38,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346476971] [2025-03-17 03:16:38,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:16:38,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:16:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:16:38,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:16:38,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 03:16:38,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 03:16:38,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 03:16:38,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:16:38,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:16:38,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 03:16:38,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:16:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 213 proven. 69 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-03-17 03:16:39,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:16:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346476971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:16:40,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:16:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 31 [2025-03-17 03:16:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679636650] [2025-03-17 03:16:40,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:16:40,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 03:16:40,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:16:40,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 03:16:40,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 03:16:40,060 INFO L87 Difference]: Start difference. First operand 2551 states and 3668 transitions. Second operand has 31 states, 30 states have (on average 3.3) internal successors, (99), 30 states have internal predecessors, (99), 7 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52)