./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-4.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 86050a320677a833f953e3d24f630a372e53eb7ac1e89a394e20853921226e93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:46:28,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:46:28,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:46:28,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:46:28,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:46:28,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:46:28,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:46:28,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:46:28,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:46:28,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:46:28,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:46:28,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:46:28,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:46:28,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:46:28,703 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:46:28,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:46:28,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:46:28,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:46:28,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:46:28,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:46:28,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:28,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:28,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:28,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:28,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:46:28,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:28,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:46:28,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:46:28,707 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 -> 86050a320677a833f953e3d24f630a372e53eb7ac1e89a394e20853921226e93 [2025-01-09 14:46:28,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:46:28,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:46:28,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:46:28,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:46:28,949 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:46:28,950 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-4.i [2025-01-09 14:46:30,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9053c43d3/a7b4311cc24243a2a97a0821ed4faecd/FLAGc7015f041 [2025-01-09 14:46:30,545 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:46:30,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-4.i [2025-01-09 14:46:30,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9053c43d3/a7b4311cc24243a2a97a0821ed4faecd/FLAGc7015f041 [2025-01-09 14:46:30,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9053c43d3/a7b4311cc24243a2a97a0821ed4faecd [2025-01-09 14:46:30,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:46:30,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:46:30,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:30,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:46:30,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:46:30,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:30" (1/1) ... [2025-01-09 14:46:30,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb33bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:30, skipping insertion in model container [2025-01-09 14:46:30,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:30" (1/1) ... [2025-01-09 14:46:30,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:46:30,927 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-4.i[915,928] [2025-01-09 14:46:31,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:31,113 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:46:31,123 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-4.i[915,928] [2025-01-09 14:46:31,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:31,259 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:46:31,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31 WrapperNode [2025-01-09 14:46:31,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:31,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:31,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:46:31,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:46:31,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,377 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 621 [2025-01-09 14:46:31,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:31,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:46:31,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:46:31,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:46:31,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,499 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-01-09 14:46:31,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,536 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:46:31,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:46:31,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:46:31,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:46:31,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (1/1) ... [2025-01-09 14:46:31,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:31,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:31,612 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-01-09 14:46:31,617 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-01-09 14:46:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:46:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:46:31,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:46:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:46:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:46:31,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:46:31,763 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:46:31,764 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:46:32,710 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-01-09 14:46:32,711 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:46:32,720 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:46:32,720 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:46:32,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:32 BoogieIcfgContainer [2025-01-09 14:46:32,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:46:32,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:46:32,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:46:32,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:46:32,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:46:30" (1/3) ... [2025-01-09 14:46:32,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ef9778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:32, skipping insertion in model container [2025-01-09 14:46:32,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:31" (2/3) ... [2025-01-09 14:46:32,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ef9778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:32, skipping insertion in model container [2025-01-09 14:46:32,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:32" (3/3) ... [2025-01-09 14:46:32,728 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-4.i [2025-01-09 14:46:32,738 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:46:32,741 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-4.i that has 2 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:46:32,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:46:32,792 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;@7356fd68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:46:32,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:46:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 177 states have (on average 1.5423728813559323) internal successors, (273), 178 states have internal predecessors, (273), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:46:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 14:46:32,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:32,810 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:32,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:32,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:32,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1464138692, now seen corresponding path program 1 times [2025-01-09 14:46:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:32,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964871369] [2025-01-09 14:46:32,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:32,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 14:46:32,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 14:46:32,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:32,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-01-09 14:46:33,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:33,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964871369] [2025-01-09 14:46:33,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964871369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580724330] [2025-01-09 14:46:33,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:33,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:33,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:33,342 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-01-09 14:46:33,343 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-01-09 14:46:33,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 14:46:33,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 14:46:33,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:33,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:33,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:46:33,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-01-09 14:46:33,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:46:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580724330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:46:33,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:46:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991828041] [2025-01-09 14:46:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:46:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:33,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:46:33,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:46:33,715 INFO L87 Difference]: Start difference. First operand has 241 states, 177 states have (on average 1.5423728813559323) internal successors, (273), 178 states have internal predecessors, (273), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:46:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:33,749 INFO L93 Difference]: Finished difference Result 474 states and 842 transitions. [2025-01-09 14:46:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:46:33,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 428 [2025-01-09 14:46:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:33,759 INFO L225 Difference]: With dead ends: 474 [2025-01-09 14:46:33,759 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 14:46:33,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 429 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-01-09 14:46:33,765 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:33,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 14:46:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-01-09 14:46:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 173 states have (on average 1.5202312138728324) internal successors, (263), 173 states have internal predecessors, (263), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:46:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 385 transitions. [2025-01-09 14:46:33,809 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 385 transitions. Word has length 428 [2025-01-09 14:46:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:33,809 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 385 transitions. [2025-01-09 14:46:33,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:46:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 385 transitions. [2025-01-09 14:46:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 14:46:33,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:33,819 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:33,828 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-01-09 14:46:34,020 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-01-09 14:46:34,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:34,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1483877554, now seen corresponding path program 1 times [2025-01-09 14:46:34,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:34,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612454757] [2025-01-09 14:46:34,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:34,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:34,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 14:46:34,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 14:46:34,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:34,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:34,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:34,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612454757] [2025-01-09 14:46:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612454757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:34,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:34,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451143865] [2025-01-09 14:46:34,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:34,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:34,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:34,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:34,577 INFO L87 Difference]: Start difference. First operand 236 states and 385 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:34,652 INFO L93 Difference]: Finished difference Result 469 states and 767 transitions. [2025-01-09 14:46:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:34,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 428 [2025-01-09 14:46:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:34,656 INFO L225 Difference]: With dead ends: 469 [2025-01-09 14:46:34,656 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 14:46:34,662 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-01-09 14:46:34,662 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:34,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 759 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:34,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 14:46:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-01-09 14:46:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 173 states have (on average 1.5144508670520231) internal successors, (262), 173 states have internal predecessors, (262), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:46:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 384 transitions. [2025-01-09 14:46:34,689 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 384 transitions. Word has length 428 [2025-01-09 14:46:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:34,690 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 384 transitions. [2025-01-09 14:46:34,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 384 transitions. [2025-01-09 14:46:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 14:46:34,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:34,703 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:34,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:46:34,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:34,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1244331792, now seen corresponding path program 1 times [2025-01-09 14:46:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:34,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882765324] [2025-01-09 14:46:34,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:34,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:34,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 14:46:34,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 14:46:34,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:34,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:35,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:35,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882765324] [2025-01-09 14:46:35,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882765324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:35,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:35,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485226111] [2025-01-09 14:46:35,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:35,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:35,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:35,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:35,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:35,212 INFO L87 Difference]: Start difference. First operand 236 states and 384 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:35,299 INFO L93 Difference]: Finished difference Result 699 states and 1141 transitions. [2025-01-09 14:46:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:35,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 428 [2025-01-09 14:46:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:35,307 INFO L225 Difference]: With dead ends: 699 [2025-01-09 14:46:35,307 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 14:46:35,308 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-01-09 14:46:35,309 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 373 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:35,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 751 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 14:46:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 240. [2025-01-09 14:46:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 177 states have (on average 1.5141242937853108) internal successors, (268), 177 states have internal predecessors, (268), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 14:46:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 390 transitions. [2025-01-09 14:46:35,344 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 390 transitions. Word has length 428 [2025-01-09 14:46:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:35,344 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 390 transitions. [2025-01-09 14:46:35,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 390 transitions. [2025-01-09 14:46:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 14:46:35,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:35,350 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:35,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:46:35,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:35,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash 368312786, now seen corresponding path program 1 times [2025-01-09 14:46:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665856708] [2025-01-09 14:46:35,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:35,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 14:46:35,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 14:46:35,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:35,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:35,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665856708] [2025-01-09 14:46:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665856708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:35,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:35,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:35,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271741151] [2025-01-09 14:46:35,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:35,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:35,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:35,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:35,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:35,680 INFO L87 Difference]: Start difference. First operand 240 states and 390 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:35,824 INFO L93 Difference]: Finished difference Result 612 states and 997 transitions. [2025-01-09 14:46:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:35,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 428 [2025-01-09 14:46:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:35,829 INFO L225 Difference]: With dead ends: 612 [2025-01-09 14:46:35,832 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 14:46:35,833 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-01-09 14:46:35,833 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 167 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:35,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 821 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 14:46:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2025-01-09 14:46:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 304 states have (on average 1.549342105263158) internal successors, (471), 305 states have internal predecessors, (471), 65 states have call successors, (65), 2 states have call predecessors, (65), 2 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:46:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 601 transitions. [2025-01-09 14:46:35,856 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 601 transitions. Word has length 428 [2025-01-09 14:46:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:35,857 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 601 transitions. [2025-01-09 14:46:35,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 601 transitions. [2025-01-09 14:46:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 14:46:35,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:35,861 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:35,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:46:35,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:35,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -294289646, now seen corresponding path program 1 times [2025-01-09 14:46:35,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:35,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534694995] [2025-01-09 14:46:35,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:35,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:35,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 14:46:36,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 14:46:36,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:36,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:39,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:39,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534694995] [2025-01-09 14:46:39,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534694995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:39,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:39,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:46:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674554506] [2025-01-09 14:46:39,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:39,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:46:39,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:39,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:46:39,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:46:39,232 INFO L87 Difference]: Start difference. First operand 372 states and 601 transitions. Second operand has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:46:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:41,962 INFO L93 Difference]: Finished difference Result 2257 states and 3676 transitions. [2025-01-09 14:46:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:46:41,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 428 [2025-01-09 14:46:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:41,977 INFO L225 Difference]: With dead ends: 2257 [2025-01-09 14:46:41,977 INFO L226 Difference]: Without dead ends: 1888 [2025-01-09 14:46:41,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:46:41,982 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 3173 mSDsluCounter, 2933 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 691 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3173 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 691 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:41,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3173 Valid, 3287 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [691 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 14:46:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2025-01-09 14:46:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 872. [2025-01-09 14:46:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 705 states have (on average 1.550354609929078) internal successors, (1093), 708 states have internal predecessors, (1093), 160 states have call successors, (160), 6 states have call predecessors, (160), 6 states have return successors, (160), 157 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 14:46:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1413 transitions. [2025-01-09 14:46:42,056 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1413 transitions. Word has length 428 [2025-01-09 14:46:42,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:42,057 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1413 transitions. [2025-01-09 14:46:42,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:46:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1413 transitions. [2025-01-09 14:46:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 14:46:42,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:42,062 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:42,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:46:42,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:42,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1585322320, now seen corresponding path program 1 times [2025-01-09 14:46:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:42,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764851012] [2025-01-09 14:46:42,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:42,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:42,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 14:46:42,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 14:46:42,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:42,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764851012] [2025-01-09 14:46:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764851012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:42,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:42,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337184862] [2025-01-09 14:46:42,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:42,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:42,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:42,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:42,979 INFO L87 Difference]: Start difference. First operand 872 states and 1413 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:43,118 INFO L93 Difference]: Finished difference Result 2075 states and 3368 transitions. [2025-01-09 14:46:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:43,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 428 [2025-01-09 14:46:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:43,126 INFO L225 Difference]: With dead ends: 2075 [2025-01-09 14:46:43,127 INFO L226 Difference]: Without dead ends: 1381 [2025-01-09 14:46:43,129 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-01-09 14:46:43,130 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 527 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:43,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 752 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-01-09 14:46:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 880. [2025-01-09 14:46:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 711 states have (on average 1.540084388185654) internal successors, (1095), 714 states have internal predecessors, (1095), 160 states have call successors, (160), 8 states have call predecessors, (160), 8 states have return successors, (160), 157 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 14:46:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1415 transitions. [2025-01-09 14:46:43,193 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1415 transitions. Word has length 428 [2025-01-09 14:46:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:43,194 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1415 transitions. [2025-01-09 14:46:43,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1415 transitions. [2025-01-09 14:46:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 14:46:43,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:43,202 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:43,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:46:43,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:43,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1625997070, now seen corresponding path program 1 times [2025-01-09 14:46:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868876933] [2025-01-09 14:46:43,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:43,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 14:46:44,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 14:46:44,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:44,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:46,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868876933] [2025-01-09 14:46:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868876933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:46,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:46,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:46:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549066512] [2025-01-09 14:46:46,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:46,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:46:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:46,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:46:46,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:46:46,113 INFO L87 Difference]: Start difference. First operand 880 states and 1415 transitions. Second operand has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:46:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:48,679 INFO L93 Difference]: Finished difference Result 2693 states and 4321 transitions. [2025-01-09 14:46:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:46:48,679 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 428 [2025-01-09 14:46:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:48,690 INFO L225 Difference]: With dead ends: 2693 [2025-01-09 14:46:48,690 INFO L226 Difference]: Without dead ends: 2201 [2025-01-09 14:46:48,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2025-01-09 14:46:48,693 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 2478 mSDsluCounter, 3532 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2478 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:48,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2478 Valid, 3970 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 14:46:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2025-01-09 14:46:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 922. [2025-01-09 14:46:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 752 states have (on average 1.5412234042553192) internal successors, (1159), 755 states have internal predecessors, (1159), 160 states have call successors, (160), 9 states have call predecessors, (160), 9 states have return successors, (160), 157 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 14:46:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1479 transitions. [2025-01-09 14:46:48,777 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1479 transitions. Word has length 428 [2025-01-09 14:46:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:48,778 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1479 transitions. [2025-01-09 14:46:48,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.5) internal successors, (126), 12 states have internal predecessors, (126), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:46:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1479 transitions. [2025-01-09 14:46:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 14:46:48,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:48,785 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:48,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:46:48,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1639610928, now seen corresponding path program 1 times [2025-01-09 14:46:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521714] [2025-01-09 14:46:48,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:48,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 14:46:50,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 14:46:50,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:50,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:50,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521714] [2025-01-09 14:46:50,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:50,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:50,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:46:50,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24378353] [2025-01-09 14:46:50,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:50,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:46:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:50,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:46:50,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:46:50,642 INFO L87 Difference]: Start difference. First operand 922 states and 1479 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:51,028 INFO L93 Difference]: Finished difference Result 2527 states and 4082 transitions. [2025-01-09 14:46:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:46:51,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 428 [2025-01-09 14:46:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:51,038 INFO L225 Difference]: With dead ends: 2527 [2025-01-09 14:46:51,038 INFO L226 Difference]: Without dead ends: 1837 [2025-01-09 14:46:51,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:46:51,040 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 446 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:51,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 2004 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2025-01-09 14:46:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1618. [2025-01-09 14:46:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1343 states have (on average 1.5495160089352196) internal successors, (2081), 1349 states have internal predecessors, (2081), 259 states have call successors, (259), 15 states have call predecessors, (259), 15 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2025-01-09 14:46:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2599 transitions. [2025-01-09 14:46:51,117 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2599 transitions. Word has length 428 [2025-01-09 14:46:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:51,119 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2599 transitions. [2025-01-09 14:46:51,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2599 transitions. [2025-01-09 14:46:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-09 14:46:51,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:51,123 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:46:51,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:51,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash -986955704, now seen corresponding path program 1 times [2025-01-09 14:46:51,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:51,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798055952] [2025-01-09 14:46:51,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:51,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:46:53,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:46:53,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:53,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 12 proven. 168 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:46:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:54,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798055952] [2025-01-09 14:46:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798055952] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334263749] [2025-01-09 14:46:54,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:54,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:54,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:54,228 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-01-09 14:46:54,228 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-01-09 14:46:54,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-01-09 14:46:54,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-01-09 14:46:54,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:54,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:54,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:46:54,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 1828 proven. 24 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-01-09 14:46:54,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 156 proven. 24 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:46:55,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334263749] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:55,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:55,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 14:46:55,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648048169] [2025-01-09 14:46:55,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:55,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:46:55,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:55,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:46:55,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:46:55,170 INFO L87 Difference]: Start difference. First operand 1618 states and 2599 transitions. Second operand has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 4 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 4 states have call predecessors, (127), 4 states have call successors, (127) [2025-01-09 14:46:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:55,904 INFO L93 Difference]: Finished difference Result 2615 states and 4127 transitions. [2025-01-09 14:46:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:46:55,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 4 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 4 states have call predecessors, (127), 4 states have call successors, (127) Word has length 429 [2025-01-09 14:46:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:55,912 INFO L225 Difference]: With dead ends: 2615 [2025-01-09 14:46:55,912 INFO L226 Difference]: Without dead ends: 1167 [2025-01-09 14:46:55,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:46:55,915 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 374 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:55,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 759 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:46:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2025-01-09 14:46:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1056. [2025-01-09 14:46:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 789 states have (on average 1.4334600760456273) internal successors, (1131), 791 states have internal predecessors, (1131), 243 states have call successors, (243), 23 states have call predecessors, (243), 23 states have return successors, (243), 241 states have call predecessors, (243), 243 states have call successors, (243) [2025-01-09 14:46:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1617 transitions. [2025-01-09 14:46:56,008 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1617 transitions. Word has length 429 [2025-01-09 14:46:56,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:56,009 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1617 transitions. [2025-01-09 14:46:56,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 4 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 4 states have call predecessors, (127), 4 states have call successors, (127) [2025-01-09 14:46:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1617 transitions. [2025-01-09 14:46:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:46:56,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:56,012 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:56,024 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-01-09 14:46:56,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:56,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:56,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1106706487, now seen corresponding path program 1 times [2025-01-09 14:46:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:56,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975993648] [2025-01-09 14:46:56,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:56,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:56,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:46:56,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:46:56,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:56,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:46:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:57,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975993648] [2025-01-09 14:46:57,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975993648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:57,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:57,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:57,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438064613] [2025-01-09 14:46:57,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:57,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:57,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:57,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:57,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:57,088 INFO L87 Difference]: Start difference. First operand 1056 states and 1617 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:57,307 INFO L93 Difference]: Finished difference Result 2377 states and 3629 transitions. [2025-01-09 14:46:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:57,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 430 [2025-01-09 14:46:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:57,318 INFO L225 Difference]: With dead ends: 2377 [2025-01-09 14:46:57,318 INFO L226 Difference]: Without dead ends: 1597 [2025-01-09 14:46:57,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:46:57,327 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 344 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:57,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 782 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-01-09 14:46:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1263. [2025-01-09 14:46:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 995 states have (on average 1.4673366834170853) internal successors, (1460), 997 states have internal predecessors, (1460), 243 states have call successors, (243), 24 states have call predecessors, (243), 24 states have return successors, (243), 241 states have call predecessors, (243), 243 states have call successors, (243) [2025-01-09 14:46:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1946 transitions. [2025-01-09 14:46:57,485 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1946 transitions. Word has length 430 [2025-01-09 14:46:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:57,486 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1946 transitions. [2025-01-09 14:46:57,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 14:46:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1946 transitions. [2025-01-09 14:46:57,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:46:57,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:57,489 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:46:57,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:46:57,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:57,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash -887851769, now seen corresponding path program 1 times [2025-01-09 14:46:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:57,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218925893] [2025-01-09 14:46:57,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:57,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:46:58,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:46:58,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:58,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:46:59,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218925893] [2025-01-09 14:46:59,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218925893] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940381036] [2025-01-09 14:46:59,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:59,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:59,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:46:59,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:46:59,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:46:59,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:46:59,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:59,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:59,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:46:59,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 1368 proven. 162 refuted. 0 times theorem prover too weak. 5790 trivial. 0 not checked. [2025-01-09 14:47:00,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:47:00,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940381036] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:00,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:00,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:47:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310797765] [2025-01-09 14:47:00,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:00,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:47:00,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:00,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:47:00,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:47:00,427 INFO L87 Difference]: Start difference. First operand 1263 states and 1946 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-01-09 14:47:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:00,810 INFO L93 Difference]: Finished difference Result 2083 states and 3172 transitions. [2025-01-09 14:47:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:47:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) Word has length 430 [2025-01-09 14:47:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:00,816 INFO L225 Difference]: With dead ends: 2083 [2025-01-09 14:47:00,816 INFO L226 Difference]: Without dead ends: 1092 [2025-01-09 14:47:00,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 857 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:47:00,819 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 375 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:00,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 760 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:47:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-01-09 14:47:00,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1068. [2025-01-09 14:47:00,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 795 states have (on average 1.4226415094339622) internal successors, (1131), 797 states have internal predecessors, (1131), 243 states have call successors, (243), 29 states have call predecessors, (243), 29 states have return successors, (243), 241 states have call predecessors, (243), 243 states have call successors, (243) [2025-01-09 14:47:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1617 transitions. [2025-01-09 14:47:00,930 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1617 transitions. Word has length 430 [2025-01-09 14:47:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:00,930 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1617 transitions. [2025-01-09 14:47:00,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-01-09 14:47:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1617 transitions. [2025-01-09 14:47:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:47:00,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:00,934 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:00,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:47:01,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:01,139 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:01,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:01,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1297936889, now seen corresponding path program 1 times [2025-01-09 14:47:01,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:01,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183826382] [2025-01-09 14:47:01,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:01,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:01,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:47:02,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:47:02,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:02,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 126 proven. 54 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:47:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:03,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183826382] [2025-01-09 14:47:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183826382] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:03,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247730656] [2025-01-09 14:47:03,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:03,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:03,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:03,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:47:03,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:47:03,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:47:03,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:47:03,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:03,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:03,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 14:47:03,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3168 proven. 54 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2025-01-09 14:47:04,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 126 proven. 54 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:47:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247730656] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:04,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-01-09 14:47:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575974443] [2025-01-09 14:47:04,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:04,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:47:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:04,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:47:04,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:47:04,823 INFO L87 Difference]: Start difference. First operand 1068 states and 1617 transitions. Second operand has 16 states, 16 states have (on average 19.75) internal successors, (316), 16 states have internal predecessors, (316), 6 states have call successors, (183), 3 states have call predecessors, (183), 6 states have return successors, (183), 6 states have call predecessors, (183), 6 states have call successors, (183) [2025-01-09 14:47:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:05,980 INFO L93 Difference]: Finished difference Result 2603 states and 3980 transitions. [2025-01-09 14:47:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:47:05,981 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 19.75) internal successors, (316), 16 states have internal predecessors, (316), 6 states have call successors, (183), 3 states have call predecessors, (183), 6 states have return successors, (183), 6 states have call predecessors, (183), 6 states have call successors, (183) Word has length 430 [2025-01-09 14:47:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:05,995 INFO L225 Difference]: With dead ends: 2603 [2025-01-09 14:47:05,995 INFO L226 Difference]: Without dead ends: 1765 [2025-01-09 14:47:05,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:47:05,997 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1703 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:05,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 2151 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:47:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-01-09 14:47:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1131. [2025-01-09 14:47:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 857 states have (on average 1.427071178529755) internal successors, (1223), 859 states have internal predecessors, (1223), 243 states have call successors, (243), 30 states have call predecessors, (243), 30 states have return successors, (243), 241 states have call predecessors, (243), 243 states have call successors, (243) [2025-01-09 14:47:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1709 transitions. [2025-01-09 14:47:06,087 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1709 transitions. Word has length 430 [2025-01-09 14:47:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:06,087 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1709 transitions. [2025-01-09 14:47:06,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.75) internal successors, (316), 16 states have internal predecessors, (316), 6 states have call successors, (183), 3 states have call predecessors, (183), 6 states have return successors, (183), 6 states have call predecessors, (183), 6 states have call successors, (183) [2025-01-09 14:47:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1709 transitions. [2025-01-09 14:47:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 14:47:06,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:06,090 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:06,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:47:06,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 14:47:06,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:06,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:06,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1093518573, now seen corresponding path program 1 times [2025-01-09 14:47:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:06,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64948048] [2025-01-09 14:47:06,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:06,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:06,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:47:07,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:47:07,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:07,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 60 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:47:08,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64948048] [2025-01-09 14:47:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64948048] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346192315] [2025-01-09 14:47:08,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:08,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:08,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:08,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:47:08,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:47:08,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:47:08,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:47:08,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:08,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:08,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:47:08,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3340 proven. 60 refuted. 0 times theorem prover too weak. 3920 trivial. 0 not checked. [2025-01-09 14:47:08,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 60 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 14:47:09,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346192315] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:09,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:09,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-09 14:47:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615229189] [2025-01-09 14:47:09,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:09,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:47:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:09,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:47:09,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:47:09,472 INFO L87 Difference]: Start difference. First operand 1131 states and 1709 transitions. Second operand has 15 states, 15 states have (on average 16.066666666666666) internal successors, (241), 15 states have internal predecessors, (241), 2 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 14:47:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:10,376 INFO L93 Difference]: Finished difference Result 1897 states and 2823 transitions. [2025-01-09 14:47:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:47:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 16.066666666666666) internal successors, (241), 15 states have internal predecessors, (241), 2 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 431 [2025-01-09 14:47:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:10,381 INFO L225 Difference]: With dead ends: 1897 [2025-01-09 14:47:10,381 INFO L226 Difference]: Without dead ends: 1185 [2025-01-09 14:47:10,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 855 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:47:10,383 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 720 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:10,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1568 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:47:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-01-09 14:47:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1151. [2025-01-09 14:47:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 872 states have (on average 1.4059633027522935) internal successors, (1226), 874 states have internal predecessors, (1226), 243 states have call successors, (243), 35 states have call predecessors, (243), 35 states have return successors, (243), 241 states have call predecessors, (243), 243 states have call successors, (243) [2025-01-09 14:47:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1712 transitions. [2025-01-09 14:47:10,465 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1712 transitions. Word has length 431 [2025-01-09 14:47:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:10,465 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1712 transitions. [2025-01-09 14:47:10,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.066666666666666) internal successors, (241), 15 states have internal predecessors, (241), 2 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 14:47:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1712 transitions. [2025-01-09 14:47:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:47:10,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:10,468 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:10,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:47:10,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 14:47:10,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1386963835, now seen corresponding path program 1 times [2025-01-09 14:47:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185956851] [2025-01-09 14:47:10,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:47:11,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:47:11,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:11,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:13,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185956851] [2025-01-09 14:47:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185956851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:13,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:13,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:47:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547730638] [2025-01-09 14:47:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:13,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:47:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:13,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:47:13,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:47:13,330 INFO L87 Difference]: Start difference. First operand 1151 states and 1712 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-01-09 14:47:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:14,866 INFO L93 Difference]: Finished difference Result 4589 states and 6741 transitions. [2025-01-09 14:47:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:47:14,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 432 [2025-01-09 14:47:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:14,882 INFO L225 Difference]: With dead ends: 4589 [2025-01-09 14:47:14,882 INFO L226 Difference]: Without dead ends: 3887 [2025-01-09 14:47:14,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:47:14,885 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 1790 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 4299 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:14,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 4299 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:47:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2025-01-09 14:47:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 2187. [2025-01-09 14:47:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 1700 states have (on average 1.4147058823529413) internal successors, (2405), 1704 states have internal predecessors, (2405), 425 states have call successors, (425), 61 states have call predecessors, (425), 61 states have return successors, (425), 421 states have call predecessors, (425), 425 states have call successors, (425) [2025-01-09 14:47:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3255 transitions. [2025-01-09 14:47:15,081 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3255 transitions. Word has length 432 [2025-01-09 14:47:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:15,082 INFO L471 AbstractCegarLoop]: Abstraction has 2187 states and 3255 transitions. [2025-01-09 14:47:15,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-01-09 14:47:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3255 transitions. [2025-01-09 14:47:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:47:15,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:15,085 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:15,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:47:15,085 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 419613181, now seen corresponding path program 1 times [2025-01-09 14:47:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686783367] [2025-01-09 14:47:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:15,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:47:15,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:47:15,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:15,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:18,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:18,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686783367] [2025-01-09 14:47:18,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686783367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:18,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:18,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:47:18,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962252682] [2025-01-09 14:47:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:18,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:47:18,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:18,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:47:18,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:47:18,981 INFO L87 Difference]: Start difference. First operand 2187 states and 3255 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:47:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:21,248 INFO L93 Difference]: Finished difference Result 6488 states and 9573 transitions. [2025-01-09 14:47:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:47:21,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 432 [2025-01-09 14:47:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:21,268 INFO L225 Difference]: With dead ends: 6488 [2025-01-09 14:47:21,269 INFO L226 Difference]: Without dead ends: 4922 [2025-01-09 14:47:21,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:47:21,276 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 749 mSDsluCounter, 3019 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 3678 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:21,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 3678 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:47:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4922 states. [2025-01-09 14:47:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4922 to 4250. [2025-01-09 14:47:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 3291 states have (on average 1.4086903676694014) internal successors, (4636), 3305 states have internal predecessors, (4636), 831 states have call successors, (831), 127 states have call predecessors, (831), 127 states have return successors, (831), 817 states have call predecessors, (831), 831 states have call successors, (831) [2025-01-09 14:47:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 6298 transitions. [2025-01-09 14:47:21,677 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 6298 transitions. Word has length 432 [2025-01-09 14:47:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:21,678 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 6298 transitions. [2025-01-09 14:47:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:47:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 6298 transitions. [2025-01-09 14:47:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-01-09 14:47:21,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:21,682 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:21,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:47:21,682 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:21,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash -150299759, now seen corresponding path program 1 times [2025-01-09 14:47:21,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:21,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463830734] [2025-01-09 14:47:21,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:21,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:21,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 14:47:21,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 14:47:21,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:21,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:23,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463830734] [2025-01-09 14:47:23,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463830734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:23,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:47:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017465859] [2025-01-09 14:47:23,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:23,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:47:23,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:23,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:47:23,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:47:23,429 INFO L87 Difference]: Start difference. First operand 4250 states and 6298 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:47:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:25,123 INFO L93 Difference]: Finished difference Result 11701 states and 17364 transitions. [2025-01-09 14:47:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:47:25,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 433 [2025-01-09 14:47:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:25,146 INFO L225 Difference]: With dead ends: 11701 [2025-01-09 14:47:25,146 INFO L226 Difference]: Without dead ends: 7864 [2025-01-09 14:47:25,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:47:25,156 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1744 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:25,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 2421 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:47:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7864 states. [2025-01-09 14:47:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7864 to 4246. [2025-01-09 14:47:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4246 states, 3287 states have (on average 1.4067538789169456) internal successors, (4624), 3301 states have internal predecessors, (4624), 831 states have call successors, (831), 127 states have call predecessors, (831), 127 states have return successors, (831), 817 states have call predecessors, (831), 831 states have call successors, (831) [2025-01-09 14:47:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4246 states to 4246 states and 6286 transitions. [2025-01-09 14:47:25,664 INFO L78 Accepts]: Start accepts. Automaton has 4246 states and 6286 transitions. Word has length 433 [2025-01-09 14:47:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:25,665 INFO L471 AbstractCegarLoop]: Abstraction has 4246 states and 6286 transitions. [2025-01-09 14:47:25,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 14:47:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 6286 transitions. [2025-01-09 14:47:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-01-09 14:47:25,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:25,670 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:25,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:47:25,671 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1600133425, now seen corresponding path program 1 times [2025-01-09 14:47:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:25,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176097070] [2025-01-09 14:47:25,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:25,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 14:47:26,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 14:47:26,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:26,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:30,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:30,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176097070] [2025-01-09 14:47:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176097070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:47:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547106063] [2025-01-09 14:47:30,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:30,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:47:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:30,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:47:30,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:47:30,403 INFO L87 Difference]: Start difference. First operand 4246 states and 6286 transitions. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-01-09 14:47:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:34,448 INFO L93 Difference]: Finished difference Result 12699 states and 18848 transitions. [2025-01-09 14:47:34,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:47:34,449 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 433 [2025-01-09 14:47:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:34,468 INFO L225 Difference]: With dead ends: 12699 [2025-01-09 14:47:34,469 INFO L226 Difference]: Without dead ends: 8866 [2025-01-09 14:47:34,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2025-01-09 14:47:34,478 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 2779 mSDsluCounter, 2602 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:34,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 2901 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 14:47:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2025-01-09 14:47:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 4413. [2025-01-09 14:47:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4413 states, 3453 states have (on average 1.4103677961193166) internal successors, (4870), 3467 states have internal predecessors, (4870), 831 states have call successors, (831), 128 states have call predecessors, (831), 128 states have return successors, (831), 817 states have call predecessors, (831), 831 states have call successors, (831) [2025-01-09 14:47:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 6532 transitions. [2025-01-09 14:47:34,919 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 6532 transitions. Word has length 433 [2025-01-09 14:47:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:34,920 INFO L471 AbstractCegarLoop]: Abstraction has 4413 states and 6532 transitions. [2025-01-09 14:47:34,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 3 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-01-09 14:47:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 6532 transitions. [2025-01-09 14:47:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-01-09 14:47:34,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:34,924 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 14:47:34,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:47:34,924 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:34,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:34,925 INFO L85 PathProgramCache]: Analyzing trace with hash -80278650, now seen corresponding path program 1 times [2025-01-09 14:47:34,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:34,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066659910] [2025-01-09 14:47:34,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:34,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:34,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 14:47:36,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 14:47:36,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:36,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 477 proven. 657 refuted. 0 times theorem prover too weak. 6186 trivial. 0 not checked. [2025-01-09 14:47:46,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066659910] [2025-01-09 14:47:46,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066659910] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686937614] [2025-01-09 14:47:46,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:46,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:46,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:46,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:47:46,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:47:46,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 14:47:46,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 14:47:46,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:46,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:46,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 14:47:46,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:48,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:47:48,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686937614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:48,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:47:48,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [29] total 37 [2025-01-09 14:47:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836471530] [2025-01-09 14:47:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:48,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:47:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:48,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:47:48,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1244, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 14:47:48,214 INFO L87 Difference]: Start difference. First operand 4413 states and 6532 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61)