./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.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_loopvsstraightlinecode_100-1loop_file-88.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 53755642d89d6037be376831b03479fef7eeb8c5758e8107a832bfc0071676df --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:59:54,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:59:54,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:59:54,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:59:54,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:59:54,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:59:54,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:59:54,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:59:54,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:59:54,524 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:59:54,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:59:54,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:59:54,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:59:54,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:59:54,525 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:59:54,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:59:54,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:59:54,526 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:59:54,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:59:54,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:59:54,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:59:54,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:59:54,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:59:54,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:59:54,526 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:59:54,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:59:54,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:59:54,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:59:54,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:59:54,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:59:54,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:59:54,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:59:54,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:59:54,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:59:54,528 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 -> 53755642d89d6037be376831b03479fef7eeb8c5758e8107a832bfc0071676df [2025-01-09 12:59:54,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:59:54,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:59:54,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:59:54,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:59:54,784 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:59:54,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i [2025-01-09 12:59:56,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d068d286b/2bd4d8342f5042e4a48758de268f9282/FLAGa4c2f51ec [2025-01-09 12:59:56,333 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:59:56,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i [2025-01-09 12:59:56,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d068d286b/2bd4d8342f5042e4a48758de268f9282/FLAGa4c2f51ec [2025-01-09 12:59:56,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d068d286b/2bd4d8342f5042e4a48758de268f9282 [2025-01-09 12:59:56,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:59:56,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:59:56,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:59:56,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:59:56,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:59:56,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781d8a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56, skipping insertion in model container [2025-01-09 12:59:56,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:59:56,739 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_loopvsstraightlinecode_100-1loop_file-88.i[916,929] [2025-01-09 12:59:56,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:59:56,813 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:59:56,821 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_loopvsstraightlinecode_100-1loop_file-88.i[916,929] [2025-01-09 12:59:56,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:59:56,873 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:59:56,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56 WrapperNode [2025-01-09 12:59:56,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:59:56,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:59:56,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:59:56,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:59:56,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,938 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2025-01-09 12:59:56,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:59:56,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:59:56,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:59:56,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:59:56,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,969 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 12:59:56,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,988 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:56,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:57,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:57,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:57,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:59:57,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:59:57,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:59:57,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:59:57,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (1/1) ... [2025-01-09 12:59:57,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:59:57,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:59:57,043 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 12:59:57,046 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 12:59:57,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:59:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:59:57,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:59:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:59:57,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:59:57,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:59:57,141 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:59:57,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:59:57,548 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-01-09 12:59:57,548 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:59:57,558 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:59:57,559 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:59:57,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:59:57 BoogieIcfgContainer [2025-01-09 12:59:57,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:59:57,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:59:57,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:59:57,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:59:57,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:59:56" (1/3) ... [2025-01-09 12:59:57,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f16fd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:59:57, skipping insertion in model container [2025-01-09 12:59:57,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:56" (2/3) ... [2025-01-09 12:59:57,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f16fd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:59:57, skipping insertion in model container [2025-01-09 12:59:57,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:59:57" (3/3) ... [2025-01-09 12:59:57,571 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-88.i [2025-01-09 12:59:57,582 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:59:57,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-88.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:59:57,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:59:57,634 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;@1cc9e57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:59:57,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:59:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 12:59:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 12:59:57,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:59:57,647 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:57,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:59:57,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:59:57,651 INFO L85 PathProgramCache]: Analyzing trace with hash 491713491, now seen corresponding path program 1 times [2025-01-09 12:59:57,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:59:57,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936045698] [2025-01-09 12:59:57,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:57,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:59:57,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 12:59:57,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 12:59:57,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:57,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 12:59:57,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:59:57,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936045698] [2025-01-09 12:59:57,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936045698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:59:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213003195] [2025-01-09 12:59:57,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:57,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:59:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:59:57,930 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 12:59:57,931 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 12:59:58,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 12:59:58,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 12:59:58,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:58,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:58,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:59:58,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:59:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 12:59:58,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:59:58,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213003195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:59:58,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:59:58,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:59:58,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561732836] [2025-01-09 12:59:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:59:58,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:59:58,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:59:58,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:59:58,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:59:58,165 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 12:59:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:59:58,188 INFO L93 Difference]: Finished difference Result 229 states and 379 transitions. [2025-01-09 12:59:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:59:58,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191 [2025-01-09 12:59:58,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:59:58,195 INFO L225 Difference]: With dead ends: 229 [2025-01-09 12:59:58,195 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 12:59:58,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 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 12:59:58,202 INFO L435 NwaCegarLoop]: 175 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, 175 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 12:59:58,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:59:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 12:59:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 12:59:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 12:59:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2025-01-09 12:59:58,233 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 191 [2025-01-09 12:59:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:59:58,234 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2025-01-09 12:59:58,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 12:59:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2025-01-09 12:59:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 12:59:58,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:59:58,238 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:58,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:59:58,438 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 12:59:58,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:59:58,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:59:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2101291701, now seen corresponding path program 1 times [2025-01-09 12:59:58,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:59:58,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777050670] [2025-01-09 12:59:58,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:59:58,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 12:59:58,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 12:59:58,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:58,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 12:59:58,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:59:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777050670] [2025-01-09 12:59:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777050670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:59:58,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:59:58,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:59:58,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66150817] [2025-01-09 12:59:58,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:59:58,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:59:58,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:59:58,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:59:58,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:59:58,983 INFO L87 Difference]: Start difference. First operand 113 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 12:59:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:59:59,179 INFO L93 Difference]: Finished difference Result 373 states and 567 transitions. [2025-01-09 12:59:59,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:59:59,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2025-01-09 12:59:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:59:59,184 INFO L225 Difference]: With dead ends: 373 [2025-01-09 12:59:59,186 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 12:59:59,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:59:59,189 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 250 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:59:59,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 484 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:59:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 12:59:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 217. [2025-01-09 12:59:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 158 states have internal predecessors, (217), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:59:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 329 transitions. [2025-01-09 12:59:59,228 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 329 transitions. Word has length 191 [2025-01-09 12:59:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:59:59,229 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 329 transitions. [2025-01-09 12:59:59,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 12:59:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 329 transitions. [2025-01-09 12:59:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 12:59:59,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:59:59,231 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:59:59,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:59:59,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:59:59,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:59:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1086787349, now seen corresponding path program 1 times [2025-01-09 12:59:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:59:59,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208330022] [2025-01-09 12:59:59,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:59:59,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 12:59:59,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 12:59:59,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:59,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 12:59:59,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:59:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208330022] [2025-01-09 12:59:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208330022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:59:59,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:59:59,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:59:59,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135873095] [2025-01-09 12:59:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:59:59,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:59:59,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:59:59,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:59:59,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:59:59,680 INFO L87 Difference]: Start difference. First operand 217 states and 329 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:00,007 INFO L93 Difference]: Finished difference Result 580 states and 878 transitions. [2025-01-09 13:00:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:00:00,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-01-09 13:00:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:00,010 INFO L225 Difference]: With dead ends: 580 [2025-01-09 13:00:00,011 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 13:00:00,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:00:00,012 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 107 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:00,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 544 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:00:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 13:00:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 282. [2025-01-09 13:00:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 194 states have (on average 1.3402061855670102) internal successors, (260), 194 states have internal predecessors, (260), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 13:00:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 428 transitions. [2025-01-09 13:00:00,060 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 428 transitions. Word has length 192 [2025-01-09 13:00:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:00,061 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 428 transitions. [2025-01-09 13:00:00,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 428 transitions. [2025-01-09 13:00:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 13:00:00,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:00,065 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:00,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:00:00,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:00,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:00,066 INFO L85 PathProgramCache]: Analyzing trace with hash -664085523, now seen corresponding path program 1 times [2025-01-09 13:00:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:00,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52966961] [2025-01-09 13:00:00,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:00,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:00,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 13:00:00,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 13:00:00,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:00,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52966961] [2025-01-09 13:00:00,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52966961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:00,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:00,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:00:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179315354] [2025-01-09 13:00:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:00,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:00:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:00,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:00:00,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:00:00,746 INFO L87 Difference]: Start difference. First operand 282 states and 428 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:01,751 INFO L93 Difference]: Finished difference Result 953 states and 1447 transitions. [2025-01-09 13:00:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:00:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-01-09 13:00:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:01,758 INFO L225 Difference]: With dead ends: 953 [2025-01-09 13:00:01,758 INFO L226 Difference]: Without dead ends: 739 [2025-01-09 13:00:01,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:00:01,760 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 412 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:01,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 804 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 13:00:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-01-09 13:00:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 406. [2025-01-09 13:00:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 289 states have (on average 1.3667820069204153) internal successors, (395), 289 states have internal predecessors, (395), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 13:00:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 619 transitions. [2025-01-09 13:00:01,838 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 619 transitions. Word has length 192 [2025-01-09 13:00:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:01,838 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 619 transitions. [2025-01-09 13:00:01,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 619 transitions. [2025-01-09 13:00:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 13:00:01,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:01,840 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:01,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:00:01,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:01,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1943949201, now seen corresponding path program 1 times [2025-01-09 13:00:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:01,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9620330] [2025-01-09 13:00:01,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:01,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 13:00:01,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 13:00:01,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:01,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:02,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:02,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9620330] [2025-01-09 13:00:02,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9620330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:02,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:02,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:00:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537253423] [2025-01-09 13:00:02,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:02,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:00:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:02,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:00:02,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:00:02,158 INFO L87 Difference]: Start difference. First operand 406 states and 619 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:02,875 INFO L93 Difference]: Finished difference Result 1296 states and 1978 transitions. [2025-01-09 13:00:02,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:00:02,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-01-09 13:00:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:02,881 INFO L225 Difference]: With dead ends: 1296 [2025-01-09 13:00:02,881 INFO L226 Difference]: Without dead ends: 958 [2025-01-09 13:00:02,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:00:02,883 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 601 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:02,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 729 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:00:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2025-01-09 13:00:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 532. [2025-01-09 13:00:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 386 states have (on average 1.3860103626943006) internal successors, (535), 386 states have internal predecessors, (535), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-01-09 13:00:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2025-01-09 13:00:02,958 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 192 [2025-01-09 13:00:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:02,959 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2025-01-09 13:00:02,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2025-01-09 13:00:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 13:00:02,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:02,960 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:02,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:00:02,960 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:02,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash -969888917, now seen corresponding path program 1 times [2025-01-09 13:00:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18247031] [2025-01-09 13:00:02,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:02,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 13:00:03,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 13:00:03,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:03,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:03,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18247031] [2025-01-09 13:00:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18247031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:00:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809162171] [2025-01-09 13:00:03,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:03,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:00:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:03,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:00:03,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:00:03,165 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:03,476 INFO L93 Difference]: Finished difference Result 1442 states and 2211 transitions. [2025-01-09 13:00:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:00:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193 [2025-01-09 13:00:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:03,482 INFO L225 Difference]: With dead ends: 1442 [2025-01-09 13:00:03,482 INFO L226 Difference]: Without dead ends: 978 [2025-01-09 13:00:03,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:00:03,486 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 166 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:03,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 453 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:00:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-01-09 13:00:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2025-01-09 13:00:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.376750700280112) internal successors, (983), 714 states have internal predecessors, (983), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:00:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1487 transitions. [2025-01-09 13:00:03,607 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1487 transitions. Word has length 193 [2025-01-09 13:00:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:03,607 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1487 transitions. [2025-01-09 13:00:03,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1487 transitions. [2025-01-09 13:00:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 13:00:03,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:03,609 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:03,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:00:03,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:03,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1218124924, now seen corresponding path program 1 times [2025-01-09 13:00:03,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:03,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790739442] [2025-01-09 13:00:03,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:03,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 13:00:03,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 13:00:03,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:03,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:03,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:03,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790739442] [2025-01-09 13:00:03,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790739442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:03,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:03,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:00:03,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062715490] [2025-01-09 13:00:03,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:03,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:00:03,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:03,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:00:03,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:00:03,706 INFO L87 Difference]: Start difference. First operand 976 states and 1487 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:03,854 INFO L93 Difference]: Finished difference Result 1962 states and 2994 transitions. [2025-01-09 13:00:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:00:03,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2025-01-09 13:00:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:03,860 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 13:00:03,860 INFO L226 Difference]: Without dead ends: 1056 [2025-01-09 13:00:03,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:00:03,863 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:03,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 293 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:00:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-01-09 13:00:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 976. [2025-01-09 13:00:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.3711484593837535) internal successors, (979), 714 states have internal predecessors, (979), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:00:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1483 transitions. [2025-01-09 13:00:03,985 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1483 transitions. Word has length 194 [2025-01-09 13:00:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:03,985 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1483 transitions. [2025-01-09 13:00:03,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1483 transitions. [2025-01-09 13:00:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 13:00:03,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:03,987 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:03,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:00:03,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1497963776, now seen corresponding path program 1 times [2025-01-09 13:00:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415536757] [2025-01-09 13:00:03,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:04,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:00:04,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:00:04,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:04,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:00:04,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:04,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415536757] [2025-01-09 13:00:04,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415536757] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:00:04,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152582091] [2025-01-09 13:00:04,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:04,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:04,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:04,360 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 13:00:04,365 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 13:00:04,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:00:04,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:00:04,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:04,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:04,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:00:04,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2025-01-09 13:00:04,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:00:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:00:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152582091] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:00:04,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:00:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2025-01-09 13:00:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478790147] [2025-01-09 13:00:04,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:00:04,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:00:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:04,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:00:04,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:00:04,835 INFO L87 Difference]: Start difference. First operand 976 states and 1483 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 4 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2025-01-09 13:00:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:06,746 INFO L93 Difference]: Finished difference Result 3032 states and 4475 transitions. [2025-01-09 13:00:06,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 13:00:06,747 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 4 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) Word has length 195 [2025-01-09 13:00:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:06,758 INFO L225 Difference]: With dead ends: 3032 [2025-01-09 13:00:06,758 INFO L226 Difference]: Without dead ends: 2126 [2025-01-09 13:00:06,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=652, Invalid=2770, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 13:00:06,762 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 2590 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2618 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:06,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2618 Valid, 2087 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 13:00:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2025-01-09 13:00:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1273. [2025-01-09 13:00:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 969 states have (on average 1.3601651186790507) internal successors, (1318), 973 states have internal predecessors, (1318), 280 states have call successors, (280), 23 states have call predecessors, (280), 23 states have return successors, (280), 276 states have call predecessors, (280), 280 states have call successors, (280) [2025-01-09 13:00:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1878 transitions. [2025-01-09 13:00:06,908 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1878 transitions. Word has length 195 [2025-01-09 13:00:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:06,909 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1878 transitions. [2025-01-09 13:00:06,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 4 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2025-01-09 13:00:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1878 transitions. [2025-01-09 13:00:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 13:00:06,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:06,911 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:06,918 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 13:00:07,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:07,112 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:07,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1075261950, now seen corresponding path program 1 times [2025-01-09 13:00:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145937954] [2025-01-09 13:00:07,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:07,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:00:07,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:00:07,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:07,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-01-09 13:00:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145937954] [2025-01-09 13:00:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145937954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:00:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129413358] [2025-01-09 13:00:07,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:07,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:07,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:07,671 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 13:00:07,673 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 13:00:07,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:00:07,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:00:07,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:07,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:07,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 13:00:07,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:07,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:00:07,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129413358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:07,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:00:07,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-01-09 13:00:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738306755] [2025-01-09 13:00:07,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:07,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:00:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:07,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:00:07,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:00:07,836 INFO L87 Difference]: Start difference. First operand 1273 states and 1878 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:08,299 INFO L93 Difference]: Finished difference Result 3213 states and 4752 transitions. [2025-01-09 13:00:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:00:08,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-01-09 13:00:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:08,310 INFO L225 Difference]: With dead ends: 3213 [2025-01-09 13:00:08,310 INFO L226 Difference]: Without dead ends: 2189 [2025-01-09 13:00:08,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:00:08,313 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 272 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:08,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 955 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:00:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-01-09 13:00:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1843. [2025-01-09 13:00:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1403 states have (on average 1.3414112615823235) internal successors, (1882), 1409 states have internal predecessors, (1882), 406 states have call successors, (406), 33 states have call predecessors, (406), 33 states have return successors, (406), 400 states have call predecessors, (406), 406 states have call successors, (406) [2025-01-09 13:00:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2694 transitions. [2025-01-09 13:00:08,479 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2694 transitions. Word has length 195 [2025-01-09 13:00:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:08,479 INFO L471 AbstractCegarLoop]: Abstraction has 1843 states and 2694 transitions. [2025-01-09 13:00:08,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2694 transitions. [2025-01-09 13:00:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 13:00:08,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:08,482 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:08,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 13:00:08,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:08,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:08,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1369605007, now seen corresponding path program 1 times [2025-01-09 13:00:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:08,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089634232] [2025-01-09 13:00:08,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:08,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 13:00:08,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 13:00:08,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:08,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:09,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:09,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089634232] [2025-01-09 13:00:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089634232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:09,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:09,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:00:09,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254259180] [2025-01-09 13:00:09,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:09,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:00:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:09,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:00:09,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:00:09,419 INFO L87 Difference]: Start difference. First operand 1843 states and 2694 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 13:00:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:10,870 INFO L93 Difference]: Finished difference Result 3579 states and 5243 transitions. [2025-01-09 13:00:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:00:10,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 195 [2025-01-09 13:00:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:10,884 INFO L225 Difference]: With dead ends: 3579 [2025-01-09 13:00:10,884 INFO L226 Difference]: Without dead ends: 2134 [2025-01-09 13:00:10,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:00:10,889 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 515 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:10,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1341 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 13:00:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2025-01-09 13:00:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1895. [2025-01-09 13:00:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1455 states have (on average 1.342955326460481) internal successors, (1954), 1461 states have internal predecessors, (1954), 406 states have call successors, (406), 33 states have call predecessors, (406), 33 states have return successors, (406), 400 states have call predecessors, (406), 406 states have call successors, (406) [2025-01-09 13:00:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2766 transitions. [2025-01-09 13:00:11,062 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2766 transitions. Word has length 195 [2025-01-09 13:00:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:11,062 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2766 transitions. [2025-01-09 13:00:11,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 13:00:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2766 transitions. [2025-01-09 13:00:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 13:00:11,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:11,066 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:11,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:00:11,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:11,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1904020021, now seen corresponding path program 1 times [2025-01-09 13:00:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:11,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576848564] [2025-01-09 13:00:11,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:11,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:00:11,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:00:11,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:11,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-01-09 13:00:11,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:11,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576848564] [2025-01-09 13:00:11,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576848564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:00:11,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819851824] [2025-01-09 13:00:11,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:11,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:11,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:11,508 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 13:00:11,510 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 13:00:11,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:00:11,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:00:11,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:11,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:11,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 13:00:11,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 283 proven. 3 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2025-01-09 13:00:11,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:00:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-01-09 13:00:12,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819851824] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:00:12,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:00:12,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-01-09 13:00:12,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430013848] [2025-01-09 13:00:12,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:00:12,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:00:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:12,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:00:12,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:00:12,021 INFO L87 Difference]: Start difference. First operand 1895 states and 2766 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 13:00:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:12,550 INFO L93 Difference]: Finished difference Result 2928 states and 4226 transitions. [2025-01-09 13:00:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:00:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-01-09 13:00:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:12,557 INFO L225 Difference]: With dead ends: 2928 [2025-01-09 13:00:12,557 INFO L226 Difference]: Without dead ends: 1136 [2025-01-09 13:00:12,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2025-01-09 13:00:12,562 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 689 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:12,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 332 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:00:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-01-09 13:00:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1076. [2025-01-09 13:00:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 833 states have (on average 1.3205282112845138) internal successors, (1100), 836 states have internal predecessors, (1100), 217 states have call successors, (217), 25 states have call predecessors, (217), 25 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2025-01-09 13:00:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1534 transitions. [2025-01-09 13:00:12,704 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1534 transitions. Word has length 196 [2025-01-09 13:00:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:12,704 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1534 transitions. [2025-01-09 13:00:12,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 13:00:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1534 transitions. [2025-01-09 13:00:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 13:00:12,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:12,706 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:12,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 13:00:12,907 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,SelfDestructingSolverStorable10 [2025-01-09 13:00:12,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:12,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash -52298189, now seen corresponding path program 1 times [2025-01-09 13:00:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:12,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875527391] [2025-01-09 13:00:12,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:12,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:00:12,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:00:12,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:12,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 13:00:13,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875527391] [2025-01-09 13:00:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875527391] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:00:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260225905] [2025-01-09 13:00:13,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:13,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:13,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:13,666 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 13:00:13,667 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 13:00:13,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:00:13,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:00:13,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:13,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:13,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 13:00:13,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:14,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:00:14,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260225905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:14,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:00:14,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-01-09 13:00:14,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247181936] [2025-01-09 13:00:14,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:14,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:00:14,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:14,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:00:14,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:00:14,468 INFO L87 Difference]: Start difference. First operand 1076 states and 1534 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:15,106 INFO L93 Difference]: Finished difference Result 2250 states and 3209 transitions. [2025-01-09 13:00:15,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:00:15,107 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-01-09 13:00:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:15,112 INFO L225 Difference]: With dead ends: 2250 [2025-01-09 13:00:15,112 INFO L226 Difference]: Without dead ends: 1456 [2025-01-09 13:00:15,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-01-09 13:00:15,115 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 298 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:15,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 823 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:00:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-01-09 13:00:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1159. [2025-01-09 13:00:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 916 states have (on average 1.3253275109170306) internal successors, (1214), 919 states have internal predecessors, (1214), 217 states have call successors, (217), 25 states have call predecessors, (217), 25 states have return successors, (217), 214 states have call predecessors, (217), 217 states have call successors, (217) [2025-01-09 13:00:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1648 transitions. [2025-01-09 13:00:15,242 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1648 transitions. Word has length 196 [2025-01-09 13:00:15,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:15,242 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1648 transitions. [2025-01-09 13:00:15,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1648 transitions. [2025-01-09 13:00:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 13:00:15,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:15,244 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:15,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 13:00:15,448 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,SelfDestructingSolverStorable11 [2025-01-09 13:00:15,448 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:15,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash -207642944, now seen corresponding path program 1 times [2025-01-09 13:00:15,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:15,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523483528] [2025-01-09 13:00:15,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:15,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:00:15,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:00:15,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:15,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:15,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:15,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523483528] [2025-01-09 13:00:15,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523483528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:15,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:15,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:00:15,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726591782] [2025-01-09 13:00:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:15,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:00:15,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:15,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:00:15,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:00:15,670 INFO L87 Difference]: Start difference. First operand 1159 states and 1648 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:16,449 INFO L93 Difference]: Finished difference Result 2716 states and 3866 transitions. [2025-01-09 13:00:16,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:00:16,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-01-09 13:00:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:16,458 INFO L225 Difference]: With dead ends: 2716 [2025-01-09 13:00:16,458 INFO L226 Difference]: Without dead ends: 1743 [2025-01-09 13:00:16,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:00:16,461 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 292 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:16,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 680 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:00:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-01-09 13:00:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1414. [2025-01-09 13:00:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1132 states have (on average 1.3180212014134276) internal successors, (1492), 1136 states have internal predecessors, (1492), 252 states have call successors, (252), 29 states have call predecessors, (252), 29 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:00:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1996 transitions. [2025-01-09 13:00:16,682 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1996 transitions. Word has length 196 [2025-01-09 13:00:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:16,682 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 1996 transitions. [2025-01-09 13:00:16,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1996 transitions. [2025-01-09 13:00:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 13:00:16,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:16,685 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:16,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 13:00:16,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:16,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2093179646, now seen corresponding path program 1 times [2025-01-09 13:00:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:16,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344093124] [2025-01-09 13:00:16,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:16,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 13:00:16,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 13:00:16,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:16,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344093124] [2025-01-09 13:00:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344093124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:00:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395578208] [2025-01-09 13:00:17,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:17,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:00:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:17,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:00:17,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:00:17,195 INFO L87 Difference]: Start difference. First operand 1414 states and 1996 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:18,398 INFO L93 Difference]: Finished difference Result 2995 states and 4247 transitions. [2025-01-09 13:00:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:00:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-01-09 13:00:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:18,406 INFO L225 Difference]: With dead ends: 2995 [2025-01-09 13:00:18,406 INFO L226 Difference]: Without dead ends: 1924 [2025-01-09 13:00:18,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:00:18,409 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 405 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:18,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 923 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 13:00:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2025-01-09 13:00:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1427. [2025-01-09 13:00:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1145 states have (on average 1.319650655021834) internal successors, (1511), 1149 states have internal predecessors, (1511), 252 states have call successors, (252), 29 states have call predecessors, (252), 29 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:00:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2015 transitions. [2025-01-09 13:00:18,571 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2015 transitions. Word has length 196 [2025-01-09 13:00:18,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:18,572 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 2015 transitions. [2025-01-09 13:00:18,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2015 transitions. [2025-01-09 13:00:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 13:00:18,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:18,577 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:18,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 13:00:18,577 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:18,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash 69219629, now seen corresponding path program 1 times [2025-01-09 13:00:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:18,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303296913] [2025-01-09 13:00:18,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:18,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:18,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 13:00:18,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 13:00:18,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:18,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:18,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:18,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303296913] [2025-01-09 13:00:18,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303296913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:18,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:18,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:00:18,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640695492] [2025-01-09 13:00:18,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:18,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:00:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:18,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:00:18,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:00:18,991 INFO L87 Difference]: Start difference. First operand 1427 states and 2015 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:19,671 INFO L93 Difference]: Finished difference Result 2751 states and 3895 transitions. [2025-01-09 13:00:19,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:00:19,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2025-01-09 13:00:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:19,679 INFO L225 Difference]: With dead ends: 2751 [2025-01-09 13:00:19,679 INFO L226 Difference]: Without dead ends: 1638 [2025-01-09 13:00:19,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:00:19,682 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 306 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:19,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 616 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:00:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-01-09 13:00:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1396. [2025-01-09 13:00:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1114 states have (on average 1.3123877917414721) internal successors, (1462), 1118 states have internal predecessors, (1462), 252 states have call successors, (252), 29 states have call predecessors, (252), 29 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:00:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1966 transitions. [2025-01-09 13:00:19,851 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1966 transitions. Word has length 197 [2025-01-09 13:00:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:19,851 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1966 transitions. [2025-01-09 13:00:19,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1966 transitions. [2025-01-09 13:00:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 13:00:19,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:19,853 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:19,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 13:00:19,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:19,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1619724113, now seen corresponding path program 1 times [2025-01-09 13:00:19,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:19,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715128611] [2025-01-09 13:00:19,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:19,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 13:00:19,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 13:00:19,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:19,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 13:00:20,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:00:20,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715128611] [2025-01-09 13:00:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715128611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:00:20,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:00:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:00:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707201804] [2025-01-09 13:00:20,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:00:20,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:00:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:00:20,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:00:20,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:00:20,298 INFO L87 Difference]: Start difference. First operand 1396 states and 1966 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:00:20,988 INFO L93 Difference]: Finished difference Result 2652 states and 3748 transitions. [2025-01-09 13:00:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:00:20,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2025-01-09 13:00:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:00:20,996 INFO L225 Difference]: With dead ends: 2652 [2025-01-09 13:00:20,996 INFO L226 Difference]: Without dead ends: 1592 [2025-01-09 13:00:20,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:00:20,999 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 280 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:00:20,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 730 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:00:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-01-09 13:00:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1366. [2025-01-09 13:00:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1084 states have (on average 1.3062730627306274) internal successors, (1416), 1088 states have internal predecessors, (1416), 252 states have call successors, (252), 29 states have call predecessors, (252), 29 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 13:00:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1920 transitions. [2025-01-09 13:00:21,213 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1920 transitions. Word has length 197 [2025-01-09 13:00:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:00:21,214 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1920 transitions. [2025-01-09 13:00:21,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 13:00:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1920 transitions. [2025-01-09 13:00:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 13:00:21,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:00:21,216 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:00:21,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 13:00:21,216 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:00:21,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:00:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1523038856, now seen corresponding path program 1 times [2025-01-09 13:00:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:00:21,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186432371] [2025-01-09 13:00:21,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:00:21,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:00:21,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:00:21,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:21,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:00:21,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821477193] [2025-01-09 13:00:21,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:00:21,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:00:21,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:00:21,295 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 13:00:21,297 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 13:00:21,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 13:00:22,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 13:00:22,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:00:22,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:00:22,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 13:00:22,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 955 proven. 180 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 13:00:24,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:00:43,043 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 28 DAG size of output: 24 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-01-09 13:00:57,010 WARN L286 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 30 DAG size of output: 26 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-01-09 13:01:11,368 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (mod c_~last_1_var_1_20~0 256))) (and (not (= c_~last_1_var_1_27~0 (+ .cse0 c_~last_1_var_1_25~0))) (not (= (mod c_~var_1_16~0 4294967296) .cse0)))) (let ((.cse3 (mod c_~var_1_27~0 65536)) (.cse13 (mod (* c_~var_1_27~0 3) 65536))) (let ((.cse4 (mod c_~var_1_20~0 256)) (.cse5 (* 4294967295 c_~var_1_18~0)) (.cse18 (* c_~var_1_27~0 .cse13)) (.cse16 (* 4294901760 c_~var_1_27~0)) (.cse19 (* .cse3 c_~var_1_27~0)) (.cse17 (* c_~var_1_27~0 4294967295 (mod c_~var_1_21~0 256)))) (let ((.cse6 (< 32767 .cse3)) (.cse2 (mod (+ .cse19 .cse17) 4294967296)) (.cse7 (< .cse3 32768)) (.cse8 (mod (+ .cse16 .cse19 .cse17) 4294967296)) (.cse1 (< 0 c_~var_1_27~0)) (.cse10 (< c_~var_1_27~0 1)) (.cse14 (< 32767 .cse13)) (.cse15 (mod (+ .cse17 .cse18) 4294967296)) (.cse11 (< .cse13 32768)) (.cse12 (mod (+ .cse16 .cse17 .cse18) 4294967296)) (.cse9 (mod (+ .cse4 .cse5 25) 4294967296))) (and (or .cse1 (and (or (< .cse2 (+ (mod (+ .cse3 .cse4 .cse5 25) 4294967296) 1)) .cse6) (or .cse7 (< .cse8 (+ (mod (+ .cse3 4294901785 .cse4 .cse5) 4294967296) 1))))) (or (and (or .cse6 (< .cse2 (+ .cse3 .cse9 1))) (or .cse7 (< .cse8 (+ .cse3 4294901761 .cse9)))) .cse1) (or .cse10 (and (or .cse11 (< .cse12 (+ (mod (+ 4294901785 .cse4 .cse5 .cse13) 4294967296) 1))) (or .cse14 (< .cse15 (+ (mod (+ .cse4 .cse5 25 .cse13) 4294967296) 1))))) (or .cse10 (and (or .cse14 (< .cse15 (+ .cse9 .cse13 1))) (or .cse11 (< .cse12 (+ 4294901761 .cse9 .cse13)))))))))) is different from true [2025-01-09 13:01:16,927 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)