./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.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_floatingpointinfluence_has-floats_file-89.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 b61474e3055b599a740acd844baa39c957b5e0efc678fbcea6f4ee1ccd6cc136 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:29:56,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:29:56,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:29:56,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:29:56,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:29:56,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:29:56,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:29:56,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:29:56,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:29:56,845 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:29:56,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:29:56,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:29:56,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:29:56,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:29:56,847 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:29:56,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:29:56,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:29:56,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:29:56,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:29:56,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:29:56,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:29:56,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:29:56,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:29:56,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:29:56,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:29:56,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:29:56,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:29:56,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:29:56,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:29:56,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:29:56,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:29:56,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:29:56,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:29:56,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:29:56,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:29:56,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:29:56,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:29:56,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:29:56,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:29:56,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:29:56,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:29:56,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:29:56,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:29:56,852 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 -> b61474e3055b599a740acd844baa39c957b5e0efc678fbcea6f4ee1ccd6cc136 [2025-02-06 00:29:57,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:29:57,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:29:57,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:29:57,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:29:57,165 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:29:57,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i [2025-02-06 00:29:58,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6ce48afe/5c67ad6353ca4aa4b2da77931dc5f008/FLAG48c7a5ce1 [2025-02-06 00:29:58,657 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:29:58,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i [2025-02-06 00:29:58,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6ce48afe/5c67ad6353ca4aa4b2da77931dc5f008/FLAG48c7a5ce1 [2025-02-06 00:29:58,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6ce48afe/5c67ad6353ca4aa4b2da77931dc5f008 [2025-02-06 00:29:58,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:29:58,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:29:58,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:29:58,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:29:58,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:29:58,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:58,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311e5e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58, skipping insertion in model container [2025-02-06 00:29:58,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:58,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:29:58,838 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_floatingpointinfluence_has-floats_file-89.i[917,930] [2025-02-06 00:29:58,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:29:58,902 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:29:58,910 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_floatingpointinfluence_has-floats_file-89.i[917,930] [2025-02-06 00:29:58,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:29:58,943 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:29:58,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58 WrapperNode [2025-02-06 00:29:58,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:29:58,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:29:58,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:29:58,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:29:58,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:58,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:58,997 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-02-06 00:29:58,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:29:58,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:29:58,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:29:58,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:29:59,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,031 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-06 00:29:59,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:29:59,043 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:29:59,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:29:59,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:29:59,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (1/1) ... [2025-02-06 00:29:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:29:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:29:59,082 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-06 00:29:59,085 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-06 00:29:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:29:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:29:59,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:29:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:29:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:29:59,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:29:59,179 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:29:59,181 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:29:59,488 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc property_#t~ite14#1;havoc property_#t~ite13#1;havoc property_#t~ite12#1;havoc property_#t~bitwise11#1;havoc property_#t~short15#1; [2025-02-06 00:29:59,516 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-06 00:29:59,516 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:29:59,535 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:29:59,537 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:29:59,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:29:59 BoogieIcfgContainer [2025-02-06 00:29:59,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:29:59,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:29:59,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:29:59,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:29:59,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:29:58" (1/3) ... [2025-02-06 00:29:59,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1605643a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:29:59, skipping insertion in model container [2025-02-06 00:29:59,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:29:58" (2/3) ... [2025-02-06 00:29:59,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1605643a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:29:59, skipping insertion in model container [2025-02-06 00:29:59,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:29:59" (3/3) ... [2025-02-06 00:29:59,549 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-89.i [2025-02-06 00:29:59,563 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:29:59,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-89.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:29:59,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:29:59,639 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;@1d494f4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:29:59,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:29:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 46 states have (on average 1.434782608695652) internal successors, (66), 47 states have internal predecessors, (66), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 00:29:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 00:29:59,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:29:59,652 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:29:59,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:29:59,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:29:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash 438737406, now seen corresponding path program 1 times [2025-02-06 00:29:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:29:59,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373661622] [2025-02-06 00:29:59,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:29:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:29:59,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 00:29:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 00:29:59,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:29:59,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:29:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 00:29:59,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:29:59,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373661622] [2025-02-06 00:29:59,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373661622] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:29:59,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114679725] [2025-02-06 00:29:59,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:29:59,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:29:59,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:29:59,886 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-06 00:29:59,887 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-06 00:29:59,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 00:30:00,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 00:30:00,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:00,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:00,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:30:00,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:30:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-06 00:30:00,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:30:00,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114679725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:00,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:30:00,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:30:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009787571] [2025-02-06 00:30:00,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:00,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:30:00,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:00,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:30:00,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:30:00,070 INFO L87 Difference]: Start difference. First operand has 62 states, 46 states have (on average 1.434782608695652) internal successors, (66), 47 states have internal predecessors, (66), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 00:30:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:00,092 INFO L93 Difference]: Finished difference Result 118 states and 192 transitions. [2025-02-06 00:30:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:30:00,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2025-02-06 00:30:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:00,100 INFO L225 Difference]: With dead ends: 118 [2025-02-06 00:30:00,100 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 00:30:00,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-06 00:30:00,105 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:00,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:30:00,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 00:30:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-06 00:30:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 00:30:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2025-02-06 00:30:00,149 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 87 [2025-02-06 00:30:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:00,149 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2025-02-06 00:30:00,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 00:30:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2025-02-06 00:30:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 00:30:00,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:00,155 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:00,161 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-06 00:30:00,356 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-06 00:30:00,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:00,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash 772871133, now seen corresponding path program 1 times [2025-02-06 00:30:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:00,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905912008] [2025-02-06 00:30:00,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:00,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:00,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 00:30:00,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 00:30:00,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:00,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:01,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:01,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905912008] [2025-02-06 00:30:01,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905912008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:01,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:01,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:30:01,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124283638] [2025-02-06 00:30:01,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:01,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:30:01,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:01,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:30:01,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:30:01,045 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:01,293 INFO L93 Difference]: Finished difference Result 172 states and 250 transitions. [2025-02-06 00:30:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:30:01,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2025-02-06 00:30:01,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:01,296 INFO L225 Difference]: With dead ends: 172 [2025-02-06 00:30:01,296 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 00:30:01,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:30:01,297 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 62 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:01,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 274 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:30:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 00:30:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2025-02-06 00:30:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:30:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2025-02-06 00:30:01,327 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 87 [2025-02-06 00:30:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:01,327 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2025-02-06 00:30:01,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2025-02-06 00:30:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 00:30:01,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:01,331 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:01,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:30:01,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1024080226, now seen corresponding path program 1 times [2025-02-06 00:30:01,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:01,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529395423] [2025-02-06 00:30:01,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:01,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 00:30:01,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 00:30:01,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:01,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529395423] [2025-02-06 00:30:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529395423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:02,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 00:30:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147376015] [2025-02-06 00:30:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:02,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 00:30:02,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:02,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 00:30:02,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:30:02,299 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:02,676 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2025-02-06 00:30:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 00:30:02,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2025-02-06 00:30:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:02,679 INFO L225 Difference]: With dead ends: 201 [2025-02-06 00:30:02,679 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 00:30:02,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:30:02,683 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 80 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:02,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 380 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:30:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 00:30:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2025-02-06 00:30:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:30:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2025-02-06 00:30:02,706 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 87 [2025-02-06 00:30:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:02,707 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2025-02-06 00:30:02,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2025-02-06 00:30:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 00:30:02,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:02,709 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:02,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:30:02,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:02,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:02,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1463432607, now seen corresponding path program 1 times [2025-02-06 00:30:02,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:02,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948313640] [2025-02-06 00:30:02,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:02,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:02,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 00:30:02,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 00:30:02,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:02,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948313640] [2025-02-06 00:30:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948313640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:03,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:03,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 00:30:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800253072] [2025-02-06 00:30:03,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:03,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 00:30:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:03,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 00:30:03,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:30:03,301 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:03,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:03,674 INFO L93 Difference]: Finished difference Result 214 states and 309 transitions. [2025-02-06 00:30:03,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 00:30:03,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2025-02-06 00:30:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:03,677 INFO L225 Difference]: With dead ends: 214 [2025-02-06 00:30:03,677 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 00:30:03,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:30:03,679 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 79 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:03,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 588 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:30:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 00:30:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2025-02-06 00:30:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:30:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2025-02-06 00:30:03,708 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 87 [2025-02-06 00:30:03,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:03,708 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2025-02-06 00:30:03,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2025-02-06 00:30:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 00:30:03,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:03,711 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:03,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:30:03,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -990548371, now seen corresponding path program 1 times [2025-02-06 00:30:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:03,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323311011] [2025-02-06 00:30:03,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:03,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 00:30:03,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 00:30:03,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:03,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 00:30:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:04,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323311011] [2025-02-06 00:30:04,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323311011] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:30:04,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542211194] [2025-02-06 00:30:04,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:04,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:04,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:30:04,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:30:04,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 00:30:04,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 00:30:04,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 00:30:04,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:04,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:04,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 00:30:04,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:30:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-06 00:30:05,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:30:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542211194] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 00:30:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:30:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 11] total 24 [2025-02-06 00:30:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882413439] [2025-02-06 00:30:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:05,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 00:30:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:05,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 00:30:05,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-02-06 00:30:05,784 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:06,087 INFO L93 Difference]: Finished difference Result 105 states and 150 transitions. [2025-02-06 00:30:06,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 00:30:06,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2025-02-06 00:30:06,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:06,091 INFO L225 Difference]: With dead ends: 105 [2025-02-06 00:30:06,091 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 00:30:06,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2025-02-06 00:30:06,092 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 77 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:06,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 428 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:30:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 00:30:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-02-06 00:30:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:30:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2025-02-06 00:30:06,119 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 89 [2025-02-06 00:30:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:06,120 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2025-02-06 00:30:06,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2025-02-06 00:30:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 00:30:06,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:06,124 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:06,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 00:30:06,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:06,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:06,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1385147687, now seen corresponding path program 1 times [2025-02-06 00:30:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:06,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056533326] [2025-02-06 00:30:06,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:06,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 00:30:06,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 00:30:06,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:06,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:06,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056533326] [2025-02-06 00:30:06,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056533326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:06,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:06,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:30:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869765519] [2025-02-06 00:30:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:06,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:30:06,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:06,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:30:06,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:30:06,483 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:06,562 INFO L93 Difference]: Finished difference Result 188 states and 268 transitions. [2025-02-06 00:30:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:30:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-02-06 00:30:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:06,564 INFO L225 Difference]: With dead ends: 188 [2025-02-06 00:30:06,564 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 00:30:06,565 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-06 00:30:06,565 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:06,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:30:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 00:30:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2025-02-06 00:30:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:30:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-02-06 00:30:06,589 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 91 [2025-02-06 00:30:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:06,589 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-02-06 00:30:06,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-02-06 00:30:06,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 00:30:06,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:06,590 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:06,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:30:06,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:06,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:06,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2091231101, now seen corresponding path program 1 times [2025-02-06 00:30:06,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:06,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368832731] [2025-02-06 00:30:06,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:06,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:06,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 00:30:06,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 00:30:06,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:06,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 00:30:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:07,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368832731] [2025-02-06 00:30:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368832731] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:30:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858705827] [2025-02-06 00:30:07,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:07,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:07,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:30:07,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:30:07,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 00:30:07,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 00:30:07,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 00:30:07,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:07,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:07,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 00:30:07,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:30:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-06 00:30:08,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:30:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858705827] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 00:30:08,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:30:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 12] total 27 [2025-02-06 00:30:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408012722] [2025-02-06 00:30:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:08,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:30:08,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:08,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:30:08,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2025-02-06 00:30:08,710 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:09,056 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2025-02-06 00:30:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:30:09,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-02-06 00:30:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:09,059 INFO L225 Difference]: With dead ends: 115 [2025-02-06 00:30:09,059 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 00:30:09,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2025-02-06 00:30:09,062 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 111 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:09,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 418 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:30:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 00:30:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2025-02-06 00:30:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:30:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-02-06 00:30:09,075 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 92 [2025-02-06 00:30:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:09,076 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-02-06 00:30:09,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-02-06 00:30:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 00:30:09,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:09,077 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:09,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 00:30:09,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:09,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:09,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1903658982, now seen corresponding path program 1 times [2025-02-06 00:30:09,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:09,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067336170] [2025-02-06 00:30:09,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:09,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 00:30:09,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 00:30:09,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:09,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067336170] [2025-02-06 00:30:09,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067336170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:09,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:09,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:30:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529450333] [2025-02-06 00:30:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:09,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:30:09,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:09,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:30:09,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:30:09,355 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:09,397 INFO L93 Difference]: Finished difference Result 223 states and 311 transitions. [2025-02-06 00:30:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:30:09,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-02-06 00:30:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:09,402 INFO L225 Difference]: With dead ends: 223 [2025-02-06 00:30:09,402 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 00:30:09,403 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-06 00:30:09,403 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:09,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 159 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:30:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 00:30:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2025-02-06 00:30:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 103 states have (on average 1.2524271844660195) internal successors, (129), 104 states have internal predecessors, (129), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 00:30:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2025-02-06 00:30:09,422 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 94 [2025-02-06 00:30:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:09,422 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2025-02-06 00:30:09,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2025-02-06 00:30:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 00:30:09,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:09,424 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:09,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 00:30:09,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:09,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash 795379373, now seen corresponding path program 1 times [2025-02-06 00:30:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024538987] [2025-02-06 00:30:09,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:09,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:09,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 00:30:09,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 00:30:09,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:09,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:09,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024538987] [2025-02-06 00:30:09,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024538987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:09,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:09,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:30:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986345336] [2025-02-06 00:30:09,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:09,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:30:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:09,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:30:09,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:30:09,506 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:09,648 INFO L93 Difference]: Finished difference Result 405 states and 557 transitions. [2025-02-06 00:30:09,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:30:09,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-02-06 00:30:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:09,653 INFO L225 Difference]: With dead ends: 405 [2025-02-06 00:30:09,654 INFO L226 Difference]: Without dead ends: 297 [2025-02-06 00:30:09,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:30:09,655 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 120 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:09,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 216 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:30:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-06 00:30:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 234. [2025-02-06 00:30:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 174 states have (on average 1.2183908045977012) internal successors, (212), 176 states have internal predecessors, (212), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-06 00:30:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 318 transitions. [2025-02-06 00:30:09,689 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 318 transitions. Word has length 95 [2025-02-06 00:30:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:09,689 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 318 transitions. [2025-02-06 00:30:09,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 318 transitions. [2025-02-06 00:30:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 00:30:09,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:09,691 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:09,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 00:30:09,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:09,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:09,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2012833995, now seen corresponding path program 1 times [2025-02-06 00:30:09,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:09,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318923744] [2025-02-06 00:30:09,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:09,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:09,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 00:30:09,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 00:30:09,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:09,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318923744] [2025-02-06 00:30:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318923744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:09,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:09,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:30:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914884156] [2025-02-06 00:30:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:09,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:30:09,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:09,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:30:09,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:30:09,789 INFO L87 Difference]: Start difference. First operand 234 states and 318 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:09,880 INFO L93 Difference]: Finished difference Result 437 states and 593 transitions. [2025-02-06 00:30:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:30:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-02-06 00:30:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:09,882 INFO L225 Difference]: With dead ends: 437 [2025-02-06 00:30:09,882 INFO L226 Difference]: Without dead ends: 236 [2025-02-06 00:30:09,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-06 00:30:09,883 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 42 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:09,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 195 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:30:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-06 00:30:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-02-06 00:30:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 174 states have (on average 1.2126436781609196) internal successors, (211), 176 states have internal predecessors, (211), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-06 00:30:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 317 transitions. [2025-02-06 00:30:09,909 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 317 transitions. Word has length 105 [2025-02-06 00:30:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:09,910 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 317 transitions. [2025-02-06 00:30:09,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 317 transitions. [2025-02-06 00:30:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 00:30:09,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:09,911 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:30:09,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 00:30:09,912 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:09,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1285060948, now seen corresponding path program 1 times [2025-02-06 00:30:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:09,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930796895] [2025-02-06 00:30:09,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:09,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 00:30:09,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 00:30:09,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:09,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-06 00:30:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:11,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930796895] [2025-02-06 00:30:11,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930796895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:11,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:11,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 00:30:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235526537] [2025-02-06 00:30:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:11,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 00:30:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:11,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 00:30:11,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 00:30:11,165 INFO L87 Difference]: Start difference. First operand 234 states and 317 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:12,275 INFO L93 Difference]: Finished difference Result 252 states and 334 transitions. [2025-02-06 00:30:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 00:30:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 105 [2025-02-06 00:30:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:12,278 INFO L225 Difference]: With dead ends: 252 [2025-02-06 00:30:12,279 INFO L226 Difference]: Without dead ends: 250 [2025-02-06 00:30:12,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2025-02-06 00:30:12,280 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 83 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:12,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 541 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 00:30:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-06 00:30:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 230. [2025-02-06 00:30:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 170 states have (on average 1.2117647058823529) internal successors, (206), 172 states have internal predecessors, (206), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-06 00:30:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 312 transitions. [2025-02-06 00:30:12,315 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 312 transitions. Word has length 105 [2025-02-06 00:30:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:12,316 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 312 transitions. [2025-02-06 00:30:12,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 312 transitions. [2025-02-06 00:30:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 00:30:12,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:12,318 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:12,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 00:30:12,318 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:12,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1143900743, now seen corresponding path program 1 times [2025-02-06 00:30:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590559170] [2025-02-06 00:30:12,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:12,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 00:30:12,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 00:30:12,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:12,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-06 00:30:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:13,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590559170] [2025-02-06 00:30:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590559170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:13,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:13,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:30:13,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365220446] [2025-02-06 00:30:13,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:13,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:30:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:13,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:30:13,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:30:13,995 INFO L87 Difference]: Start difference. First operand 230 states and 312 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:14,496 INFO L93 Difference]: Finished difference Result 432 states and 586 transitions. [2025-02-06 00:30:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:30:14,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 173 [2025-02-06 00:30:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:14,499 INFO L225 Difference]: With dead ends: 432 [2025-02-06 00:30:14,499 INFO L226 Difference]: Without dead ends: 317 [2025-02-06 00:30:14,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:30:14,500 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 80 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:14,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 266 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 00:30:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-06 00:30:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 230. [2025-02-06 00:30:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 170 states have (on average 1.2117647058823529) internal successors, (206), 172 states have internal predecessors, (206), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-06 00:30:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 312 transitions. [2025-02-06 00:30:14,526 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 312 transitions. Word has length 173 [2025-02-06 00:30:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:14,527 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 312 transitions. [2025-02-06 00:30:14,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 312 transitions. [2025-02-06 00:30:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 00:30:14,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:14,529 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:14,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 00:30:14,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:14,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1343612090, now seen corresponding path program 1 times [2025-02-06 00:30:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:14,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800507776] [2025-02-06 00:30:14,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:14,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:14,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 00:30:14,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 00:30:14,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:14,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-06 00:30:15,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:15,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800507776] [2025-02-06 00:30:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800507776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:15,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:30:15,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876619048] [2025-02-06 00:30:15,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:15,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:30:15,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:15,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:30:15,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:30:15,996 INFO L87 Difference]: Start difference. First operand 230 states and 312 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:16,358 INFO L93 Difference]: Finished difference Result 429 states and 578 transitions. [2025-02-06 00:30:16,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:30:16,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 173 [2025-02-06 00:30:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:16,361 INFO L225 Difference]: With dead ends: 429 [2025-02-06 00:30:16,361 INFO L226 Difference]: Without dead ends: 314 [2025-02-06 00:30:16,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:30:16,362 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 81 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:16,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 254 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:30:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-06 00:30:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 208. [2025-02-06 00:30:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 148 states have (on average 1.162162162162162) internal successors, (172), 150 states have internal predecessors, (172), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-06 00:30:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 278 transitions. [2025-02-06 00:30:16,384 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 278 transitions. Word has length 173 [2025-02-06 00:30:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:16,384 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 278 transitions. [2025-02-06 00:30:16,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 278 transitions. [2025-02-06 00:30:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 00:30:16,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:16,387 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:16,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 00:30:16,387 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:16,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2007176504, now seen corresponding path program 1 times [2025-02-06 00:30:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686496404] [2025-02-06 00:30:16,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:16,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 00:30:16,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 00:30:16,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:16,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-06 00:30:19,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:19,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686496404] [2025-02-06 00:30:19,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686496404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:19,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:19,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 00:30:19,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547731868] [2025-02-06 00:30:19,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:19,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 00:30:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:19,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 00:30:19,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 00:30:19,086 INFO L87 Difference]: Start difference. First operand 208 states and 278 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:20,177 INFO L93 Difference]: Finished difference Result 408 states and 542 transitions. [2025-02-06 00:30:20,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:30:20,177 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 181 [2025-02-06 00:30:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:20,179 INFO L225 Difference]: With dead ends: 408 [2025-02-06 00:30:20,179 INFO L226 Difference]: Without dead ends: 315 [2025-02-06 00:30:20,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2025-02-06 00:30:20,180 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 115 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:20,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 809 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 00:30:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-06 00:30:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 293. [2025-02-06 00:30:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.1813953488372093) internal successors, (254), 219 states have internal predecessors, (254), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 00:30:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 392 transitions. [2025-02-06 00:30:20,216 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 392 transitions. Word has length 181 [2025-02-06 00:30:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:20,216 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 392 transitions. [2025-02-06 00:30:20,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 392 transitions. [2025-02-06 00:30:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 00:30:20,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:20,219 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-06 00:30:20,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 00:30:20,219 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:20,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:20,220 INFO L85 PathProgramCache]: Analyzing trace with hash -973249594, now seen corresponding path program 1 times [2025-02-06 00:30:20,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:20,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923133149] [2025-02-06 00:30:20,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:20,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:20,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 00:30:20,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 00:30:20,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:20,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-06 00:30:21,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:21,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923133149] [2025-02-06 00:30:21,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923133149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:21,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:21,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 00:30:21,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763010436] [2025-02-06 00:30:21,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:21,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 00:30:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:21,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 00:30:21,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 00:30:21,156 INFO L87 Difference]: Start difference. First operand 293 states and 392 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:21,495 INFO L93 Difference]: Finished difference Result 519 states and 694 transitions. [2025-02-06 00:30:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:30:21,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 187 [2025-02-06 00:30:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:21,498 INFO L225 Difference]: With dead ends: 519 [2025-02-06 00:30:21,498 INFO L226 Difference]: Without dead ends: 341 [2025-02-06 00:30:21,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-06 00:30:21,503 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 96 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:21,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 330 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:30:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-06 00:30:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 293. [2025-02-06 00:30:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.1627906976744187) internal successors, (250), 219 states have internal predecessors, (250), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 00:30:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 388 transitions. [2025-02-06 00:30:21,538 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 388 transitions. Word has length 187 [2025-02-06 00:30:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:21,539 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 388 transitions. [2025-02-06 00:30:21,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 388 transitions. [2025-02-06 00:30:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 00:30:21,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:21,542 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-06 00:30:21,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 00:30:21,542 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:21,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1240257936, now seen corresponding path program 1 times [2025-02-06 00:30:21,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:21,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842674862] [2025-02-06 00:30:21,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:21,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 00:30:21,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 00:30:21,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:21,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-06 00:30:22,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:22,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842674862] [2025-02-06 00:30:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842674862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:22,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:30:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118638773] [2025-02-06 00:30:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:22,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:30:22,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:22,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:30:22,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:30:22,862 INFO L87 Difference]: Start difference. First operand 293 states and 388 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:23,282 INFO L93 Difference]: Finished difference Result 519 states and 686 transitions. [2025-02-06 00:30:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 00:30:23,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 191 [2025-02-06 00:30:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:23,285 INFO L225 Difference]: With dead ends: 519 [2025-02-06 00:30:23,286 INFO L226 Difference]: Without dead ends: 341 [2025-02-06 00:30:23,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:30:23,289 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 137 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:23,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 306 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:30:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-06 00:30:23,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 293. [2025-02-06 00:30:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.158139534883721) internal successors, (249), 219 states have internal predecessors, (249), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 00:30:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 387 transitions. [2025-02-06 00:30:23,328 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 387 transitions. Word has length 191 [2025-02-06 00:30:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:23,328 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 387 transitions. [2025-02-06 00:30:23,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 387 transitions. [2025-02-06 00:30:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 00:30:23,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:23,332 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-06 00:30:23,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 00:30:23,332 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:23,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash 243185583, now seen corresponding path program 1 times [2025-02-06 00:30:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:23,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38005550] [2025-02-06 00:30:23,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:23,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:23,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 00:30:23,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 00:30:23,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:23,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-06 00:30:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38005550] [2025-02-06 00:30:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38005550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:26,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 00:30:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200966895] [2025-02-06 00:30:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:26,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 00:30:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:26,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 00:30:26,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 00:30:26,258 INFO L87 Difference]: Start difference. First operand 293 states and 387 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:27,528 INFO L93 Difference]: Finished difference Result 311 states and 404 transitions. [2025-02-06 00:30:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 00:30:27,528 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 191 [2025-02-06 00:30:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:27,530 INFO L225 Difference]: With dead ends: 311 [2025-02-06 00:30:27,530 INFO L226 Difference]: Without dead ends: 309 [2025-02-06 00:30:27,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-02-06 00:30:27,532 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 84 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:27,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 941 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 00:30:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-06 00:30:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 287. [2025-02-06 00:30:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 209 states have (on average 1.1578947368421053) internal successors, (242), 213 states have internal predecessors, (242), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 00:30:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 380 transitions. [2025-02-06 00:30:27,567 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 380 transitions. Word has length 191 [2025-02-06 00:30:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:27,568 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 380 transitions. [2025-02-06 00:30:27,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 380 transitions. [2025-02-06 00:30:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-06 00:30:27,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:27,572 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:27,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 00:30:27,572 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:27,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1963490716, now seen corresponding path program 2 times [2025-02-06 00:30:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:27,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581755045] [2025-02-06 00:30:27,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 00:30:27,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:27,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 267 statements into 2 equivalence classes. [2025-02-06 00:30:27,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 267 statements. [2025-02-06 00:30:27,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 00:30:27,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3044 trivial. 0 not checked. [2025-02-06 00:30:28,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:28,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581755045] [2025-02-06 00:30:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581755045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:28,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:30:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822631428] [2025-02-06 00:30:28,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:28,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:30:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:28,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:30:28,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:30:28,555 INFO L87 Difference]: Start difference. First operand 287 states and 380 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:29,213 INFO L93 Difference]: Finished difference Result 349 states and 444 transitions. [2025-02-06 00:30:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 00:30:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 267 [2025-02-06 00:30:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:29,216 INFO L225 Difference]: With dead ends: 349 [2025-02-06 00:30:29,216 INFO L226 Difference]: Without dead ends: 347 [2025-02-06 00:30:29,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-02-06 00:30:29,217 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 149 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:29,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 434 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 00:30:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-06 00:30:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 289. [2025-02-06 00:30:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 215 states have internal predecessors, (244), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 00:30:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 382 transitions. [2025-02-06 00:30:29,254 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 382 transitions. Word has length 267 [2025-02-06 00:30:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:29,254 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 382 transitions. [2025-02-06 00:30:29,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 382 transitions. [2025-02-06 00:30:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-06 00:30:29,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:29,256 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:29,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 00:30:29,256 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:29,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:29,257 INFO L85 PathProgramCache]: Analyzing trace with hash 347076955, now seen corresponding path program 1 times [2025-02-06 00:30:29,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:29,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860680858] [2025-02-06 00:30:29,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:29,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-06 00:30:29,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-06 00:30:29,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:29,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3050 trivial. 0 not checked. [2025-02-06 00:30:29,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:29,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860680858] [2025-02-06 00:30:29,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860680858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:30:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491190555] [2025-02-06 00:30:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:29,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:30:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:29,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:30:29,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:30:29,343 INFO L87 Difference]: Start difference. First operand 289 states and 382 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:29,438 INFO L93 Difference]: Finished difference Result 574 states and 762 transitions. [2025-02-06 00:30:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:30:29,439 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 270 [2025-02-06 00:30:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:29,444 INFO L225 Difference]: With dead ends: 574 [2025-02-06 00:30:29,444 INFO L226 Difference]: Without dead ends: 400 [2025-02-06 00:30:29,445 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-06 00:30:29,446 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 55 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:29,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 197 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:30:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-06 00:30:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-06 00:30:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 282 states have (on average 1.1312056737588652) internal successors, (319), 289 states have internal predecessors, (319), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 00:30:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 529 transitions. [2025-02-06 00:30:29,501 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 529 transitions. Word has length 270 [2025-02-06 00:30:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:29,502 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 529 transitions. [2025-02-06 00:30:29,502 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 529 transitions. [2025-02-06 00:30:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-06 00:30:29,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:29,505 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:29,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 00:30:29,506 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:29,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash -162081182, now seen corresponding path program 2 times [2025-02-06 00:30:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:29,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442666449] [2025-02-06 00:30:29,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 00:30:29,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:29,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 273 statements into 2 equivalence classes. [2025-02-06 00:30:29,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 273 statements. [2025-02-06 00:30:29,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 00:30:29,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3044 trivial. 0 not checked. [2025-02-06 00:30:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442666449] [2025-02-06 00:30:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442666449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:29,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:29,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:30:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185530764] [2025-02-06 00:30:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:29,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:30:29,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:29,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:30:29,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:30:29,623 INFO L87 Difference]: Start difference. First operand 400 states and 529 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:29,803 INFO L93 Difference]: Finished difference Result 838 states and 1112 transitions. [2025-02-06 00:30:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:30:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 273 [2025-02-06 00:30:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:29,807 INFO L225 Difference]: With dead ends: 838 [2025-02-06 00:30:29,807 INFO L226 Difference]: Without dead ends: 552 [2025-02-06 00:30:29,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:30:29,809 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 131 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:29,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 271 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:30:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-06 00:30:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 411. [2025-02-06 00:30:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 293 states have (on average 1.136518771331058) internal successors, (333), 300 states have internal predecessors, (333), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 00:30:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 543 transitions. [2025-02-06 00:30:29,882 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 543 transitions. Word has length 273 [2025-02-06 00:30:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:29,883 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 543 transitions. [2025-02-06 00:30:29,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 543 transitions. [2025-02-06 00:30:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-06 00:30:29,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:29,887 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:29,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 00:30:29,887 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:29,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash -64269441, now seen corresponding path program 1 times [2025-02-06 00:30:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:29,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721235453] [2025-02-06 00:30:29,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:29,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-06 00:30:29,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-06 00:30:29,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:29,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3050 trivial. 0 not checked. [2025-02-06 00:30:29,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:29,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721235453] [2025-02-06 00:30:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721235453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:30:29,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:30:29,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:30:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390650461] [2025-02-06 00:30:29,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:30:29,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:30:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:29,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:30:29,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:30:29,965 INFO L87 Difference]: Start difference. First operand 411 states and 543 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:30,077 INFO L93 Difference]: Finished difference Result 883 states and 1174 transitions. [2025-02-06 00:30:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:30:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 274 [2025-02-06 00:30:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:30,084 INFO L225 Difference]: With dead ends: 883 [2025-02-06 00:30:30,085 INFO L226 Difference]: Without dead ends: 587 [2025-02-06 00:30:30,086 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-06 00:30:30,087 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:30,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 130 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:30:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-06 00:30:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 515. [2025-02-06 00:30:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 357 states have (on average 1.123249299719888) internal successors, (401), 367 states have internal predecessors, (401), 141 states have call successors, (141), 16 states have call predecessors, (141), 16 states have return successors, (141), 131 states have call predecessors, (141), 141 states have call successors, (141) [2025-02-06 00:30:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 683 transitions. [2025-02-06 00:30:30,172 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 683 transitions. Word has length 274 [2025-02-06 00:30:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:30,174 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 683 transitions. [2025-02-06 00:30:30,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-02-06 00:30:30,174 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 683 transitions. [2025-02-06 00:30:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-06 00:30:30,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:30:30,176 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:30,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 00:30:30,177 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:30:30,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:30:30,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1442358269, now seen corresponding path program 1 times [2025-02-06 00:30:30,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:30:30,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329849935] [2025-02-06 00:30:30,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:30,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:30:30,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 00:30:30,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 00:30:30,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:30,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 3038 trivial. 0 not checked. [2025-02-06 00:30:30,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:30:30,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329849935] [2025-02-06 00:30:30,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329849935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:30:30,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409760322] [2025-02-06 00:30:30,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:30:30,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:30:30,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:30:30,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 00:30:30,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 00:30:30,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 00:30:30,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 00:30:30,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:30:30,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:30:30,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 00:30:30,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:30:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 688 proven. 12 refuted. 0 times theorem prover too weak. 2364 trivial. 0 not checked. [2025-02-06 00:30:30,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:30:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 140 proven. 12 refuted. 0 times theorem prover too weak. 2912 trivial. 0 not checked. [2025-02-06 00:30:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409760322] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 00:30:31,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 00:30:31,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-02-06 00:30:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143131999] [2025-02-06 00:30:31,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 00:30:31,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:30:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:30:31,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:30:31,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:30:31,051 INFO L87 Difference]: Start difference. First operand 515 states and 683 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 00:30:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:30:32,352 INFO L93 Difference]: Finished difference Result 739 states and 967 transitions. [2025-02-06 00:30:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 00:30:32,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 275 [2025-02-06 00:30:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:30:32,355 INFO L225 Difference]: With dead ends: 739 [2025-02-06 00:30:32,355 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 00:30:32,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 548 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2025-02-06 00:30:32,360 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 139 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:30:32,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 291 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 00:30:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 00:30:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 00:30:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 00:30:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 00:30:32,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2025-02-06 00:30:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:30:32,362 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 00:30:32,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 00:30:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 00:30:32,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 00:30:32,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:30:32,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 00:30:32,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-06 00:30:32,569 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:30:32,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 00:30:39,816 WARN L286 SmtUtils]: Spent 5.86s on a formula simplification. DAG size of input: 282 DAG size of output: 311 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-06 00:30:44,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:30:44,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:30:44 BoogieIcfgContainer [2025-02-06 00:30:44,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:30:44,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:30:44,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:30:44,310 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:30:44,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:29:59" (3/4) ... [2025-02-06 00:30:44,313 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 00:30:44,318 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 00:30:44,325 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 00:30:44,325 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 00:30:44,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 00:30:44,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 00:30:44,407 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 00:30:44,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 00:30:44,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:30:44,408 INFO L158 Benchmark]: Toolchain (without parser) took 45728.61ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 112.9MB in the beginning and 479.8MB in the end (delta: -366.8MB). Peak memory consumption was 693.3MB. Max. memory is 16.1GB. [2025-02-06 00:30:44,409 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:30:44,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.08ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:30:44,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.44ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 97.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:30:44,413 INFO L158 Benchmark]: Boogie Preprocessor took 45.22ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:30:44,413 INFO L158 Benchmark]: IcfgBuilder took 494.43ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 74.1MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 00:30:44,413 INFO L158 Benchmark]: TraceAbstraction took 44769.08ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 73.6MB in the beginning and 488.1MB in the end (delta: -414.5MB). Peak memory consumption was 681.6MB. Max. memory is 16.1GB. [2025-02-06 00:30:44,413 INFO L158 Benchmark]: Witness Printer took 97.96ms. Allocated memory is still 1.2GB. Free memory was 488.1MB in the beginning and 479.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:30:44,414 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.08ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.1MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.44ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 97.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.22ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 94.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 494.43ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 74.1MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 44769.08ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 73.6MB in the beginning and 488.1MB in the end (delta: -414.5MB). Peak memory consumption was 681.6MB. Max. memory is 16.1GB. * Witness Printer took 97.96ms. Allocated memory is still 1.2GB. Free memory was 488.1MB in the beginning and 479.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.0s, OverallIterations: 22, TraceHistogramMax: 39, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1845 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1836 mSDsluCounter, 7659 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5441 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5186 IncrementalHoareTripleChecker+Invalid, 5376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 2218 mSDtfsCounter, 5186 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1247 GetRequests, 1033 SyntacticMatches, 7 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=515occurred in iteration=21, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 831 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 4017 NumberOfCodeBlocks, 3543 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4444 ConstructedInterpolants, 0 QuantifiedInterpolants, 22193 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 29 InterpolantComputations, 21 PerfectInterpolantSequences, 34250/34434 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Location Invariant Derived location invariant: ((((((((var_1_8 < (var_1_14 + 1)) || (0 < 1)) && (var_1_14 == ((var_1_8 >= 0) ? (var_1_8 % 65536) : ((var_1_8 % 65536) + 65536)))) && (var_1_13 == var_1_10)) && (var_1_15 == var_1_3)) && (var_1_7 <= 0)) && (var_1_14 <= var_1_8)) || (((((((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && (((var_1_14 / var_1_3) + 1) <= var_1_14)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && (var_1_1 == 0)) && (0 <= 0)) && ((var_1_8 + 1) == 0)) && (var_1_7 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-02-06 00:30:44,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE