./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8880bc6b55ab6b26a36a9709c52577c78f4355aea8bee56c9643da00ec93f3ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:54:32,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:54:32,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:54:32,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:54:32,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:54:32,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:54:32,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:54:32,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:54:32,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:54:32,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:54:32,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:54:32,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:54:32,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:54:32,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:54:32,414 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:54:32,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:54:32,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:54:32,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:54:32,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:54:32,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:54:32,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:54:32,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:54:32,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:54:32,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:54:32,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:54:32,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:54:32,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:54:32,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:54:32,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:54:32,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:54:32,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:54:32,420 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-jdk21/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 -> 8880bc6b55ab6b26a36a9709c52577c78f4355aea8bee56c9643da00ec93f3ee [2025-02-05 23:54:32,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:54:32,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:54:32,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:54:32,653 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:54:32,653 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:54:32,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2025-02-05 23:54:33,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9dd516a4/78c7337b39204d09975a864d160f8ea2/FLAG749801b37 [2025-02-05 23:54:34,083 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:54:34,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2025-02-05 23:54:34,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9dd516a4/78c7337b39204d09975a864d160f8ea2/FLAG749801b37 [2025-02-05 23:54:34,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9dd516a4/78c7337b39204d09975a864d160f8ea2 [2025-02-05 23:54:34,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:54:34,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:54:34,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:54:34,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:54:34,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:54:34,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480f5233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34, skipping insertion in model container [2025-02-05 23:54:34,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:54:34,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i[919,932] [2025-02-05 23:54:34,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:54:34,544 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:54:34,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i[919,932] [2025-02-05 23:54:34,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:54:34,602 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:54:34,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34 WrapperNode [2025-02-05 23:54:34,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:54:34,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:54:34,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:54:34,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:54:34,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,646 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315 [2025-02-05 23:54:34,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:54:34,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:54:34,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:54:34,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:54:34,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,678 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-02-05 23:54:34,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:54:34,711 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:54:34,711 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:54:34,711 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:54:34,712 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (1/1) ... [2025-02-05 23:54:34,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:54:34,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:54:34,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:54:34,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:54:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:54:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:54:34,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:54:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:54:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:54:34,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:54:34,826 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:54:34,828 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:54:35,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L211: havoc property_#t~bitwise35#1;havoc property_#t~ite37#1;havoc property_#t~bitwise36#1;havoc property_#t~short38#1; [2025-02-05 23:54:35,280 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-05 23:54:35,281 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:54:35,298 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:54:35,301 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:54:35,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:54:35 BoogieIcfgContainer [2025-02-05 23:54:35,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:54:35,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:54:35,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:54:35,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:54:35,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:54:34" (1/3) ... [2025-02-05 23:54:35,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0a43e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:54:35, skipping insertion in model container [2025-02-05 23:54:35,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:54:34" (2/3) ... [2025-02-05 23:54:35,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0a43e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:54:35, skipping insertion in model container [2025-02-05 23:54:35,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:54:35" (3/3) ... [2025-02-05 23:54:35,309 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2025-02-05 23:54:35,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:54:35,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:54:35,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:54:35,382 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;@46bf3ec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:54:35,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:54:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 94 states have internal predecessors, (132), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 23:54:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 23:54:35,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:54:35,398 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:54:35,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:54:35,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:54:35,402 INFO L85 PathProgramCache]: Analyzing trace with hash -965920358, now seen corresponding path program 1 times [2025-02-05 23:54:35,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:54:35,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049041686] [2025-02-05 23:54:35,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:54:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:54:35,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 23:54:35,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 23:54:35,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:54:35,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:54:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-02-05 23:54:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:54:35,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049041686] [2025-02-05 23:54:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049041686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:54:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207090030] [2025-02-05 23:54:35,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:54:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:54:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:54:35,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:54:35,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:54:35,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 23:54:35,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 23:54:35,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:54:35,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:54:35,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:54:35,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:54:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-02-05 23:54:35,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:54:35,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207090030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:54:35,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:54:35,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:54:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534370164] [2025-02-05 23:54:35,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:54:35,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:54:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:54:36,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:54:36,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:54:36,019 INFO L87 Difference]: Start difference. First operand has 138 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 94 states have internal predecessors, (132), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:54:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:54:36,051 INFO L93 Difference]: Finished difference Result 270 states and 469 transitions. [2025-02-05 23:54:36,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:54:36,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 263 [2025-02-05 23:54:36,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:54:36,058 INFO L225 Difference]: With dead ends: 270 [2025-02-05 23:54:36,059 INFO L226 Difference]: Without dead ends: 135 [2025-02-05 23:54:36,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 264 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-02-05 23:54:36,063 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:54:36,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:54:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-05 23:54:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-05 23:54:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 23:54:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 211 transitions. [2025-02-05 23:54:36,106 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 211 transitions. Word has length 263 [2025-02-05 23:54:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:54:36,106 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 211 transitions. [2025-02-05 23:54:36,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:54:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 211 transitions. [2025-02-05 23:54:36,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 23:54:36,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:54:36,112 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:54:36,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 23:54:36,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 23:54:36,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:54:36,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:54:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2107124290, now seen corresponding path program 1 times [2025-02-05 23:54:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:54:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541312122] [2025-02-05 23:54:36,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:54:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:54:36,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 23:54:36,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 23:54:36,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:54:36,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:54:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:54:36,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:54:36,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541312122] [2025-02-05 23:54:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541312122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:54:36,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:54:36,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:54:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840256985] [2025-02-05 23:54:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:54:36,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:54:36,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:54:36,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:54:36,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:54:36,705 INFO L87 Difference]: Start difference. First operand 135 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:54:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:54:36,779 INFO L93 Difference]: Finished difference Result 368 states and 582 transitions. [2025-02-05 23:54:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:54:36,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-02-05 23:54:36,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:54:36,782 INFO L225 Difference]: With dead ends: 368 [2025-02-05 23:54:36,782 INFO L226 Difference]: Without dead ends: 236 [2025-02-05 23:54:36,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:54:36,784 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 91 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:54:36,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 385 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:54:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-05 23:54:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 216. [2025-02-05 23:54:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 129 states have (on average 1.3255813953488371) internal successors, (171), 129 states have internal predecessors, (171), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 23:54:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 339 transitions. [2025-02-05 23:54:36,817 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 339 transitions. Word has length 263 [2025-02-05 23:54:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:54:36,817 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 339 transitions. [2025-02-05 23:54:36,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:54:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 339 transitions. [2025-02-05 23:54:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 23:54:36,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:54:36,821 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:54:36,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:54:36,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:54:36,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:54:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash -929366562, now seen corresponding path program 1 times [2025-02-05 23:54:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:54:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68502433] [2025-02-05 23:54:36,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:54:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:54:36,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 23:54:36,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 23:54:36,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:54:36,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:54:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:54:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:54:37,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68502433] [2025-02-05 23:54:37,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68502433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:54:37,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:54:37,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:54:37,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630397580] [2025-02-05 23:54:37,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:54:37,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:54:37,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:54:37,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:54:37,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:54:37,212 INFO L87 Difference]: Start difference. First operand 216 states and 339 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:54:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:54:37,455 INFO L93 Difference]: Finished difference Result 400 states and 625 transitions. [2025-02-05 23:54:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:54:37,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-02-05 23:54:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:54:37,459 INFO L225 Difference]: With dead ends: 400 [2025-02-05 23:54:37,459 INFO L226 Difference]: Without dead ends: 268 [2025-02-05 23:54:37,460 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-02-05 23:54:37,461 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 164 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:54:37,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 577 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:54:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-05 23:54:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 234. [2025-02-05 23:54:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 147 states have (on average 1.3537414965986394) internal successors, (199), 147 states have internal predecessors, (199), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 23:54:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 367 transitions. [2025-02-05 23:54:37,492 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 367 transitions. Word has length 263 [2025-02-05 23:54:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:54:37,492 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 367 transitions. [2025-02-05 23:54:37,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:54:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 367 transitions. [2025-02-05 23:54:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 23:54:37,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:54:37,495 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:54:37,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:54:37,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:54:37,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:54:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1606653543, now seen corresponding path program 1 times [2025-02-05 23:54:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:54:37,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281917859] [2025-02-05 23:54:37,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:54:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:54:37,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 23:54:37,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 23:54:37,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:54:37,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:54:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:54:58,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:54:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281917859] [2025-02-05 23:54:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281917859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:54:58,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:54:58,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 23:54:58,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603795826] [2025-02-05 23:54:58,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:54:58,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:54:58,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:54:58,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:54:58,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:54:58,618 INFO L87 Difference]: Start difference. First operand 234 states and 367 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-05 23:55:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:02,296 INFO L93 Difference]: Finished difference Result 639 states and 964 transitions. [2025-02-05 23:55:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 23:55:02,296 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 264 [2025-02-05 23:55:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:02,300 INFO L225 Difference]: With dead ends: 639 [2025-02-05 23:55:02,300 INFO L226 Difference]: Without dead ends: 507 [2025-02-05 23:55:02,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-02-05 23:55:02,301 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 879 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:02,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1331 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 23:55:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-05 23:55:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 376. [2025-02-05 23:55:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 241 states have (on average 1.3112033195020747) internal successors, (316), 242 states have internal predecessors, (316), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-05 23:55:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 568 transitions. [2025-02-05 23:55:02,333 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 568 transitions. Word has length 264 [2025-02-05 23:55:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:02,334 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 568 transitions. [2025-02-05 23:55:02,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-05 23:55:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 568 transitions. [2025-02-05 23:55:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 23:55:02,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:02,337 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:02,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:55:02,337 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:02,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:02,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1477570824, now seen corresponding path program 1 times [2025-02-05 23:55:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:02,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206123017] [2025-02-05 23:55:02,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:02,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 23:55:02,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 23:55:02,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:02,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206123017] [2025-02-05 23:55:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206123017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:05,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:55:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175957967] [2025-02-05 23:55:05,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:05,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:55:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:05,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:55:05,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:55:05,450 INFO L87 Difference]: Start difference. First operand 376 states and 568 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:06,933 INFO L93 Difference]: Finished difference Result 765 states and 1142 transitions. [2025-02-05 23:55:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:55:06,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-02-05 23:55:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:06,937 INFO L225 Difference]: With dead ends: 765 [2025-02-05 23:55:06,938 INFO L226 Difference]: Without dead ends: 470 [2025-02-05 23:55:06,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:55:06,939 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 512 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:06,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1292 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 23:55:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-05 23:55:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 380. [2025-02-05 23:55:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 245 states have (on average 1.310204081632653) internal successors, (321), 246 states have internal predecessors, (321), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-05 23:55:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 573 transitions. [2025-02-05 23:55:06,974 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 573 transitions. Word has length 264 [2025-02-05 23:55:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:06,979 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 573 transitions. [2025-02-05 23:55:06,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 573 transitions. [2025-02-05 23:55:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 23:55:06,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:06,982 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:06,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:55:06,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:06,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash 370325113, now seen corresponding path program 1 times [2025-02-05 23:55:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754653000] [2025-02-05 23:55:06,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:07,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 23:55:07,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 23:55:07,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:07,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754653000] [2025-02-05 23:55:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754653000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:09,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:09,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 23:55:09,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225149676] [2025-02-05 23:55:09,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:09,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:55:09,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:09,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:55:09,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:55:09,218 INFO L87 Difference]: Start difference. First operand 380 states and 573 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:55:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:10,690 INFO L93 Difference]: Finished difference Result 771 states and 1145 transitions. [2025-02-05 23:55:10,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:55:10,696 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 264 [2025-02-05 23:55:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:10,700 INFO L225 Difference]: With dead ends: 771 [2025-02-05 23:55:10,701 INFO L226 Difference]: Without dead ends: 472 [2025-02-05 23:55:10,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-05 23:55:10,703 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 485 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:10,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1725 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 23:55:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-02-05 23:55:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 388. [2025-02-05 23:55:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 253 states have (on average 1.308300395256917) internal successors, (331), 254 states have internal predecessors, (331), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-05 23:55:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 583 transitions. [2025-02-05 23:55:10,739 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 583 transitions. Word has length 264 [2025-02-05 23:55:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:10,740 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 583 transitions. [2025-02-05 23:55:10,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:55:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 583 transitions. [2025-02-05 23:55:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 23:55:10,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:10,743 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:55:10,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:10,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash 499407832, now seen corresponding path program 1 times [2025-02-05 23:55:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630389595] [2025-02-05 23:55:10,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:10,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 23:55:10,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 23:55:10,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:10,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:13,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630389595] [2025-02-05 23:55:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630389595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:13,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:13,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 23:55:13,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472310798] [2025-02-05 23:55:13,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:13,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:55:13,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:13,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:55:13,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:55:13,106 INFO L87 Difference]: Start difference. First operand 388 states and 583 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:15,536 INFO L93 Difference]: Finished difference Result 902 states and 1308 transitions. [2025-02-05 23:55:15,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 23:55:15,537 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-02-05 23:55:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:15,543 INFO L225 Difference]: With dead ends: 902 [2025-02-05 23:55:15,544 INFO L226 Difference]: Without dead ends: 595 [2025-02-05 23:55:15,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2025-02-05 23:55:15,546 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 597 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:15,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1670 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 23:55:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-05 23:55:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 387. [2025-02-05 23:55:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 252 states have (on average 1.3095238095238095) internal successors, (330), 253 states have internal predecessors, (330), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-05 23:55:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 582 transitions. [2025-02-05 23:55:15,586 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 582 transitions. Word has length 264 [2025-02-05 23:55:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:15,586 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 582 transitions. [2025-02-05 23:55:15,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 582 transitions. [2025-02-05 23:55:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 23:55:15,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:15,589 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:15,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:55:15,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:15,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 982952697, now seen corresponding path program 1 times [2025-02-05 23:55:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413764999] [2025-02-05 23:55:15,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:15,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 23:55:15,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 23:55:15,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:15,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:16,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:16,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413764999] [2025-02-05 23:55:16,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413764999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:16,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:16,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 23:55:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180190622] [2025-02-05 23:55:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:16,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:55:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:16,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:55:16,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:55:16,700 INFO L87 Difference]: Start difference. First operand 387 states and 582 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:17,370 INFO L93 Difference]: Finished difference Result 784 states and 1161 transitions. [2025-02-05 23:55:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:55:17,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-02-05 23:55:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:17,373 INFO L225 Difference]: With dead ends: 784 [2025-02-05 23:55:17,373 INFO L226 Difference]: Without dead ends: 478 [2025-02-05 23:55:17,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:55:17,375 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 376 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:17,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1248 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:55:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-05 23:55:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 382. [2025-02-05 23:55:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 247 states have (on average 1.3076923076923077) internal successors, (323), 248 states have internal predecessors, (323), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-05 23:55:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 575 transitions. [2025-02-05 23:55:17,397 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 575 transitions. Word has length 264 [2025-02-05 23:55:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:17,397 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 575 transitions. [2025-02-05 23:55:17,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 575 transitions. [2025-02-05 23:55:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 23:55:17,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:17,399 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:17,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:55:17,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:17,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1691241400, now seen corresponding path program 1 times [2025-02-05 23:55:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449852550] [2025-02-05 23:55:17,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:17,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 23:55:17,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 23:55:17,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:17,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:20,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:20,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449852550] [2025-02-05 23:55:20,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449852550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:20,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:20,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:55:20,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243591481] [2025-02-05 23:55:20,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:20,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:55:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:20,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:55:20,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:55:20,417 INFO L87 Difference]: Start difference. First operand 382 states and 575 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:55:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:23,620 INFO L93 Difference]: Finished difference Result 877 states and 1308 transitions. [2025-02-05 23:55:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 23:55:23,621 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 264 [2025-02-05 23:55:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:23,625 INFO L225 Difference]: With dead ends: 877 [2025-02-05 23:55:23,625 INFO L226 Difference]: Without dead ends: 745 [2025-02-05 23:55:23,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2025-02-05 23:55:23,630 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 585 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:23,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1812 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 23:55:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-02-05 23:55:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 564. [2025-02-05 23:55:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 384 states have (on average 1.3385416666666667) internal successors, (514), 384 states have internal predecessors, (514), 168 states have call successors, (168), 11 states have call predecessors, (168), 11 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-02-05 23:55:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 850 transitions. [2025-02-05 23:55:23,667 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 850 transitions. Word has length 264 [2025-02-05 23:55:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:23,667 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 850 transitions. [2025-02-05 23:55:23,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:55:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 850 transitions. [2025-02-05 23:55:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 23:55:23,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:23,669 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:23,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:55:23,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:23,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:23,670 INFO L85 PathProgramCache]: Analyzing trace with hash -626747240, now seen corresponding path program 1 times [2025-02-05 23:55:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933673483] [2025-02-05 23:55:23,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:23,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:23,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 23:55:23,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 23:55:23,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:23,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:24,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933673483] [2025-02-05 23:55:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933673483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:24,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:24,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 23:55:24,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033051049] [2025-02-05 23:55:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:24,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 23:55:24,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:24,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 23:55:24,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:55:24,835 INFO L87 Difference]: Start difference. First operand 564 states and 850 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:25,670 INFO L93 Difference]: Finished difference Result 995 states and 1482 transitions. [2025-02-05 23:55:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 23:55:25,670 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-02-05 23:55:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:25,674 INFO L225 Difference]: With dead ends: 995 [2025-02-05 23:55:25,674 INFO L226 Difference]: Without dead ends: 709 [2025-02-05 23:55:25,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:55:25,676 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 335 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:25,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1662 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:55:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-02-05 23:55:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 566. [2025-02-05 23:55:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 386 states have (on average 1.3367875647668395) internal successors, (516), 386 states have internal predecessors, (516), 168 states have call successors, (168), 11 states have call predecessors, (168), 11 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-02-05 23:55:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 852 transitions. [2025-02-05 23:55:25,706 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 852 transitions. Word has length 264 [2025-02-05 23:55:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:25,707 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 852 transitions. [2025-02-05 23:55:25,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 852 transitions. [2025-02-05 23:55:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 23:55:25,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:25,708 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:25,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 23:55:25,709 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:25,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:25,709 INFO L85 PathProgramCache]: Analyzing trace with hash 110344216, now seen corresponding path program 1 times [2025-02-05 23:55:25,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:25,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562035864] [2025-02-05 23:55:25,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:25,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:25,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 23:55:25,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 23:55:25,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:25,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:30,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562035864] [2025-02-05 23:55:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562035864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:30,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 23:55:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432070023] [2025-02-05 23:55:30,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:30,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 23:55:30,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:30,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 23:55:30,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:55:30,401 INFO L87 Difference]: Start difference. First operand 566 states and 852 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-05 23:55:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:34,097 INFO L93 Difference]: Finished difference Result 839 states and 1248 transitions. [2025-02-05 23:55:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 23:55:34,098 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 265 [2025-02-05 23:55:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:34,101 INFO L225 Difference]: With dead ends: 839 [2025-02-05 23:55:34,101 INFO L226 Difference]: Without dead ends: 707 [2025-02-05 23:55:34,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2025-02-05 23:55:34,103 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 610 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:34,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1917 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 23:55:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-02-05 23:55:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 573. [2025-02-05 23:55:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 393 states have (on average 1.3384223918575064) internal successors, (526), 393 states have internal predecessors, (526), 168 states have call successors, (168), 11 states have call predecessors, (168), 11 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-02-05 23:55:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 862 transitions. [2025-02-05 23:55:34,135 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 862 transitions. Word has length 265 [2025-02-05 23:55:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:34,135 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 862 transitions. [2025-02-05 23:55:34,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-05 23:55:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 862 transitions. [2025-02-05 23:55:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 23:55:34,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:34,137 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:34,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:55:34,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:34,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash -183058791, now seen corresponding path program 1 times [2025-02-05 23:55:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:34,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043989044] [2025-02-05 23:55:34,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:34,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 23:55:34,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 23:55:34,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:34,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:34,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:34,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043989044] [2025-02-05 23:55:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043989044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:34,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:34,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:55:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831686348] [2025-02-05 23:55:34,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:34,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:55:34,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:34,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:55:34,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:55:34,269 INFO L87 Difference]: Start difference. First operand 573 states and 862 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:34,350 INFO L93 Difference]: Finished difference Result 1146 states and 1698 transitions. [2025-02-05 23:55:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:55:34,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 265 [2025-02-05 23:55:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:34,354 INFO L225 Difference]: With dead ends: 1146 [2025-02-05 23:55:34,354 INFO L226 Difference]: Without dead ends: 684 [2025-02-05 23:55:34,355 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-02-05 23:55:34,356 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 39 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:34,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 646 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:55:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-02-05 23:55:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 673. [2025-02-05 23:55:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 476 states have (on average 1.315126050420168) internal successors, (626), 479 states have internal predecessors, (626), 180 states have call successors, (180), 16 states have call predecessors, (180), 16 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-05 23:55:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 986 transitions. [2025-02-05 23:55:34,385 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 986 transitions. Word has length 265 [2025-02-05 23:55:34,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:34,385 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 986 transitions. [2025-02-05 23:55:34,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 986 transitions. [2025-02-05 23:55:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 23:55:34,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:34,388 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:34,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 23:55:34,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:34,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1267140408, now seen corresponding path program 1 times [2025-02-05 23:55:34,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:34,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870445915] [2025-02-05 23:55:34,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:34,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:34,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 23:55:34,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 23:55:34,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:34,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:38,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:38,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870445915] [2025-02-05 23:55:38,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870445915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:38,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:38,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 23:55:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541265992] [2025-02-05 23:55:38,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:38,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 23:55:38,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:38,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 23:55:38,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-02-05 23:55:38,024 INFO L87 Difference]: Start difference. First operand 673 states and 986 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-05 23:55:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:41,290 INFO L93 Difference]: Finished difference Result 1307 states and 1871 transitions. [2025-02-05 23:55:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 23:55:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 265 [2025-02-05 23:55:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:41,295 INFO L225 Difference]: With dead ends: 1307 [2025-02-05 23:55:41,295 INFO L226 Difference]: Without dead ends: 933 [2025-02-05 23:55:41,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 23:55:41,297 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 724 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 2511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:41,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1998 Invalid, 2511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 23:55:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-05 23:55:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 681. [2025-02-05 23:55:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 484 states have (on average 1.3161157024793388) internal successors, (637), 487 states have internal predecessors, (637), 180 states have call successors, (180), 16 states have call predecessors, (180), 16 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-05 23:55:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 997 transitions. [2025-02-05 23:55:41,332 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 997 transitions. Word has length 265 [2025-02-05 23:55:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:41,333 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 997 transitions. [2025-02-05 23:55:41,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-05 23:55:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 997 transitions. [2025-02-05 23:55:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 23:55:41,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:41,334 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:41,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 23:55:41,335 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:41,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:41,335 INFO L85 PathProgramCache]: Analyzing trace with hash -922837961, now seen corresponding path program 1 times [2025-02-05 23:55:41,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:41,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032774053] [2025-02-05 23:55:41,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:41,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:41,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 23:55:41,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 23:55:41,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:41,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:42,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:42,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032774053] [2025-02-05 23:55:42,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032774053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:42,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:42,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 23:55:42,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887291217] [2025-02-05 23:55:42,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:42,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 23:55:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:42,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 23:55:42,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:55:42,958 INFO L87 Difference]: Start difference. First operand 681 states and 997 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:55:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:44,441 INFO L93 Difference]: Finished difference Result 1252 states and 1805 transitions. [2025-02-05 23:55:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 23:55:44,442 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 265 [2025-02-05 23:55:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:44,446 INFO L225 Difference]: With dead ends: 1252 [2025-02-05 23:55:44,446 INFO L226 Difference]: Without dead ends: 870 [2025-02-05 23:55:44,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-02-05 23:55:44,447 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 443 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:44,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1559 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 23:55:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-02-05 23:55:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 671. [2025-02-05 23:55:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 474 states have (on average 1.3143459915611815) internal successors, (623), 477 states have internal predecessors, (623), 180 states have call successors, (180), 16 states have call predecessors, (180), 16 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-05 23:55:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 983 transitions. [2025-02-05 23:55:44,482 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 983 transitions. Word has length 265 [2025-02-05 23:55:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:44,482 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 983 transitions. [2025-02-05 23:55:44,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-02-05 23:55:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 983 transitions. [2025-02-05 23:55:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 23:55:44,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:44,483 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:44,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 23:55:44,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:44,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash -734127655, now seen corresponding path program 1 times [2025-02-05 23:55:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:44,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426425859] [2025-02-05 23:55:44,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:44,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 23:55:44,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 23:55:44,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:44,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:51,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426425859] [2025-02-05 23:55:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426425859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 23:55:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89833099] [2025-02-05 23:55:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:51,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 23:55:51,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:51,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 23:55:51,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-02-05 23:55:51,807 INFO L87 Difference]: Start difference. First operand 671 states and 983 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-05 23:55:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:58,067 INFO L93 Difference]: Finished difference Result 1159 states and 1661 transitions. [2025-02-05 23:55:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 23:55:58,068 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 265 [2025-02-05 23:55:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:58,073 INFO L225 Difference]: With dead ends: 1159 [2025-02-05 23:55:58,074 INFO L226 Difference]: Without dead ends: 997 [2025-02-05 23:55:58,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 23:55:58,076 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1247 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:58,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 1894 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 23:55:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-02-05 23:55:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 685. [2025-02-05 23:55:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 487 states have (on average 1.3182751540041069) internal successors, (642), 490 states have internal predecessors, (642), 180 states have call successors, (180), 17 states have call predecessors, (180), 17 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-05 23:55:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1002 transitions. [2025-02-05 23:55:58,117 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1002 transitions. Word has length 265 [2025-02-05 23:55:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:58,117 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1002 transitions. [2025-02-05 23:55:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-02-05 23:55:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1002 transitions. [2025-02-05 23:55:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 23:55:58,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:58,119 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 23:55:58,119 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:58,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 153376026, now seen corresponding path program 1 times [2025-02-05 23:55:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:58,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202522969] [2025-02-05 23:55:58,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:58,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 23:55:58,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 23:55:58,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:58,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:55:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-02-05 23:55:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:55:58,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202522969] [2025-02-05 23:55:58,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202522969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:55:58,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:55:58,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 23:55:58,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805381665] [2025-02-05 23:55:58,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:55:58,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:55:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:55:58,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:55:58,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:55:58,926 INFO L87 Difference]: Start difference. First operand 685 states and 1002 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:55:59,477 INFO L93 Difference]: Finished difference Result 1072 states and 1561 transitions. [2025-02-05 23:55:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:55:59,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 265 [2025-02-05 23:55:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:55:59,481 INFO L225 Difference]: With dead ends: 1072 [2025-02-05 23:55:59,481 INFO L226 Difference]: Without dead ends: 910 [2025-02-05 23:55:59,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-05 23:55:59,483 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 180 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:55:59,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1164 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:55:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-02-05 23:55:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 715. [2025-02-05 23:55:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 517 states have (on average 1.3288201160541586) internal successors, (687), 520 states have internal predecessors, (687), 180 states have call successors, (180), 17 states have call predecessors, (180), 17 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-02-05 23:55:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1047 transitions. [2025-02-05 23:55:59,519 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1047 transitions. Word has length 265 [2025-02-05 23:55:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:55:59,519 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1047 transitions. [2025-02-05 23:55:59,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-02-05 23:55:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1047 transitions. [2025-02-05 23:55:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 23:55:59,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:55:59,521 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:55:59,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 23:55:59,521 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:55:59,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:55:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1174347767, now seen corresponding path program 1 times [2025-02-05 23:55:59,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:55:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984138425] [2025-02-05 23:55:59,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:55:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:55:59,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 23:55:59,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 23:55:59,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:55:59,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat