./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-45.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-ci_file-45.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 bcba96e12d465ba8f2cd356f8297b415f9e65918ebe10de52c572e6fb77ffa7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:34:29,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:34:29,681 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:34:29,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:34:29,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:34:29,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:34:29,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:34:29,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:34:29,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:34:29,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:34:29,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:34:29,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:34:29,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:34:29,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:34:29,715 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:34:29,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:34:29,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:34:29,715 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:34:29,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:34:29,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:34:29,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:34:29,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:34:29,716 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:34:29,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:34:29,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:34:29,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:34:29,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:34:29,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:34:29,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:34:29,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:34:29,719 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 -> bcba96e12d465ba8f2cd356f8297b415f9e65918ebe10de52c572e6fb77ffa7c [2025-02-05 23:34:29,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:34:29,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:34:29,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:34:29,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:34:29,994 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:34:29,995 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-ci_file-45.i [2025-02-05 23:34:31,293 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/083f7f1b7/2ca2ac9de1654bed81fb5074eabe5aa6/FLAG4e5857a0f [2025-02-05 23:34:31,519 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:34:31,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-45.i [2025-02-05 23:34:31,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/083f7f1b7/2ca2ac9de1654bed81fb5074eabe5aa6/FLAG4e5857a0f [2025-02-05 23:34:31,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/083f7f1b7/2ca2ac9de1654bed81fb5074eabe5aa6 [2025-02-05 23:34:31,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:34:31,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:34:31,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:34:31,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:34:31,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:34:31,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1925ccfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31, skipping insertion in model container [2025-02-05 23:34:31,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:34:31,695 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-ci_file-45.i[919,932] [2025-02-05 23:34:31,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:34:31,795 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:34:31,804 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-ci_file-45.i[919,932] [2025-02-05 23:34:31,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:34:31,856 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:34:31,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31 WrapperNode [2025-02-05 23:34:31,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:34:31,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:34:31,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:34:31,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:34:31,865 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:34:31" (1/1) ... [2025-02-05 23:34:31,872 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:34:31" (1/1) ... [2025-02-05 23:34:31,908 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-02-05 23:34:31,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:34:31,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:34:31,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:34:31,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:34:31,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,936 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:34:31,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:34:31,946 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:34:31,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:34:31,947 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:34:31,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (1/1) ... [2025-02-05 23:34:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:34:31,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:34:31,982 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:34:31,984 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:34:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:34:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:34:32,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:34:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:34:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:34:32,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:34:32,068 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:34:32,070 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:34:32,312 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 23:34:32,312 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:34:32,322 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:34:32,322 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:34:32,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:32 BoogieIcfgContainer [2025-02-05 23:34:32,323 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:34:32,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:34:32,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:34:32,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:34:32,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:34:31" (1/3) ... [2025-02-05 23:34:32,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1931af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:32, skipping insertion in model container [2025-02-05 23:34:32,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:31" (2/3) ... [2025-02-05 23:34:32,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1931af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:32, skipping insertion in model container [2025-02-05 23:34:32,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:32" (3/3) ... [2025-02-05 23:34:32,337 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-45.i [2025-02-05 23:34:32,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:34:32,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-45.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:34:32,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:34:32,390 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;@289f9cb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:34:32,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:34:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 23:34:32,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 23:34:32,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:32,403 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:32,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:32,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash 649585904, now seen corresponding path program 1 times [2025-02-05 23:34:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942832849] [2025-02-05 23:34:32,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:32,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:32,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 23:34:32,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 23:34:32,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:32,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 23:34:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942832849] [2025-02-05 23:34:32,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942832849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:34:32,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088654384] [2025-02-05 23:34:32,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:32,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:34:32,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:34:32,653 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:34:32,654 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:34:32,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 23:34:32,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 23:34:32,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:32,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:32,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:34:32,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:34:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-05 23:34:32,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:34:32,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088654384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:32,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:34:32,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:34:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828922097] [2025-02-05 23:34:32,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:32,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:34:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:32,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:34:32,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:34:32,861 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 23:34:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:32,889 INFO L93 Difference]: Finished difference Result 162 states and 281 transitions. [2025-02-05 23:34:32,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:34:32,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2025-02-05 23:34:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:32,897 INFO L225 Difference]: With dead ends: 162 [2025-02-05 23:34:32,898 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 23:34:32,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 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:34:32,904 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:32,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:34:32,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 23:34:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-05 23:34:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 23:34:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-02-05 23:34:32,950 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 173 [2025-02-05 23:34:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:32,950 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-02-05 23:34:32,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 23:34:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-02-05 23:34:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 23:34:32,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:32,956 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:32,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 23:34:33,160 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:34:33,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:33,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -861727894, now seen corresponding path program 1 times [2025-02-05 23:34:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:33,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78738831] [2025-02-05 23:34:33,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:33,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 23:34:33,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 23:34:33,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:33,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:34:33,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:33,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78738831] [2025-02-05 23:34:33,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78738831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:33,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:33,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:34:33,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504555103] [2025-02-05 23:34:33,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:33,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:34:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:33,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:34:33,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:34:33,492 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:33,523 INFO L93 Difference]: Finished difference Result 188 states and 289 transitions. [2025-02-05 23:34:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:34:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-02-05 23:34:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:33,525 INFO L225 Difference]: With dead ends: 188 [2025-02-05 23:34:33,525 INFO L226 Difference]: Without dead ends: 110 [2025-02-05 23:34:33,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:34:33,527 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 37 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:33,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 236 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:34:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-05 23:34:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2025-02-05 23:34:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 23:34:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2025-02-05 23:34:33,536 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 173 [2025-02-05 23:34:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:33,538 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2025-02-05 23:34:33,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2025-02-05 23:34:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 23:34:33,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:33,544 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:33,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:34:33,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:33,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1155130901, now seen corresponding path program 1 times [2025-02-05 23:34:33,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:33,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448145256] [2025-02-05 23:34:33,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:33,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 23:34:33,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 23:34:33,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:33,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:34:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:33,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448145256] [2025-02-05 23:34:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448145256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:33,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:33,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:34:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955321569] [2025-02-05 23:34:33,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:33,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:34:33,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:33,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:34:33,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:34:33,731 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:33,784 INFO L93 Difference]: Finished difference Result 261 states and 405 transitions. [2025-02-05 23:34:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:34:33,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-02-05 23:34:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:33,790 INFO L225 Difference]: With dead ends: 261 [2025-02-05 23:34:33,792 INFO L226 Difference]: Without dead ends: 174 [2025-02-05 23:34:33,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:34:33,794 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 113 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:33,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 228 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:34:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-05 23:34:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2025-02-05 23:34:33,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 117 states have (on average 1.376068376068376) internal successors, (161), 117 states have internal predecessors, (161), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 23:34:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2025-02-05 23:34:33,828 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 173 [2025-02-05 23:34:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:33,830 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2025-02-05 23:34:33,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2025-02-05 23:34:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 23:34:33,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:33,832 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:33,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:34:33,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:33,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1417858308, now seen corresponding path program 1 times [2025-02-05 23:34:33,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:33,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498206513] [2025-02-05 23:34:33,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:33,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:33,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 23:34:33,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 23:34:33,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:33,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:34:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:46,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498206513] [2025-02-05 23:34:46,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498206513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:46,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:46,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:34:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001708566] [2025-02-05 23:34:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:46,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:34:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:46,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:34:46,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:34:46,121 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:46,746 INFO L93 Difference]: Finished difference Result 464 states and 694 transitions. [2025-02-05 23:34:46,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:34:46,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-02-05 23:34:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:46,751 INFO L225 Difference]: With dead ends: 464 [2025-02-05 23:34:46,751 INFO L226 Difference]: Without dead ends: 295 [2025-02-05 23:34:46,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:34:46,752 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 80 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:46,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 391 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 23:34:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-05 23:34:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 244. [2025-02-05 23:34:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 171 states have (on average 1.345029239766082) internal successors, (230), 173 states have internal predecessors, (230), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:34:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 366 transitions. [2025-02-05 23:34:46,806 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 366 transitions. Word has length 174 [2025-02-05 23:34:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:46,807 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 366 transitions. [2025-02-05 23:34:46,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 366 transitions. [2025-02-05 23:34:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 23:34:46,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:46,811 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:46,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:34:46,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 324952027, now seen corresponding path program 1 times [2025-02-05 23:34:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689396319] [2025-02-05 23:34:46,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:46,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 23:34:46,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 23:34:46,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:46,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:34:48,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:48,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689396319] [2025-02-05 23:34:48,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689396319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:48,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:48,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:34:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267300296] [2025-02-05 23:34:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:48,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:34:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:48,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:34:48,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:34:48,129 INFO L87 Difference]: Start difference. First operand 244 states and 366 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:48,446 INFO L93 Difference]: Finished difference Result 536 states and 794 transitions. [2025-02-05 23:34:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:34:48,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-02-05 23:34:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:48,453 INFO L225 Difference]: With dead ends: 536 [2025-02-05 23:34:48,453 INFO L226 Difference]: Without dead ends: 295 [2025-02-05 23:34:48,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:34:48,455 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:48,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 329 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 23:34:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-05 23:34:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 239. [2025-02-05 23:34:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 168 states have internal predecessors, (223), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:34:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 359 transitions. [2025-02-05 23:34:48,489 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 359 transitions. Word has length 174 [2025-02-05 23:34:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:48,490 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 359 transitions. [2025-02-05 23:34:48,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 359 transitions. [2025-02-05 23:34:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 23:34:48,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:48,491 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:48,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:34:48,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:48,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash 89693501, now seen corresponding path program 1 times [2025-02-05 23:34:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:48,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751032233] [2025-02-05 23:34:48,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:48,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:48,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 23:34:48,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 23:34:48,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:48,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:34:55,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:55,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751032233] [2025-02-05 23:34:55,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751032233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:55,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:55,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:34:55,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957470306] [2025-02-05 23:34:55,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:55,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:34:55,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:55,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:34:55,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:34:55,509 INFO L87 Difference]: Start difference. First operand 239 states and 359 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:56,076 INFO L93 Difference]: Finished difference Result 558 states and 824 transitions. [2025-02-05 23:34:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:34:56,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-02-05 23:34:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:56,083 INFO L225 Difference]: With dead ends: 558 [2025-02-05 23:34:56,084 INFO L226 Difference]: Without dead ends: 322 [2025-02-05 23:34:56,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:34:56,085 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 85 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:56,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 419 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:34:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-05 23:34:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2025-02-05 23:34:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 209 states have (on average 1.2870813397129186) internal successors, (269), 214 states have internal predecessors, (269), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-05 23:34:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 461 transitions. [2025-02-05 23:34:56,132 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 461 transitions. Word has length 174 [2025-02-05 23:34:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:56,133 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 461 transitions. [2025-02-05 23:34:56,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 461 transitions. [2025-02-05 23:34:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 23:34:56,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:56,134 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:56,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:34:56,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:56,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1832503836, now seen corresponding path program 1 times [2025-02-05 23:34:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249010612] [2025-02-05 23:34:56,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:56,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 23:34:56,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 23:34:56,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:56,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:34:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249010612] [2025-02-05 23:34:56,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249010612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:56,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:56,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:34:56,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638866797] [2025-02-05 23:34:56,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:34:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:56,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:34:56,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:34:56,956 INFO L87 Difference]: Start difference. First operand 314 states and 461 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:57,207 INFO L93 Difference]: Finished difference Result 628 states and 910 transitions. [2025-02-05 23:34:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:34:57,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-02-05 23:34:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:57,216 INFO L225 Difference]: With dead ends: 628 [2025-02-05 23:34:57,216 INFO L226 Difference]: Without dead ends: 330 [2025-02-05 23:34:57,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:34:57,221 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 82 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:57,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 348 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:34:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-05 23:34:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 274. [2025-02-05 23:34:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 185 states have (on average 1.3027027027027027) internal successors, (241), 188 states have internal predecessors, (241), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 23:34:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2025-02-05 23:34:57,282 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 401 transitions. Word has length 174 [2025-02-05 23:34:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:57,283 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 401 transitions. [2025-02-05 23:34:57,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 401 transitions. [2025-02-05 23:34:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 23:34:57,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:57,290 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:57,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:34:57,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:57,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1504804542, now seen corresponding path program 1 times [2025-02-05 23:34:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:57,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045401124] [2025-02-05 23:34:57,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:57,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:57,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 23:34:57,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 23:34:57,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:57,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:34:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-05 23:34:57,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:34:57,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045401124] [2025-02-05 23:34:57,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045401124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:34:57,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:34:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:34:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981197080] [2025-02-05 23:34:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:34:57,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:34:57,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:34:57,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:34:57,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:34:57,579 INFO L87 Difference]: Start difference. First operand 274 states and 401 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:34:57,841 INFO L93 Difference]: Finished difference Result 829 states and 1193 transitions. [2025-02-05 23:34:57,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:34:57,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-02-05 23:34:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:34:57,847 INFO L225 Difference]: With dead ends: 829 [2025-02-05 23:34:57,847 INFO L226 Difference]: Without dead ends: 571 [2025-02-05 23:34:57,849 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:34:57,849 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 117 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:34:57,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 323 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:34:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-05 23:34:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 564. [2025-02-05 23:34:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 391 states have (on average 1.2915601023017902) internal successors, (505), 400 states have internal predecessors, (505), 152 states have call successors, (152), 20 states have call predecessors, (152), 20 states have return successors, (152), 143 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-05 23:34:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 809 transitions. [2025-02-05 23:34:57,947 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 809 transitions. Word has length 175 [2025-02-05 23:34:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:34:57,947 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 809 transitions. [2025-02-05 23:34:57,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-05 23:34:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 809 transitions. [2025-02-05 23:34:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 23:34:57,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:34:57,949 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:34:57,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:34:57,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:34:57,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:34:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash -973396854, now seen corresponding path program 1 times [2025-02-05 23:34:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:34:57,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567280049] [2025-02-05 23:34:57,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:34:57,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:34:57,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 23:34:58,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 23:34:58,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:34:58,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat