./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-97.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_operatoramount_amount500_file-97.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 27b7d41c83bd27c4821a45cf0c1b489a71375b91c18644eeffdc9ad906f09c11 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:46:09,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:46:09,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:46:09,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:46:09,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:46:09,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:46:09,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:46:09,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:46:09,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:46:09,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:46:09,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:46:09,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:46:09,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:46:09,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:46:09,915 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:46:09,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:46:09,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:46:09,917 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:46:09,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:46:09,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:46:09,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:46:09,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:46:09,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:46:09,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:46:09,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:46:09,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:46:09,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:46:09,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:46:09,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:46:09,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:46:09,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:46:09,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:46:09,918 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 -> 27b7d41c83bd27c4821a45cf0c1b489a71375b91c18644eeffdc9ad906f09c11 [2025-02-06 02:46:10,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:46:10,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:46:10,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:46:10,129 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:46:10,129 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:46:10,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-97.i [2025-02-06 02:46:11,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/199691729/8544c6d9a4d14846a686f766725298eb/FLAG65d2bae1f [2025-02-06 02:46:11,590 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:46:11,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-97.i [2025-02-06 02:46:11,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/199691729/8544c6d9a4d14846a686f766725298eb/FLAG65d2bae1f [2025-02-06 02:46:11,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/199691729/8544c6d9a4d14846a686f766725298eb [2025-02-06 02:46:11,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:46:11,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:46:11,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:46:11,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:46:11,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:46:11,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:46:11" (1/1) ... [2025-02-06 02:46:11,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:11, skipping insertion in model container [2025-02-06 02:46:11,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:46:11" (1/1) ... [2025-02-06 02:46:11,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:46:11,786 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_operatoramount_amount500_file-97.i[916,929] [2025-02-06 02:46:12,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:46:12,032 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:46:12,041 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_operatoramount_amount500_file-97.i[916,929] [2025-02-06 02:46:12,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:46:12,135 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:46:12,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12 WrapperNode [2025-02-06 02:46:12,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:46:12,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:46:12,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:46:12,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:46:12,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,242 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 818 [2025-02-06 02:46:12,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:46:12,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:46:12,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:46:12,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:46:12,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,335 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 02:46:12,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:46:12,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:46:12,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:46:12,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:46:12,397 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (1/1) ... [2025-02-06 02:46:12,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:46:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:12,426 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 02:46:12,429 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 02:46:12,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:46:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:46:12,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:46:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:46:12,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:46:12,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:46:12,565 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:46:12,567 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:46:13,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L650: havoc property_#t~bitwise52#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~bitwise56#1;havoc property_#t~short57#1;havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short61#1;havoc property_#t~bitwise62#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~bitwise65#1;havoc property_#t~ite68#1;havoc property_#t~ite67#1;havoc property_#t~bitwise66#1;havoc property_#t~short69#1;havoc property_#t~bitwise70#1;havoc property_#t~short71#1;havoc property_#t~ite73#1;havoc property_#t~bitwise72#1;havoc property_#t~short74#1; [2025-02-06 02:46:13,804 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2025-02-06 02:46:13,805 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:46:13,837 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:46:13,839 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:46:13,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:46:13 BoogieIcfgContainer [2025-02-06 02:46:13,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:46:13,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:46:13,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:46:13,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:46:13,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:46:11" (1/3) ... [2025-02-06 02:46:13,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66858d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:46:13, skipping insertion in model container [2025-02-06 02:46:13,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:46:12" (2/3) ... [2025-02-06 02:46:13,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66858d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:46:13, skipping insertion in model container [2025-02-06 02:46:13,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:46:13" (3/3) ... [2025-02-06 02:46:13,848 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-97.i [2025-02-06 02:46:13,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:46:13,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-97.i that has 2 procedures, 324 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:46:13,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:46:13,924 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;@672fbe48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:46:13,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:46:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 324 states, 249 states have (on average 1.5502008032128514) internal successors, (386), 250 states have internal predecessors, (386), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 02:46:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-06 02:46:13,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:13,963 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:13,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:13,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash 477439855, now seen corresponding path program 1 times [2025-02-06 02:46:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:13,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590571642] [2025-02-06 02:46:13,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:13,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:14,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-06 02:46:14,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-06 02:46:14,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:14,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-02-06 02:46:14,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590571642] [2025-02-06 02:46:14,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590571642] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624066220] [2025-02-06 02:46:14,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:14,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:14,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:14,584 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 02:46:14,586 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 02:46:14,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-06 02:46:14,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-06 02:46:14,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:14,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:14,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:46:14,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-02-06 02:46:14,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:46:14,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624066220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:14,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:46:14,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:46:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971759389] [2025-02-06 02:46:15,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:15,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:46:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:15,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:46:15,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:46:15,022 INFO L87 Difference]: Start difference. First operand has 324 states, 249 states have (on average 1.5502008032128514) internal successors, (386), 250 states have internal predecessors, (386), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-02-06 02:46:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:15,093 INFO L93 Difference]: Finished difference Result 642 states and 1127 transitions. [2025-02-06 02:46:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:46:15,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 503 [2025-02-06 02:46:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:15,103 INFO L225 Difference]: With dead ends: 642 [2025-02-06 02:46:15,103 INFO L226 Difference]: Without dead ends: 321 [2025-02-06 02:46:15,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 504 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 02:46:15,113 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:15,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:46:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-06 02:46:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-02-06 02:46:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 02:46:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 522 transitions. [2025-02-06 02:46:15,174 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 522 transitions. Word has length 503 [2025-02-06 02:46:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:15,174 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 522 transitions. [2025-02-06 02:46:15,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-02-06 02:46:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 522 transitions. [2025-02-06 02:46:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-06 02:46:15,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:15,183 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:15,192 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 02:46:15,387 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 02:46:15,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:15,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:15,388 INFO L85 PathProgramCache]: Analyzing trace with hash -198910289, now seen corresponding path program 1 times [2025-02-06 02:46:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:15,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137479530] [2025-02-06 02:46:15,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:15,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:15,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-06 02:46:15,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-06 02:46:15,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:15,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137479530] [2025-02-06 02:46:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137479530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:16,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:16,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:16,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092822665] [2025-02-06 02:46:16,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:16,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:16,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:16,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:16,074 INFO L87 Difference]: Start difference. First operand 321 states and 522 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:16,238 INFO L93 Difference]: Finished difference Result 828 states and 1344 transitions. [2025-02-06 02:46:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:16,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 503 [2025-02-06 02:46:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:16,243 INFO L225 Difference]: With dead ends: 828 [2025-02-06 02:46:16,243 INFO L226 Difference]: Without dead ends: 510 [2025-02-06 02:46:16,244 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 02:46:16,245 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 274 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:16,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1026 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-02-06 02:46:16,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 507. [2025-02-06 02:46:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 410 states have (on average 1.5414634146341464) internal successors, (632), 411 states have internal predecessors, (632), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2025-02-06 02:46:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 820 transitions. [2025-02-06 02:46:16,301 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 820 transitions. Word has length 503 [2025-02-06 02:46:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:16,304 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 820 transitions. [2025-02-06 02:46:16,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 820 transitions. [2025-02-06 02:46:16,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-06 02:46:16,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:16,311 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:16,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:46:16,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:16,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash -206669648, now seen corresponding path program 1 times [2025-02-06 02:46:16,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:16,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191864077] [2025-02-06 02:46:16,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:16,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:16,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-06 02:46:16,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-06 02:46:16,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:16,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:17,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191864077] [2025-02-06 02:46:17,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191864077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:17,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:17,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:17,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790098520] [2025-02-06 02:46:17,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:17,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:17,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:17,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:17,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:17,127 INFO L87 Difference]: Start difference. First operand 507 states and 820 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:17,204 INFO L93 Difference]: Finished difference Result 1015 states and 1643 transitions. [2025-02-06 02:46:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 503 [2025-02-06 02:46:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:17,213 INFO L225 Difference]: With dead ends: 1015 [2025-02-06 02:46:17,214 INFO L226 Difference]: Without dead ends: 511 [2025-02-06 02:46:17,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:17,215 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 0 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:17,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1494 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:46:17,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-06 02:46:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-02-06 02:46:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 414 states have (on average 1.536231884057971) internal successors, (636), 415 states have internal predecessors, (636), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2025-02-06 02:46:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 824 transitions. [2025-02-06 02:46:17,252 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 824 transitions. Word has length 503 [2025-02-06 02:46:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:17,253 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 824 transitions. [2025-02-06 02:46:17,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 824 transitions. [2025-02-06 02:46:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-02-06 02:46:17,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:17,259 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:17,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:46:17,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:17,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash 12512125, now seen corresponding path program 1 times [2025-02-06 02:46:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936694756] [2025-02-06 02:46:17,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:17,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:17,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-06 02:46:17,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-06 02:46:17,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:17,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:18,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:18,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936694756] [2025-02-06 02:46:18,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936694756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:18,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:18,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:46:18,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253270053] [2025-02-06 02:46:18,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:18,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:46:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:18,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:46:18,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:46:18,648 INFO L87 Difference]: Start difference. First operand 511 states and 824 transitions. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:19,398 INFO L93 Difference]: Finished difference Result 2581 states and 4176 transitions. [2025-02-06 02:46:19,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:46:19,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 504 [2025-02-06 02:46:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:19,409 INFO L225 Difference]: With dead ends: 2581 [2025-02-06 02:46:19,409 INFO L226 Difference]: Without dead ends: 2073 [2025-02-06 02:46:19,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:46:19,412 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 1374 mSDsluCounter, 3169 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 4169 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:19,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 4169 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:46:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2025-02-06 02:46:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1071. [2025-02-06 02:46:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 840 states have (on average 1.5154761904761904) internal successors, (1273), 843 states have internal predecessors, (1273), 224 states have call successors, (224), 6 states have call predecessors, (224), 6 states have return successors, (224), 221 states have call predecessors, (224), 224 states have call successors, (224) [2025-02-06 02:46:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1721 transitions. [2025-02-06 02:46:19,532 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1721 transitions. Word has length 504 [2025-02-06 02:46:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:19,533 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1721 transitions. [2025-02-06 02:46:19,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1721 transitions. [2025-02-06 02:46:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-02-06 02:46:19,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:19,541 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:19,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:46:19,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:19,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash 688204734, now seen corresponding path program 1 times [2025-02-06 02:46:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:19,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818453950] [2025-02-06 02:46:19,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:19,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:19,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-06 02:46:20,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-06 02:46:20,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:20,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818453950] [2025-02-06 02:46:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818453950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:46:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709387009] [2025-02-06 02:46:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:21,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:46:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:21,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:46:21,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:21,018 INFO L87 Difference]: Start difference. First operand 1071 states and 1721 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:21,666 INFO L93 Difference]: Finished difference Result 5127 states and 8137 transitions. [2025-02-06 02:46:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:46:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 504 [2025-02-06 02:46:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:21,689 INFO L225 Difference]: With dead ends: 5127 [2025-02-06 02:46:21,690 INFO L226 Difference]: Without dead ends: 4243 [2025-02-06 02:46:21,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:46:21,696 INFO L435 NwaCegarLoop]: 1227 mSDtfsCounter, 1789 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 3225 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:21,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 3225 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:46:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2025-02-06 02:46:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 3299. [2025-02-06 02:46:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 2600 states have (on average 1.5007692307692309) internal successors, (3902), 2612 states have internal predecessors, (3902), 680 states have call successors, (680), 18 states have call predecessors, (680), 18 states have return successors, (680), 668 states have call predecessors, (680), 680 states have call successors, (680) [2025-02-06 02:46:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 5262 transitions. [2025-02-06 02:46:21,961 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 5262 transitions. Word has length 504 [2025-02-06 02:46:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:21,962 INFO L471 AbstractCegarLoop]: Abstraction has 3299 states and 5262 transitions. [2025-02-06 02:46:21,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 5262 transitions. [2025-02-06 02:46:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-02-06 02:46:21,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:21,970 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:21,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:46:21,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash -121282723, now seen corresponding path program 1 times [2025-02-06 02:46:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687792538] [2025-02-06 02:46:21,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:21,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:22,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-06 02:46:22,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-06 02:46:22,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:22,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:23,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:23,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687792538] [2025-02-06 02:46:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687792538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:23,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:23,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:46:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843195608] [2025-02-06 02:46:23,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:46:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:23,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:46:23,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:46:23,080 INFO L87 Difference]: Start difference. First operand 3299 states and 5262 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:23,493 INFO L93 Difference]: Finished difference Result 6283 states and 10004 transitions. [2025-02-06 02:46:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:46:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 504 [2025-02-06 02:46:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:23,512 INFO L225 Difference]: With dead ends: 6283 [2025-02-06 02:46:23,512 INFO L226 Difference]: Without dead ends: 3054 [2025-02-06 02:46:23,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 02:46:23,521 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 618 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:23,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1399 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:46:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2025-02-06 02:46:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 3052. [2025-02-06 02:46:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3052 states, 2433 states have (on average 1.4985614467735306) internal successors, (3646), 2441 states have internal predecessors, (3646), 592 states have call successors, (592), 26 states have call predecessors, (592), 26 states have return successors, (592), 584 states have call predecessors, (592), 592 states have call successors, (592) [2025-02-06 02:46:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 4830 transitions. [2025-02-06 02:46:23,677 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 4830 transitions. Word has length 504 [2025-02-06 02:46:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:23,678 INFO L471 AbstractCegarLoop]: Abstraction has 3052 states and 4830 transitions. [2025-02-06 02:46:23,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 4830 transitions. [2025-02-06 02:46:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:46:23,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:23,684 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:23,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:46:23,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:23,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1406496344, now seen corresponding path program 1 times [2025-02-06 02:46:23,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:23,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057028355] [2025-02-06 02:46:23,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:23,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:46:24,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:46:24,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:24,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:24,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:24,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057028355] [2025-02-06 02:46:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057028355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:24,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:24,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:46:24,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554463175] [2025-02-06 02:46:24,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:24,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:46:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:24,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:46:24,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:24,704 INFO L87 Difference]: Start difference. First operand 3052 states and 4830 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:25,347 INFO L93 Difference]: Finished difference Result 8076 states and 12711 transitions. [2025-02-06 02:46:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:46:25,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 505 [2025-02-06 02:46:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:25,377 INFO L225 Difference]: With dead ends: 8076 [2025-02-06 02:46:25,377 INFO L226 Difference]: Without dead ends: 5214 [2025-02-06 02:46:25,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:25,388 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 1065 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:25,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 2274 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:46:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5214 states. [2025-02-06 02:46:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5214 to 2589. [2025-02-06 02:46:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2166 states have (on average 1.5493998153277933) internal successors, (3356), 2168 states have internal predecessors, (3356), 404 states have call successors, (404), 18 states have call predecessors, (404), 18 states have return successors, (404), 402 states have call predecessors, (404), 404 states have call successors, (404) [2025-02-06 02:46:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 4164 transitions. [2025-02-06 02:46:25,567 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 4164 transitions. Word has length 505 [2025-02-06 02:46:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:25,569 INFO L471 AbstractCegarLoop]: Abstraction has 2589 states and 4164 transitions. [2025-02-06 02:46:25,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 4164 transitions. [2025-02-06 02:46:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:46:25,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:25,573 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:25,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:46:25,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:25,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash -702536905, now seen corresponding path program 1 times [2025-02-06 02:46:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:25,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539714075] [2025-02-06 02:46:25,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:25,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:46:25,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:46:25,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:25,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:25,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:25,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539714075] [2025-02-06 02:46:25,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539714075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:25,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:25,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135372717] [2025-02-06 02:46:25,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:25,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:25,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:25,889 INFO L87 Difference]: Start difference. First operand 2589 states and 4164 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:26,073 INFO L93 Difference]: Finished difference Result 7390 states and 11875 transitions. [2025-02-06 02:46:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:26,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 505 [2025-02-06 02:46:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:26,097 INFO L225 Difference]: With dead ends: 7390 [2025-02-06 02:46:26,097 INFO L226 Difference]: Without dead ends: 4991 [2025-02-06 02:46:26,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:26,104 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 332 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:26,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1137 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:46:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2025-02-06 02:46:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4989. [2025-02-06 02:46:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4989 states, 4218 states have (on average 1.548127074442864) internal successors, (6530), 4222 states have internal predecessors, (6530), 736 states have call successors, (736), 34 states have call predecessors, (736), 34 states have return successors, (736), 732 states have call predecessors, (736), 736 states have call successors, (736) [2025-02-06 02:46:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 8002 transitions. [2025-02-06 02:46:26,316 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 8002 transitions. Word has length 505 [2025-02-06 02:46:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:26,318 INFO L471 AbstractCegarLoop]: Abstraction has 4989 states and 8002 transitions. [2025-02-06 02:46:26,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 8002 transitions. [2025-02-06 02:46:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:46:26,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:26,323 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:26,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:46:26,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:26,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1779655753, now seen corresponding path program 1 times [2025-02-06 02:46:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:26,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448183355] [2025-02-06 02:46:26,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:26,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:26,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:46:26,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:46:26,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:26,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:27,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:27,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448183355] [2025-02-06 02:46:27,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448183355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:27,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:27,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:46:27,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186457257] [2025-02-06 02:46:27,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:27,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:46:27,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:27,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:46:27,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:27,181 INFO L87 Difference]: Start difference. First operand 4989 states and 8002 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:27,999 INFO L93 Difference]: Finished difference Result 17456 states and 27905 transitions. [2025-02-06 02:46:28,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:46:28,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 505 [2025-02-06 02:46:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:28,047 INFO L225 Difference]: With dead ends: 17456 [2025-02-06 02:46:28,047 INFO L226 Difference]: Without dead ends: 12666 [2025-02-06 02:46:28,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:28,060 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 1115 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:28,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1937 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:46:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12666 states. [2025-02-06 02:46:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12666 to 9620. [2025-02-06 02:46:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9620 states, 8529 states have (on average 1.5715793176222301) internal successors, (13404), 8545 states have internal predecessors, (13404), 1032 states have call successors, (1032), 58 states have call predecessors, (1032), 58 states have return successors, (1032), 1016 states have call predecessors, (1032), 1032 states have call successors, (1032) [2025-02-06 02:46:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 15468 transitions. [2025-02-06 02:46:28,412 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 15468 transitions. Word has length 505 [2025-02-06 02:46:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:28,412 INFO L471 AbstractCegarLoop]: Abstraction has 9620 states and 15468 transitions. [2025-02-06 02:46:28,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 15468 transitions. [2025-02-06 02:46:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:46:28,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:28,421 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:28,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:46:28,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:28,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 331634616, now seen corresponding path program 1 times [2025-02-06 02:46:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:28,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408972031] [2025-02-06 02:46:28,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:28,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:46:28,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:46:28,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:28,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:29,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408972031] [2025-02-06 02:46:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408972031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:29,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:29,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:46:29,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112384213] [2025-02-06 02:46:29,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:29,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:46:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:29,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:46:29,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:46:29,078 INFO L87 Difference]: Start difference. First operand 9620 states and 15468 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:30,104 INFO L93 Difference]: Finished difference Result 23091 states and 36760 transitions. [2025-02-06 02:46:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:46:30,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 505 [2025-02-06 02:46:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:30,156 INFO L225 Difference]: With dead ends: 23091 [2025-02-06 02:46:30,157 INFO L226 Difference]: Without dead ends: 17772 [2025-02-06 02:46:30,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:46:30,174 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 806 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:30,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 2636 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:46:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17772 states. [2025-02-06 02:46:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17772 to 10493. [2025-02-06 02:46:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10493 states, 9510 states have (on average 1.5868559411146161) internal successors, (15091), 9522 states have internal predecessors, (15091), 928 states have call successors, (928), 54 states have call predecessors, (928), 54 states have return successors, (928), 916 states have call predecessors, (928), 928 states have call successors, (928) [2025-02-06 02:46:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10493 states to 10493 states and 16947 transitions. [2025-02-06 02:46:30,656 INFO L78 Accepts]: Start accepts. Automaton has 10493 states and 16947 transitions. Word has length 505 [2025-02-06 02:46:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:30,657 INFO L471 AbstractCegarLoop]: Abstraction has 10493 states and 16947 transitions. [2025-02-06 02:46:30,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 10493 states and 16947 transitions. [2025-02-06 02:46:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:46:30,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:30,667 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:30,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:46:30,667 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:30,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash 627377459, now seen corresponding path program 1 times [2025-02-06 02:46:30,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:30,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252218296] [2025-02-06 02:46:30,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:30,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:30,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:46:31,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:46:31,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:31,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252218296] [2025-02-06 02:46:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252218296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:36,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:36,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 02:46:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292990278] [2025-02-06 02:46:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:36,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:46:36,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:36,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:46:36,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:46:36,756 INFO L87 Difference]: Start difference. First operand 10493 states and 16947 transitions. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 4 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 4 states have call predecessors, (72), 4 states have call successors, (72) [2025-02-06 02:46:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:47,650 INFO L93 Difference]: Finished difference Result 74894 states and 119878 transitions. [2025-02-06 02:46:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 02:46:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 4 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 4 states have call predecessors, (72), 4 states have call successors, (72) Word has length 505 [2025-02-06 02:46:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:47,786 INFO L225 Difference]: With dead ends: 74894 [2025-02-06 02:46:47,787 INFO L226 Difference]: Without dead ends: 64641 [2025-02-06 02:46:47,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=274, Invalid=596, Unknown=0, NotChecked=0, Total=870 [2025-02-06 02:46:47,810 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 5951 mSDsluCounter, 4027 mSDsCounter, 0 mSdLazyCounter, 3821 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5951 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 4374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:47,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5951 Valid, 4546 Invalid, 4374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3821 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-02-06 02:46:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64641 states. [2025-02-06 02:46:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64641 to 53254. [2025-02-06 02:46:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53254 states, 50561 states have (on average 1.5973180910187694) internal successors, (80762), 50645 states have internal predecessors, (80762), 2464 states have call successors, (2464), 228 states have call predecessors, (2464), 228 states have return successors, (2464), 2380 states have call predecessors, (2464), 2464 states have call successors, (2464) [2025-02-06 02:46:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53254 states to 53254 states and 85690 transitions. [2025-02-06 02:46:49,631 INFO L78 Accepts]: Start accepts. Automaton has 53254 states and 85690 transitions. Word has length 505 [2025-02-06 02:46:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:49,632 INFO L471 AbstractCegarLoop]: Abstraction has 53254 states and 85690 transitions. [2025-02-06 02:46:49,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 4 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 4 states have call predecessors, (72), 4 states have call successors, (72) [2025-02-06 02:46:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 53254 states and 85690 transitions. [2025-02-06 02:46:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-06 02:46:49,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:49,665 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:49,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:46:49,666 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:49,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1043136110, now seen corresponding path program 1 times [2025-02-06 02:46:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130540298] [2025-02-06 02:46:49,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:49,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:46:51,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:46:51,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:51,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 30 proven. 183 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-02-06 02:46:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130540298] [2025-02-06 02:46:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130540298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:46:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434145687] [2025-02-06 02:46:51,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:51,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:51,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:46:51,990 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 02:46:51,993 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 02:46:52,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-06 02:46:52,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-06 02:46:52,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:52,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:52,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 02:46:52,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:46:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 5408 proven. 93 refuted. 0 times theorem prover too weak. 4723 trivial. 0 not checked. [2025-02-06 02:46:52,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:46:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 327 proven. 96 refuted. 0 times theorem prover too weak. 9801 trivial. 0 not checked. [2025-02-06 02:46:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434145687] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:46:53,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:46:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-02-06 02:46:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885231836] [2025-02-06 02:46:53,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:46:53,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 02:46:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:53,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 02:46:53,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:46:53,418 INFO L87 Difference]: Start difference. First operand 53254 states and 85690 transitions. Second operand has 15 states, 15 states have (on average 24.533333333333335) internal successors, (368), 15 states have internal predecessors, (368), 6 states have call successors, (162), 3 states have call predecessors, (162), 7 states have return successors, (164), 6 states have call predecessors, (164), 6 states have call successors, (164) [2025-02-06 02:46:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:55,416 INFO L93 Difference]: Finished difference Result 106665 states and 170983 transitions. [2025-02-06 02:46:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 02:46:55,417 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 24.533333333333335) internal successors, (368), 15 states have internal predecessors, (368), 6 states have call successors, (162), 3 states have call predecessors, (162), 7 states have return successors, (164), 6 states have call predecessors, (164), 6 states have call successors, (164) Word has length 505 [2025-02-06 02:46:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:55,547 INFO L225 Difference]: With dead ends: 106665 [2025-02-06 02:46:55,547 INFO L226 Difference]: Without dead ends: 54018 [2025-02-06 02:46:55,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 1002 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2025-02-06 02:46:55,607 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 1725 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:55,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 1360 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:46:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54018 states. [2025-02-06 02:46:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54018 to 53714. [2025-02-06 02:46:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53714 states, 50906 states have (on average 1.5759831846933563) internal successors, (80227), 50990 states have internal predecessors, (80227), 2464 states have call successors, (2464), 343 states have call predecessors, (2464), 343 states have return successors, (2464), 2380 states have call predecessors, (2464), 2464 states have call successors, (2464) [2025-02-06 02:46:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53714 states to 53714 states and 85155 transitions. [2025-02-06 02:46:57,485 INFO L78 Accepts]: Start accepts. Automaton has 53714 states and 85155 transitions. Word has length 505 [2025-02-06 02:46:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:46:57,486 INFO L471 AbstractCegarLoop]: Abstraction has 53714 states and 85155 transitions. [2025-02-06 02:46:57,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 24.533333333333335) internal successors, (368), 15 states have internal predecessors, (368), 6 states have call successors, (162), 3 states have call predecessors, (162), 7 states have return successors, (164), 6 states have call predecessors, (164), 6 states have call successors, (164) [2025-02-06 02:46:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 53714 states and 85155 transitions. [2025-02-06 02:46:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-06 02:46:57,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:46:57,514 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:46:57,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:46:57,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:46:57,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:46:57,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:46:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash 957731223, now seen corresponding path program 1 times [2025-02-06 02:46:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:46:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140174390] [2025-02-06 02:46:57,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:46:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:46:57,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-06 02:46:57,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-06 02:46:57,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:46:57,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:46:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:46:57,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:46:57,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140174390] [2025-02-06 02:46:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140174390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:46:57,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:46:57,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:46:57,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909437559] [2025-02-06 02:46:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:46:57,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:46:57,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:46:57,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:46:57,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:58,000 INFO L87 Difference]: Start difference. First operand 53714 states and 85155 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:46:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:46:59,524 INFO L93 Difference]: Finished difference Result 106809 states and 169255 transitions. [2025-02-06 02:46:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:46:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 506 [2025-02-06 02:46:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:46:59,625 INFO L225 Difference]: With dead ends: 106809 [2025-02-06 02:46:59,625 INFO L226 Difference]: Without dead ends: 53714 [2025-02-06 02:46:59,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:46:59,681 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 355 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:46:59,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 495 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:46:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53714 states. [2025-02-06 02:47:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53714 to 53714. [2025-02-06 02:47:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53714 states, 50906 states have (on average 1.563489569009547) internal successors, (79591), 50990 states have internal predecessors, (79591), 2464 states have call successors, (2464), 343 states have call predecessors, (2464), 343 states have return successors, (2464), 2380 states have call predecessors, (2464), 2464 states have call successors, (2464) [2025-02-06 02:47:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53714 states to 53714 states and 84519 transitions. [2025-02-06 02:47:02,194 INFO L78 Accepts]: Start accepts. Automaton has 53714 states and 84519 transitions. Word has length 506 [2025-02-06 02:47:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:02,195 INFO L471 AbstractCegarLoop]: Abstraction has 53714 states and 84519 transitions. [2025-02-06 02:47:02,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:47:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 53714 states and 84519 transitions. [2025-02-06 02:47:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-06 02:47:02,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:02,216 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:02,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:47:02,216 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:02,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash 264338518, now seen corresponding path program 1 times [2025-02-06 02:47:02,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:02,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167612466] [2025-02-06 02:47:02,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-06 02:47:03,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-06 02:47:03,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:03,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 66 proven. 147 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-02-06 02:47:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:47:03,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167612466] [2025-02-06 02:47:03,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167612466] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:47:03,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174136529] [2025-02-06 02:47:03,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:03,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:47:03,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:47:03,351 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 02:47:03,354 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 02:47:03,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-06 02:47:03,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-06 02:47:03,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:03,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:03,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 02:47:03,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:47:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4127 proven. 57 refuted. 0 times theorem prover too weak. 6040 trivial. 0 not checked. [2025-02-06 02:47:04,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:47:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 156 proven. 57 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-02-06 02:47:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174136529] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:47:04,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:47:04,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-02-06 02:47:04,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662440165] [2025-02-06 02:47:04,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:47:04,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 02:47:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:47:04,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 02:47:04,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:47:04,540 INFO L87 Difference]: Start difference. First operand 53714 states and 84519 transitions. Second operand has 17 states, 17 states have (on average 16.58823529411765) internal successors, (282), 17 states have internal predecessors, (282), 6 states have call successors, (216), 3 states have call predecessors, (216), 6 states have return successors, (216), 6 states have call predecessors, (216), 6 states have call successors, (216) [2025-02-06 02:47:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:47:07,914 INFO L93 Difference]: Finished difference Result 91798 states and 143577 transitions. [2025-02-06 02:47:07,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-06 02:47:07,914 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.58823529411765) internal successors, (282), 17 states have internal predecessors, (282), 6 states have call successors, (216), 3 states have call predecessors, (216), 6 states have return successors, (216), 6 states have call predecessors, (216), 6 states have call successors, (216) Word has length 506 [2025-02-06 02:47:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:47:07,991 INFO L225 Difference]: With dead ends: 91798 [2025-02-06 02:47:07,992 INFO L226 Difference]: Without dead ends: 38246 [2025-02-06 02:47:08,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1057 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=2233, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 02:47:08,051 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 5361 mSDsluCounter, 4032 mSDsCounter, 0 mSdLazyCounter, 2751 mSolverCounterSat, 1469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5384 SdHoareTripleChecker+Valid, 4526 SdHoareTripleChecker+Invalid, 4220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1469 IncrementalHoareTripleChecker+Valid, 2751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:47:08,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5384 Valid, 4526 Invalid, 4220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1469 Valid, 2751 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 02:47:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states. [2025-02-06 02:47:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38246 to 35812. [2025-02-06 02:47:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35812 states, 33830 states have (on average 1.5440437481525273) internal successors, (52235), 33879 states have internal predecessors, (52235), 1724 states have call successors, (1724), 257 states have call predecessors, (1724), 257 states have return successors, (1724), 1675 states have call predecessors, (1724), 1724 states have call successors, (1724) [2025-02-06 02:47:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35812 states to 35812 states and 55683 transitions. [2025-02-06 02:47:09,231 INFO L78 Accepts]: Start accepts. Automaton has 35812 states and 55683 transitions. Word has length 506 [2025-02-06 02:47:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:09,231 INFO L471 AbstractCegarLoop]: Abstraction has 35812 states and 55683 transitions. [2025-02-06 02:47:09,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.58823529411765) internal successors, (282), 17 states have internal predecessors, (282), 6 states have call successors, (216), 3 states have call predecessors, (216), 6 states have return successors, (216), 6 states have call predecessors, (216), 6 states have call successors, (216) [2025-02-06 02:47:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 35812 states and 55683 transitions. [2025-02-06 02:47:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-02-06 02:47:09,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:09,242 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:09,250 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 02:47:09,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:47:09,443 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:09,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2061665248, now seen corresponding path program 1 times [2025-02-06 02:47:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:09,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931654430] [2025-02-06 02:47:09,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:09,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:09,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-06 02:47:09,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-06 02:47:09,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:09,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:47:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:47:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931654430] [2025-02-06 02:47:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931654430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:47:10,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:47:10,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:47:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057155770] [2025-02-06 02:47:10,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:47:10,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:47:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:47:10,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:47:10,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:47:10,015 INFO L87 Difference]: Start difference. First operand 35812 states and 55683 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:47:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:47:11,408 INFO L93 Difference]: Finished difference Result 79691 states and 123806 transitions. [2025-02-06 02:47:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:47:11,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 507 [2025-02-06 02:47:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:47:11,481 INFO L225 Difference]: With dead ends: 79691 [2025-02-06 02:47:11,481 INFO L226 Difference]: Without dead ends: 43957 [2025-02-06 02:47:11,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:47:11,520 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 448 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:47:11,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 2101 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:47:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43957 states. [2025-02-06 02:47:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43957 to 43640. [2025-02-06 02:47:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43640 states, 41618 states have (on average 1.5446922004901724) internal successors, (64287), 41666 states have internal predecessors, (64287), 1760 states have call successors, (1760), 261 states have call predecessors, (1760), 261 states have return successors, (1760), 1712 states have call predecessors, (1760), 1760 states have call successors, (1760) [2025-02-06 02:47:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43640 states to 43640 states and 67807 transitions. [2025-02-06 02:47:12,644 INFO L78 Accepts]: Start accepts. Automaton has 43640 states and 67807 transitions. Word has length 507 [2025-02-06 02:47:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:12,645 INFO L471 AbstractCegarLoop]: Abstraction has 43640 states and 67807 transitions. [2025-02-06 02:47:12,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:47:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 43640 states and 67807 transitions. [2025-02-06 02:47:12,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-02-06 02:47:12,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:12,654 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:12,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:47:12,655 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:12,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1108463615, now seen corresponding path program 1 times [2025-02-06 02:47:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403944284] [2025-02-06 02:47:12,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:12,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-06 02:47:13,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-06 02:47:13,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:13,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:47:14,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:47:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403944284] [2025-02-06 02:47:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403944284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:47:14,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:47:14,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:47:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749254031] [2025-02-06 02:47:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:47:14,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:47:14,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:47:14,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:47:14,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:47:14,100 INFO L87 Difference]: Start difference. First operand 43640 states and 67807 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:47:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:47:16,946 INFO L93 Difference]: Finished difference Result 161577 states and 251200 transitions. [2025-02-06 02:47:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:47:16,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 507 [2025-02-06 02:47:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:47:17,126 INFO L225 Difference]: With dead ends: 161577 [2025-02-06 02:47:17,126 INFO L226 Difference]: Without dead ends: 118865 [2025-02-06 02:47:17,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:47:17,192 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1186 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:47:17,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1420 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:47:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118865 states. [2025-02-06 02:47:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118865 to 47737. [2025-02-06 02:47:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47737 states, 45715 states have (on average 1.5561194356338182) internal successors, (71138), 45763 states have internal predecessors, (71138), 1760 states have call successors, (1760), 261 states have call predecessors, (1760), 261 states have return successors, (1760), 1712 states have call predecessors, (1760), 1760 states have call successors, (1760) [2025-02-06 02:47:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47737 states to 47737 states and 74658 transitions. [2025-02-06 02:47:19,115 INFO L78 Accepts]: Start accepts. Automaton has 47737 states and 74658 transitions. Word has length 507 [2025-02-06 02:47:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:19,116 INFO L471 AbstractCegarLoop]: Abstraction has 47737 states and 74658 transitions. [2025-02-06 02:47:19,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:47:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 47737 states and 74658 transitions. [2025-02-06 02:47:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-02-06 02:47:19,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:19,125 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:19,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:47:19,126 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:19,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:19,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1975515840, now seen corresponding path program 1 times [2025-02-06 02:47:19,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:19,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326196976] [2025-02-06 02:47:19,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:19,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:19,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-06 02:47:19,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-06 02:47:19,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:19,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:47:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-02-06 02:47:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:47:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326196976] [2025-02-06 02:47:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326196976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:47:19,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:47:19,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:47:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041842931] [2025-02-06 02:47:19,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:47:19,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:47:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:47:19,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:47:19,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:47:19,435 INFO L87 Difference]: Start difference. First operand 47737 states and 74658 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:47:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:47:21,032 INFO L93 Difference]: Finished difference Result 125922 states and 196640 transitions. [2025-02-06 02:47:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:47:21,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 507 [2025-02-06 02:47:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:47:21,176 INFO L225 Difference]: With dead ends: 125922 [2025-02-06 02:47:21,177 INFO L226 Difference]: Without dead ends: 79382 [2025-02-06 02:47:21,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:47:21,241 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 362 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:47:21,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 976 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:47:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79382 states. [2025-02-06 02:47:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79382 to 78032. [2025-02-06 02:47:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78032 states, 74274 states have (on average 1.5462207501952232) internal successors, (114844), 74358 states have internal predecessors, (114844), 3280 states have call successors, (3280), 477 states have call predecessors, (3280), 477 states have return successors, (3280), 3196 states have call predecessors, (3280), 3280 states have call successors, (3280) [2025-02-06 02:47:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78032 states to 78032 states and 121404 transitions. [2025-02-06 02:47:24,591 INFO L78 Accepts]: Start accepts. Automaton has 78032 states and 121404 transitions. Word has length 507 [2025-02-06 02:47:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:47:24,592 INFO L471 AbstractCegarLoop]: Abstraction has 78032 states and 121404 transitions. [2025-02-06 02:47:24,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-02-06 02:47:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 78032 states and 121404 transitions. [2025-02-06 02:47:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-02-06 02:47:24,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:47:24,607 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:47:24,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:47:24,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:47:24,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:47:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2069934054, now seen corresponding path program 1 times [2025-02-06 02:47:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:47:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459840049] [2025-02-06 02:47:24,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:47:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:47:24,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-06 02:47:24,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-06 02:47:24,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:47:24,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat