./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-46.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-46.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 df69ef27b04a763c9eae25d4c49e492a4abf0cf87271d0ce91cfba82e7749765 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:40:55,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:40:56,048 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:40:56,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:40:56,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:40:56,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:40:56,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:40:56,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:40:56,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:40:56,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:40:56,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:40:56,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:40:56,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:40:56,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:40:56,089 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:40:56,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:40:56,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:40:56,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:40:56,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:40:56,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:40:56,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:40:56,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:40:56,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:40:56,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:40:56,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:40:56,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:40:56,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:40:56,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:40:56,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:40:56,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:40:56,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:40:56,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:40:56,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:40:56,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:40:56,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:40:56,093 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:40:56,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:40:56,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:40:56,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:40:56,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:40:56,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:40:56,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:40:56,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:40:56,093 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 -> df69ef27b04a763c9eae25d4c49e492a4abf0cf87271d0ce91cfba82e7749765 [2025-02-06 02:40:56,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:40:56,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:40:56,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:40:56,412 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:40:56,412 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:40:56,414 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-46.i [2025-02-06 02:40:57,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56dd2f998/5e2c93865d114039a414dcd52c1313a7/FLAGdb6f55b4e [2025-02-06 02:40:58,171 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:40:58,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-46.i [2025-02-06 02:40:58,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56dd2f998/5e2c93865d114039a414dcd52c1313a7/FLAGdb6f55b4e [2025-02-06 02:40:58,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56dd2f998/5e2c93865d114039a414dcd52c1313a7 [2025-02-06 02:40:58,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:40:58,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:40:58,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:40:58,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:40:58,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:40:58,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:58,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58, skipping insertion in model container [2025-02-06 02:40:58,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:58,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:40:58,367 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-46.i[916,929] [2025-02-06 02:40:58,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:40:58,583 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:40:58,593 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-46.i[916,929] [2025-02-06 02:40:58,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:40:58,735 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:40:58,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58 WrapperNode [2025-02-06 02:40:58,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:40:58,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:40:58,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:40:58,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:40:58,746 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:40:58" (1/1) ... [2025-02-06 02:40:58,771 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:40:58" (1/1) ... [2025-02-06 02:40:58,900 INFO L138 Inliner]: procedures = 26, calls = 88, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 740 [2025-02-06 02:40:58,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:40:58,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:40:58,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:40:58,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:40:58,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:58,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:59,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:59,094 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:40:59,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:59,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:59,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:59,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:59,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:59,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:59,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:40:59,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:40:59,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:40:59,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:40:59,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (1/1) ... [2025-02-06 02:40:59,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:40:59,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:59,231 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:40:59,234 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:40:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:40:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:40:59,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:40:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:40:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:40:59,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:40:59,421 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:40:59,422 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:41:00,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L648: havoc property_#t~bitwise50#1;havoc property_#t~short51#1;havoc property_#t~short52#1;havoc property_#t~ite55#1;havoc property_#t~ite54#1;havoc property_#t~bitwise53#1;havoc property_#t~short56#1;havoc property_#t~ite58#1;havoc property_#t~bitwise57#1;havoc property_#t~short59#1;havoc property_#t~ite61#1;havoc property_#t~bitwise60#1;havoc property_#t~short62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1; [2025-02-06 02:41:00,933 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-02-06 02:41:00,933 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:41:00,977 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:41:00,977 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:41:00,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:00 BoogieIcfgContainer [2025-02-06 02:41:00,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:41:00,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:41:00,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:41:00,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:41:00,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:40:58" (1/3) ... [2025-02-06 02:41:00,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcdd4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:00, skipping insertion in model container [2025-02-06 02:41:00,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:40:58" (2/3) ... [2025-02-06 02:41:00,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcdd4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:41:00, skipping insertion in model container [2025-02-06 02:41:00,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:41:00" (3/3) ... [2025-02-06 02:41:00,989 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-46.i [2025-02-06 02:41:01,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:41:01,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-46.i that has 2 procedures, 298 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:41:01,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:41:01,091 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;@6c2657f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:41:01,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:41:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 220 states have (on average 1.5272727272727273) internal successors, (336), 221 states have internal predecessors, (336), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-06 02:41:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-06 02:41:01,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:01,137 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:01,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:01,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1569789373, now seen corresponding path program 1 times [2025-02-06 02:41:01,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:01,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498121058] [2025-02-06 02:41:01,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:01,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-06 02:41:01,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-06 02:41:01,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:01,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-02-06 02:41:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498121058] [2025-02-06 02:41:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498121058] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637492754] [2025-02-06 02:41:01,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:01,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:01,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:01,968 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:41:01,970 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:41:02,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-06 02:41:02,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-06 02:41:02,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:02,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:02,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:41:02,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-02-06 02:41:02,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:41:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637492754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:02,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:41:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:41:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936024317] [2025-02-06 02:41:02,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:02,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:41:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:02,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:41:02,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:41:02,561 INFO L87 Difference]: Start difference. First operand has 298 states, 220 states have (on average 1.5272727272727273) internal successors, (336), 221 states have internal predecessors, (336), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-06 02:41:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:02,656 INFO L93 Difference]: Finished difference Result 590 states and 1042 transitions. [2025-02-06 02:41:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:41:02,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) Word has length 520 [2025-02-06 02:41:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:02,668 INFO L225 Difference]: With dead ends: 590 [2025-02-06 02:41:02,669 INFO L226 Difference]: Without dead ends: 295 [2025-02-06 02:41:02,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 521 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:41:02,678 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:02,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:41:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-06 02:41:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-02-06 02:41:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 218 states have (on average 1.518348623853211) internal successors, (331), 218 states have internal predecessors, (331), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-06 02:41:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 481 transitions. [2025-02-06 02:41:02,782 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 481 transitions. Word has length 520 [2025-02-06 02:41:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:02,784 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 481 transitions. [2025-02-06 02:41:02,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-02-06 02:41:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 481 transitions. [2025-02-06 02:41:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-06 02:41:02,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:02,796 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:02,807 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:41:03,000 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:41:03,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:03,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:03,002 INFO L85 PathProgramCache]: Analyzing trace with hash 933153576, now seen corresponding path program 1 times [2025-02-06 02:41:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:03,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463801233] [2025-02-06 02:41:03,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:03,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-06 02:41:03,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-06 02:41:03,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:03,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:03,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:03,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463801233] [2025-02-06 02:41:03,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463801233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:03,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:03,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:03,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978601578] [2025-02-06 02:41:03,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:03,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:03,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:03,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:03,610 INFO L87 Difference]: Start difference. First operand 295 states and 481 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, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:03,737 INFO L93 Difference]: Finished difference Result 879 states and 1437 transitions. [2025-02-06 02:41:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:03,739 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, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 520 [2025-02-06 02:41:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:03,745 INFO L225 Difference]: With dead ends: 879 [2025-02-06 02:41:03,746 INFO L226 Difference]: Without dead ends: 587 [2025-02-06 02:41:03,747 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:41:03,748 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 475 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:03,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 922 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-06 02:41:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2025-02-06 02:41:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 432 states have (on average 1.5185185185185186) internal successors, (656), 432 states have internal predecessors, (656), 150 states have call successors, (150), 2 states have call predecessors, (150), 2 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-02-06 02:41:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 956 transitions. [2025-02-06 02:41:03,867 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 956 transitions. Word has length 520 [2025-02-06 02:41:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:03,870 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 956 transitions. [2025-02-06 02:41:03,871 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, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 956 transitions. [2025-02-06 02:41:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-02-06 02:41:03,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:03,881 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:03,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:41:03,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:03,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash -921191961, now seen corresponding path program 1 times [2025-02-06 02:41:03,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:03,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566346024] [2025-02-06 02:41:03,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:03,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-02-06 02:41:04,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-02-06 02:41:04,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:04,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:05,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:05,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566346024] [2025-02-06 02:41:05,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566346024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:05,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:05,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:05,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976824448] [2025-02-06 02:41:05,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:05,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:05,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:05,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:05,261 INFO L87 Difference]: Start difference. First operand 585 states and 956 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:05,745 INFO L93 Difference]: Finished difference Result 1754 states and 2871 transitions. [2025-02-06 02:41:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:05,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 520 [2025-02-06 02:41:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:05,754 INFO L225 Difference]: With dead ends: 1754 [2025-02-06 02:41:05,755 INFO L226 Difference]: Without dead ends: 1172 [2025-02-06 02:41:05,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:05,757 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 609 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:05,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1617 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:05,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-02-06 02:41:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 875. [2025-02-06 02:41:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 646 states have (on average 1.5170278637770898) internal successors, (980), 646 states have internal predecessors, (980), 225 states have call successors, (225), 3 states have call predecessors, (225), 3 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2025-02-06 02:41:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1430 transitions. [2025-02-06 02:41:05,885 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1430 transitions. Word has length 520 [2025-02-06 02:41:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:05,889 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1430 transitions. [2025-02-06 02:41:05,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1430 transitions. [2025-02-06 02:41:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-02-06 02:41:05,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:05,901 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:41:05,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:05,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:05,903 INFO L85 PathProgramCache]: Analyzing trace with hash 524761697, now seen corresponding path program 1 times [2025-02-06 02:41:05,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:05,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290350436] [2025-02-06 02:41:05,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:05,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:05,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-02-06 02:41:06,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-02-06 02:41:06,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:06,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:07,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:07,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290350436] [2025-02-06 02:41:07,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290350436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:07,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:07,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:07,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48259118] [2025-02-06 02:41:07,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:07,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:07,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:07,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:07,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:07,105 INFO L87 Difference]: Start difference. First operand 875 states and 1430 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:07,618 INFO L93 Difference]: Finished difference Result 2900 states and 4744 transitions. [2025-02-06 02:41:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:07,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-02-06 02:41:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:07,633 INFO L225 Difference]: With dead ends: 2900 [2025-02-06 02:41:07,634 INFO L226 Difference]: Without dead ends: 2028 [2025-02-06 02:41:07,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:07,638 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 592 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:07,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1518 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2025-02-06 02:41:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1742. [2025-02-06 02:41:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1285 states have (on average 1.5058365758754864) internal successors, (1935), 1285 states have internal predecessors, (1935), 450 states have call successors, (450), 6 states have call predecessors, (450), 6 states have return successors, (450), 450 states have call predecessors, (450), 450 states have call successors, (450) [2025-02-06 02:41:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2835 transitions. [2025-02-06 02:41:07,869 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2835 transitions. Word has length 521 [2025-02-06 02:41:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:07,871 INFO L471 AbstractCegarLoop]: Abstraction has 1742 states and 2835 transitions. [2025-02-06 02:41:07,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2835 transitions. [2025-02-06 02:41:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-02-06 02:41:07,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:07,881 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:07,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:41:07,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:07,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1692957952, now seen corresponding path program 1 times [2025-02-06 02:41:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:07,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984226185] [2025-02-06 02:41:07,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:07,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-02-06 02:41:08,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-02-06 02:41:08,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:08,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:09,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984226185] [2025-02-06 02:41:09,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984226185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:09,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:09,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240595105] [2025-02-06 02:41:09,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:09,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:09,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:09,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:09,914 INFO L87 Difference]: Start difference. First operand 1742 states and 2835 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:10,673 INFO L93 Difference]: Finished difference Result 4145 states and 6726 transitions. [2025-02-06 02:41:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:10,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-02-06 02:41:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:10,695 INFO L225 Difference]: With dead ends: 4145 [2025-02-06 02:41:10,696 INFO L226 Difference]: Without dead ends: 2985 [2025-02-06 02:41:10,701 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:41:10,702 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 909 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:10,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1236 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:41:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2025-02-06 02:41:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2656. [2025-02-06 02:41:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2043 states have (on average 1.5198237885462555) internal successors, (3105), 2047 states have internal predecessors, (3105), 602 states have call successors, (602), 10 states have call predecessors, (602), 10 states have return successors, (602), 598 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-06 02:41:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 4309 transitions. [2025-02-06 02:41:10,995 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 4309 transitions. Word has length 521 [2025-02-06 02:41:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:10,998 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 4309 transitions. [2025-02-06 02:41:10,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 4309 transitions. [2025-02-06 02:41:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-02-06 02:41:11,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:11,009 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:11,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:41:11,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:11,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:11,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1028929695, now seen corresponding path program 1 times [2025-02-06 02:41:11,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:11,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869831771] [2025-02-06 02:41:11,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:11,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:11,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-02-06 02:41:11,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-02-06 02:41:11,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:11,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869831771] [2025-02-06 02:41:11,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869831771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:11,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970264013] [2025-02-06 02:41:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:11,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:11,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:11,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:11,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:11,289 INFO L87 Difference]: Start difference. First operand 2656 states and 4309 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, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:11,549 INFO L93 Difference]: Finished difference Result 4734 states and 7679 transitions. [2025-02-06 02:41:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:11,550 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, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-02-06 02:41:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:11,570 INFO L225 Difference]: With dead ends: 4734 [2025-02-06 02:41:11,571 INFO L226 Difference]: Without dead ends: 2660 [2025-02-06 02:41:11,577 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:41:11,579 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 454 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:11,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1171 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-02-06 02:41:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2658. [2025-02-06 02:41:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2045 states have (on average 1.5144254278728606) internal successors, (3097), 2049 states have internal predecessors, (3097), 602 states have call successors, (602), 10 states have call predecessors, (602), 10 states have return successors, (602), 598 states have call predecessors, (602), 602 states have call successors, (602) [2025-02-06 02:41:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4301 transitions. [2025-02-06 02:41:11,767 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4301 transitions. Word has length 521 [2025-02-06 02:41:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:11,769 INFO L471 AbstractCegarLoop]: Abstraction has 2658 states and 4301 transitions. [2025-02-06 02:41:11,769 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, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4301 transitions. [2025-02-06 02:41:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-02-06 02:41:11,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:11,775 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:11,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:41:11,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:11,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash 656159905, now seen corresponding path program 1 times [2025-02-06 02:41:11,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:11,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415675474] [2025-02-06 02:41:11,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:11,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-02-06 02:41:12,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-02-06 02:41:12,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:12,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415675474] [2025-02-06 02:41:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415675474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:13,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838668490] [2025-02-06 02:41:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:13,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:13,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:13,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:13,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:13,156 INFO L87 Difference]: Start difference. First operand 2658 states and 4301 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:13,920 INFO L93 Difference]: Finished difference Result 6639 states and 10731 transitions. [2025-02-06 02:41:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:13,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-02-06 02:41:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:13,951 INFO L225 Difference]: With dead ends: 6639 [2025-02-06 02:41:13,951 INFO L226 Difference]: Without dead ends: 3984 [2025-02-06 02:41:13,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:13,962 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 295 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:13,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1175 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:41:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3984 states. [2025-02-06 02:41:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3976. [2025-02-06 02:41:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3976 states, 3057 states have (on average 1.5060516846581615) internal successors, (4604), 3063 states have internal predecessors, (4604), 903 states have call successors, (903), 15 states have call predecessors, (903), 15 states have return successors, (903), 897 states have call predecessors, (903), 903 states have call successors, (903) [2025-02-06 02:41:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 6410 transitions. [2025-02-06 02:41:14,344 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 6410 transitions. Word has length 521 [2025-02-06 02:41:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:14,345 INFO L471 AbstractCegarLoop]: Abstraction has 3976 states and 6410 transitions. [2025-02-06 02:41:14,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 6410 transitions. [2025-02-06 02:41:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-02-06 02:41:14,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:14,356 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:14,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:41:14,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:14,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2119792127, now seen corresponding path program 1 times [2025-02-06 02:41:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:14,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808516996] [2025-02-06 02:41:14,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:14,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:14,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-02-06 02:41:15,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-02-06 02:41:15,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:15,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:15,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:15,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808516996] [2025-02-06 02:41:15,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808516996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:15,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:15,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:15,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367903723] [2025-02-06 02:41:15,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:15,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:15,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:15,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:15,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:15,930 INFO L87 Difference]: Start difference. First operand 3976 states and 6410 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:16,872 INFO L93 Difference]: Finished difference Result 15480 states and 24869 transitions. [2025-02-06 02:41:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:41:16,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-02-06 02:41:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:16,953 INFO L225 Difference]: With dead ends: 15480 [2025-02-06 02:41:16,953 INFO L226 Difference]: Without dead ends: 11507 [2025-02-06 02:41:16,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:16,972 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 1201 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:16,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 2323 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:41:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11507 states. [2025-02-06 02:41:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11507 to 5950. [2025-02-06 02:41:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5950 states, 4914 states have (on average 1.5417175417175417) internal successors, (7576), 4923 states have internal predecessors, (7576), 1017 states have call successors, (1017), 18 states have call predecessors, (1017), 18 states have return successors, (1017), 1008 states have call predecessors, (1017), 1017 states have call successors, (1017) [2025-02-06 02:41:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5950 states to 5950 states and 9610 transitions. [2025-02-06 02:41:17,555 INFO L78 Accepts]: Start accepts. Automaton has 5950 states and 9610 transitions. Word has length 521 [2025-02-06 02:41:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:17,558 INFO L471 AbstractCegarLoop]: Abstraction has 5950 states and 9610 transitions. [2025-02-06 02:41:17,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5950 states and 9610 transitions. [2025-02-06 02:41:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-02-06 02:41:17,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:17,570 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:17,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:41:17,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:17,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1308122944, now seen corresponding path program 1 times [2025-02-06 02:41:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:17,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931869300] [2025-02-06 02:41:17,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:17,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:17,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-02-06 02:41:18,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-02-06 02:41:18,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:18,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:19,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931869300] [2025-02-06 02:41:19,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931869300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:19,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:19,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548602824] [2025-02-06 02:41:19,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:19,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:19,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:19,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:19,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:19,004 INFO L87 Difference]: Start difference. First operand 5950 states and 9610 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:20,143 INFO L93 Difference]: Finished difference Result 21214 states and 34239 transitions. [2025-02-06 02:41:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:20,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-02-06 02:41:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:20,207 INFO L225 Difference]: With dead ends: 21214 [2025-02-06 02:41:20,207 INFO L226 Difference]: Without dead ends: 15267 [2025-02-06 02:41:20,227 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:41:20,229 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 756 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:20,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1215 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:41:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15267 states. [2025-02-06 02:41:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15267 to 12131. [2025-02-06 02:41:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12131 states, 10429 states have (on average 1.538114871991562) internal successors, (16041), 10456 states have internal predecessors, (16041), 1665 states have call successors, (1665), 36 states have call predecessors, (1665), 36 states have return successors, (1665), 1638 states have call predecessors, (1665), 1665 states have call successors, (1665) [2025-02-06 02:41:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12131 states to 12131 states and 19371 transitions. [2025-02-06 02:41:20,914 INFO L78 Accepts]: Start accepts. Automaton has 12131 states and 19371 transitions. Word has length 521 [2025-02-06 02:41:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:20,915 INFO L471 AbstractCegarLoop]: Abstraction has 12131 states and 19371 transitions. [2025-02-06 02:41:20,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 12131 states and 19371 transitions. [2025-02-06 02:41:20,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-02-06 02:41:20,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:20,934 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:20,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:41:20,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:20,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:20,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2064160769, now seen corresponding path program 1 times [2025-02-06 02:41:20,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:20,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508796352] [2025-02-06 02:41:20,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:20,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:20,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-02-06 02:41:21,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-02-06 02:41:21,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:21,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:22,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508796352] [2025-02-06 02:41:22,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508796352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:22,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:22,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:41:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864235305] [2025-02-06 02:41:22,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:22,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:41:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:22,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:41:22,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:41:22,336 INFO L87 Difference]: Start difference. First operand 12131 states and 19371 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:23,660 INFO L93 Difference]: Finished difference Result 29984 states and 47897 transitions. [2025-02-06 02:41:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:41:23,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 521 [2025-02-06 02:41:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:23,777 INFO L225 Difference]: With dead ends: 29984 [2025-02-06 02:41:23,777 INFO L226 Difference]: Without dead ends: 17856 [2025-02-06 02:41:23,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:41:23,809 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 601 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:23,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1615 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:41:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17856 states. [2025-02-06 02:41:24,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17856 to 13193. [2025-02-06 02:41:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13193 states, 11491 states have (on average 1.5418153337394482) internal successors, (17717), 11518 states have internal predecessors, (17717), 1665 states have call successors, (1665), 36 states have call predecessors, (1665), 36 states have return successors, (1665), 1638 states have call predecessors, (1665), 1665 states have call successors, (1665) [2025-02-06 02:41:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13193 states to 13193 states and 21047 transitions. [2025-02-06 02:41:24,876 INFO L78 Accepts]: Start accepts. Automaton has 13193 states and 21047 transitions. Word has length 521 [2025-02-06 02:41:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:24,878 INFO L471 AbstractCegarLoop]: Abstraction has 13193 states and 21047 transitions. [2025-02-06 02:41:24,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 13193 states and 21047 transitions. [2025-02-06 02:41:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-02-06 02:41:24,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:24,898 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:24,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:41:24,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:24,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash -119516158, now seen corresponding path program 1 times [2025-02-06 02:41:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:24,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012242336] [2025-02-06 02:41:24,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:24,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-02-06 02:41:27,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-02-06 02:41:27,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:27,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-02-06 02:41:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012242336] [2025-02-06 02:41:27,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012242336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:41:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467084988] [2025-02-06 02:41:27,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:27,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:27,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:41:27,748 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:41:27,751 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:41:27,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-02-06 02:41:28,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-02-06 02:41:28,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:28,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:28,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:41:28,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:41:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 3984 proven. 171 refuted. 0 times theorem prover too weak. 6945 trivial. 0 not checked. [2025-02-06 02:41:28,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:41:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 51 proven. 171 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-02-06 02:41:29,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467084988] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:41:29,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:41:29,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 02:41:29,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924148515] [2025-02-06 02:41:29,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:41:29,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:41:29,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:29,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:41:29,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:41:29,373 INFO L87 Difference]: Start difference. First operand 13193 states and 21047 transitions. Second operand has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (198), 2 states have call predecessors, (198), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) [2025-02-06 02:41:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:30,606 INFO L93 Difference]: Finished difference Result 26743 states and 42379 transitions. [2025-02-06 02:41:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:41:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (198), 2 states have call predecessors, (198), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) Word has length 521 [2025-02-06 02:41:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:30,665 INFO L225 Difference]: With dead ends: 26743 [2025-02-06 02:41:30,666 INFO L226 Difference]: Without dead ends: 13553 [2025-02-06 02:41:30,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 1039 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:41:30,728 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 827 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:30,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 938 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:41:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13553 states. [2025-02-06 02:41:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13553 to 13481. [2025-02-06 02:41:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13481 states, 11707 states have (on average 1.5149056120269924) internal successors, (17735), 11734 states have internal predecessors, (17735), 1665 states have call successors, (1665), 108 states have call predecessors, (1665), 108 states have return successors, (1665), 1638 states have call predecessors, (1665), 1665 states have call successors, (1665) [2025-02-06 02:41:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13481 states to 13481 states and 21065 transitions. [2025-02-06 02:41:31,521 INFO L78 Accepts]: Start accepts. Automaton has 13481 states and 21065 transitions. Word has length 521 [2025-02-06 02:41:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:31,522 INFO L471 AbstractCegarLoop]: Abstraction has 13481 states and 21065 transitions. [2025-02-06 02:41:31,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.333333333333332) internal successors, (273), 9 states have internal predecessors, (273), 4 states have call successors, (198), 2 states have call predecessors, (198), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) [2025-02-06 02:41:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13481 states and 21065 transitions. [2025-02-06 02:41:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-02-06 02:41:31,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:31,542 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:41:31,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:41:31,747 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:31,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash 807092037, now seen corresponding path program 1 times [2025-02-06 02:41:31,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:31,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094081230] [2025-02-06 02:41:31,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:31,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:31,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-02-06 02:41:33,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-02-06 02:41:33,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:33,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:43,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:43,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094081230] [2025-02-06 02:41:43,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094081230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:43,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:43,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:41:43,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187941754] [2025-02-06 02:41:43,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:43,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:41:43,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:43,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:41:43,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:41:43,888 INFO L87 Difference]: Start difference. First operand 13481 states and 21065 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 4 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 4 states have call predecessors, (75), 4 states have call successors, (75) [2025-02-06 02:41:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:47,725 INFO L93 Difference]: Finished difference Result 58086 states and 90520 transitions. [2025-02-06 02:41:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:41:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 4 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 4 states have call predecessors, (75), 4 states have call successors, (75) Word has length 523 [2025-02-06 02:41:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:47,872 INFO L225 Difference]: With dead ends: 58086 [2025-02-06 02:41:47,872 INFO L226 Difference]: Without dead ends: 44608 [2025-02-06 02:41:47,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:41:47,906 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 1590 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 3871 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:47,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 3871 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 02:41:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44608 states. [2025-02-06 02:41:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44608 to 43160. [2025-02-06 02:41:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43160 states, 38281 states have (on average 1.515973981870902) internal successors, (58033), 38371 states have internal predecessors, (58033), 4554 states have call successors, (4554), 324 states have call predecessors, (4554), 324 states have return successors, (4554), 4464 states have call predecessors, (4554), 4554 states have call successors, (4554) [2025-02-06 02:41:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43160 states to 43160 states and 67141 transitions. [2025-02-06 02:41:50,591 INFO L78 Accepts]: Start accepts. Automaton has 43160 states and 67141 transitions. Word has length 523 [2025-02-06 02:41:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:50,593 INFO L471 AbstractCegarLoop]: Abstraction has 43160 states and 67141 transitions. [2025-02-06 02:41:50,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 4 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 4 states have call predecessors, (75), 4 states have call successors, (75) [2025-02-06 02:41:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 43160 states and 67141 transitions. [2025-02-06 02:41:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-02-06 02:41:50,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:50,639 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:50,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:41:50,640 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1993962810, now seen corresponding path program 1 times [2025-02-06 02:41:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809944355] [2025-02-06 02:41:50,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:50,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-02-06 02:41:50,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-02-06 02:41:50,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:41:50,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:41:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-02-06 02:41:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:41:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809944355] [2025-02-06 02:41:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809944355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:41:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:41:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:41:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053716506] [2025-02-06 02:41:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:41:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:41:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:41:51,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:41:51,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:41:51,332 INFO L87 Difference]: Start difference. First operand 43160 states and 67141 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:41:53,716 INFO L93 Difference]: Finished difference Result 114598 states and 178462 transitions. [2025-02-06 02:41:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:41:53,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 523 [2025-02-06 02:41:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:41:53,931 INFO L225 Difference]: With dead ends: 114598 [2025-02-06 02:41:53,932 INFO L226 Difference]: Without dead ends: 71441 [2025-02-06 02:41:53,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:41:53,995 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 323 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:41:53,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1121 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:41:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71441 states. [2025-02-06 02:41:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71441 to 71439. [2025-02-06 02:41:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71439 states, 62977 states have (on average 1.5120282007717103) internal successors, (95223), 63122 states have internal predecessors, (95223), 7918 states have call successors, (7918), 543 states have call predecessors, (7918), 543 states have return successors, (7918), 7773 states have call predecessors, (7918), 7918 states have call successors, (7918) [2025-02-06 02:41:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71439 states to 71439 states and 111059 transitions. [2025-02-06 02:41:58,583 INFO L78 Accepts]: Start accepts. Automaton has 71439 states and 111059 transitions. Word has length 523 [2025-02-06 02:41:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:41:58,584 INFO L471 AbstractCegarLoop]: Abstraction has 71439 states and 111059 transitions. [2025-02-06 02:41:58,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-02-06 02:41:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 71439 states and 111059 transitions. [2025-02-06 02:41:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-02-06 02:41:58,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:41:58,618 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:58,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:41:58,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:41:58,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:41:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1605565154, now seen corresponding path program 1 times [2025-02-06 02:41:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:41:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437248525] [2025-02-06 02:41:58,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:41:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:41:58,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes.