./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-38.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_fillercode_fillercodesize_ps-cn-250_file-38.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 9e67c5c4be7150eb59c1243c7ce409eeea38b905cf584c084e1e8e9245e730bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:42:14,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:42:14,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:42:14,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:42:14,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:42:14,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:42:14,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:42:14,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:42:14,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:42:14,707 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:42:14,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:42:14,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:42:14,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:42:14,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:42:14,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:42:14,709 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:42:14,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:42:14,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:42:14,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:42:14,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:42:14,710 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 -> 9e67c5c4be7150eb59c1243c7ce409eeea38b905cf584c084e1e8e9245e730bf [2025-01-09 09:42:14,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:42:14,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:42:14,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:42:14,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:42:14,951 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:42:14,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-38.i [2025-01-09 09:42:16,202 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a18f49deb/71ce1d9658c44bd389ea5f57df12563f/FLAGc292ef1cd [2025-01-09 09:42:16,558 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:42:16,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-38.i [2025-01-09 09:42:16,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a18f49deb/71ce1d9658c44bd389ea5f57df12563f/FLAGc292ef1cd [2025-01-09 09:42:16,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a18f49deb/71ce1d9658c44bd389ea5f57df12563f [2025-01-09 09:42:16,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:42:16,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:42:16,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:42:16,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:42:16,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:42:16,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:42:16" (1/1) ... [2025-01-09 09:42:16,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ea8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:16, skipping insertion in model container [2025-01-09 09:42:16,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:42:16" (1/1) ... [2025-01-09 09:42:16,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:42:16,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-38.i[916,929] [2025-01-09 09:42:16,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:42:17,002 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:42:17,010 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_fillercode_fillercodesize_ps-cn-250_file-38.i[916,929] [2025-01-09 09:42:17,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:42:17,112 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:42:17,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17 WrapperNode [2025-01-09 09:42:17,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:42:17,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:42:17,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:42:17,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:42:17,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,177 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2025-01-09 09:42:17,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:42:17,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:42:17,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:42:17,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:42:17,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,227 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 09:42:17,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:42:17,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:42:17,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:42:17,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:42:17,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (1/1) ... [2025-01-09 09:42:17,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:42:17,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:17,306 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 09:42:17,308 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 09:42:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:42:17,339 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:42:17,339 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:42:17,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:42:17,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:42:17,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:42:17,421 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:42:17,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:42:18,167 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 09:42:18,167 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:42:18,178 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:42:18,179 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:42:18,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:42:18 BoogieIcfgContainer [2025-01-09 09:42:18,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:42:18,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:42:18,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:42:18,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:42:18,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:42:16" (1/3) ... [2025-01-09 09:42:18,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6273acb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:42:18, skipping insertion in model container [2025-01-09 09:42:18,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:42:17" (2/3) ... [2025-01-09 09:42:18,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6273acb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:42:18, skipping insertion in model container [2025-01-09 09:42:18,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:42:18" (3/3) ... [2025-01-09 09:42:18,186 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-38.i [2025-01-09 09:42:18,198 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:42:18,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-38.i that has 2 procedures, 240 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:42:18,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:42:18,264 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;@7ac6421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:42:18,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:42:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 157 states have (on average 1.4968152866242037) internal successors, (235), 158 states have internal predecessors, (235), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 09:42:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-01-09 09:42:18,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:18,293 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:18,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:18,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:18,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1446700076, now seen corresponding path program 1 times [2025-01-09 09:42:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:18,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304470576] [2025-01-09 09:42:18,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:18,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:18,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-01-09 09:42:18,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-01-09 09:42:18,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:18,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-01-09 09:42:18,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304470576] [2025-01-09 09:42:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304470576] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203858326] [2025-01-09 09:42:18,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:18,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:18,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:18,816 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 09:42:18,817 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 09:42:18,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-01-09 09:42:19,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-01-09 09:42:19,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:19,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:19,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:42:19,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-01-09 09:42:19,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:42:19,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203858326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:19,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:42:19,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:42:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754180840] [2025-01-09 09:42:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:19,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:42:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:19,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:42:19,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:42:19,195 INFO L87 Difference]: Start difference. First operand has 240 states, 157 states have (on average 1.4968152866242037) internal successors, (235), 158 states have internal predecessors, (235), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 09:42:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:19,235 INFO L93 Difference]: Finished difference Result 474 states and 865 transitions. [2025-01-09 09:42:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:42:19,237 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 499 [2025-01-09 09:42:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:19,243 INFO L225 Difference]: With dead ends: 474 [2025-01-09 09:42:19,243 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 09:42:19,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 500 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 09:42:19,256 INFO L435 NwaCegarLoop]: 389 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, 389 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 09:42:19,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 09:42:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-01-09 09:42:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 155 states have (on average 1.4774193548387098) internal successors, (229), 155 states have internal predecessors, (229), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 09:42:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 389 transitions. [2025-01-09 09:42:19,319 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 389 transitions. Word has length 499 [2025-01-09 09:42:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:19,321 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 389 transitions. [2025-01-09 09:42:19,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 09:42:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 389 transitions. [2025-01-09 09:42:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-01-09 09:42:19,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:19,339 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:19,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:42:19,544 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 09:42:19,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:19,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1529878256, now seen corresponding path program 1 times [2025-01-09 09:42:19,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750521950] [2025-01-09 09:42:19,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:19,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-01-09 09:42:19,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-01-09 09:42:19,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:19,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:42:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750521950] [2025-01-09 09:42:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750521950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:20,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:42:20,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69421441] [2025-01-09 09:42:20,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:20,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:42:20,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:20,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:42:20,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:42:20,916 INFO L87 Difference]: Start difference. First operand 237 states and 389 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:21,455 INFO L93 Difference]: Finished difference Result 934 states and 1538 transitions. [2025-01-09 09:42:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:42:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 499 [2025-01-09 09:42:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:21,465 INFO L225 Difference]: With dead ends: 934 [2025-01-09 09:42:21,465 INFO L226 Difference]: Without dead ends: 700 [2025-01-09 09:42:21,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:42:21,468 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 943 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:21,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1547 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:42:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-01-09 09:42:21,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 469. [2025-01-09 09:42:21,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 306 states have (on average 1.4803921568627452) internal successors, (453), 306 states have internal predecessors, (453), 160 states have call successors, (160), 2 states have call predecessors, (160), 2 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 09:42:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 773 transitions. [2025-01-09 09:42:21,548 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 773 transitions. Word has length 499 [2025-01-09 09:42:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:21,550 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 773 transitions. [2025-01-09 09:42:21,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 773 transitions. [2025-01-09 09:42:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 09:42:21,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:21,557 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:42:21,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2032727643, now seen corresponding path program 1 times [2025-01-09 09:42:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:21,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234118157] [2025-01-09 09:42:21,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:21,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 09:42:21,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 09:42:21,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:21,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:42:22,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:22,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234118157] [2025-01-09 09:42:22,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234118157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:22,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:22,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:42:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824466475] [2025-01-09 09:42:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:22,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:42:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:22,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:42:22,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:42:22,450 INFO L87 Difference]: Start difference. First operand 469 states and 773 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:23,249 INFO L93 Difference]: Finished difference Result 1749 states and 2853 transitions. [2025-01-09 09:42:23,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:42:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-01-09 09:42:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:23,257 INFO L225 Difference]: With dead ends: 1749 [2025-01-09 09:42:23,257 INFO L226 Difference]: Without dead ends: 1283 [2025-01-09 09:42:23,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:42:23,259 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 924 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:23,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1396 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:42:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-01-09 09:42:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 895. [2025-01-09 09:42:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 638 states have (on average 1.5203761755485894) internal successors, (970), 640 states have internal predecessors, (970), 248 states have call successors, (248), 8 states have call predecessors, (248), 8 states have return successors, (248), 246 states have call predecessors, (248), 248 states have call successors, (248) [2025-01-09 09:42:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1466 transitions. [2025-01-09 09:42:23,383 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1466 transitions. Word has length 500 [2025-01-09 09:42:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:23,386 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1466 transitions. [2025-01-09 09:42:23,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1466 transitions. [2025-01-09 09:42:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 09:42:23,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:23,394 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:23,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:42:23,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:23,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash -268094947, now seen corresponding path program 1 times [2025-01-09 09:42:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:23,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454602907] [2025-01-09 09:42:23,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:23,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 09:42:23,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 09:42:23,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:23,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:42:24,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:24,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454602907] [2025-01-09 09:42:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454602907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:42:24,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466228605] [2025-01-09 09:42:24,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:24,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:42:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:24,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:42:24,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:24,100 INFO L87 Difference]: Start difference. First operand 895 states and 1466 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:24,647 INFO L93 Difference]: Finished difference Result 2279 states and 3720 transitions. [2025-01-09 09:42:24,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:42:24,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-01-09 09:42:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:24,656 INFO L225 Difference]: With dead ends: 2279 [2025-01-09 09:42:24,656 INFO L226 Difference]: Without dead ends: 1297 [2025-01-09 09:42:24,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:42:24,659 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 545 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:24,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 779 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:42:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-01-09 09:42:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 915. [2025-01-09 09:42:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 658 states have (on average 1.513677811550152) internal successors, (996), 660 states have internal predecessors, (996), 248 states have call successors, (248), 8 states have call predecessors, (248), 8 states have return successors, (248), 246 states have call predecessors, (248), 248 states have call successors, (248) [2025-01-09 09:42:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1492 transitions. [2025-01-09 09:42:24,762 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1492 transitions. Word has length 500 [2025-01-09 09:42:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:24,762 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1492 transitions. [2025-01-09 09:42:24,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1492 transitions. [2025-01-09 09:42:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 09:42:24,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:24,767 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:24,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:42:24,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:24,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2121691043, now seen corresponding path program 1 times [2025-01-09 09:42:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:24,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926121753] [2025-01-09 09:42:24,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:24,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 09:42:24,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 09:42:24,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:24,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:42:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:25,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926121753] [2025-01-09 09:42:25,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926121753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:25,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:25,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:42:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305441831] [2025-01-09 09:42:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:42:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:25,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:42:25,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:42:25,257 INFO L87 Difference]: Start difference. First operand 915 states and 1492 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:25,764 INFO L93 Difference]: Finished difference Result 2813 states and 4585 transitions. [2025-01-09 09:42:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:42:25,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-01-09 09:42:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:25,774 INFO L225 Difference]: With dead ends: 2813 [2025-01-09 09:42:25,774 INFO L226 Difference]: Without dead ends: 1901 [2025-01-09 09:42:25,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:42:25,776 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 372 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:25,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1380 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:42:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-01-09 09:42:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1829. [2025-01-09 09:42:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1316 states have (on average 1.513677811550152) internal successors, (1992), 1320 states have internal predecessors, (1992), 496 states have call successors, (496), 16 states have call predecessors, (496), 16 states have return successors, (496), 492 states have call predecessors, (496), 496 states have call successors, (496) [2025-01-09 09:42:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2984 transitions. [2025-01-09 09:42:25,938 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2984 transitions. Word has length 500 [2025-01-09 09:42:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:25,939 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2984 transitions. [2025-01-09 09:42:25,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2984 transitions. [2025-01-09 09:42:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 09:42:25,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:25,942 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:25,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:42:25,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:25,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1162159003, now seen corresponding path program 1 times [2025-01-09 09:42:25,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:25,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484199501] [2025-01-09 09:42:25,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:25,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 09:42:26,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 09:42:26,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:26,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:42:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484199501] [2025-01-09 09:42:29,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484199501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:29,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:29,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 09:42:29,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769545098] [2025-01-09 09:42:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:29,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 09:42:29,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:29,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 09:42:29,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:42:29,449 INFO L87 Difference]: Start difference. First operand 1829 states and 2984 transitions. Second operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 states have internal predecessors, (103), 4 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-01-09 09:42:48,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:48,093 INFO L93 Difference]: Finished difference Result 24301 states and 39093 transitions. [2025-01-09 09:42:48,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 09:42:48,094 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 states have internal predecessors, (103), 4 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) Word has length 500 [2025-01-09 09:42:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:48,204 INFO L225 Difference]: With dead ends: 24301 [2025-01-09 09:42:48,204 INFO L226 Difference]: Without dead ends: 22475 [2025-01-09 09:42:48,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=625, Invalid=1631, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 09:42:48,222 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 5327 mSDsluCounter, 4270 mSDsCounter, 0 mSdLazyCounter, 3554 mSolverCounterSat, 2031 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5327 SdHoareTripleChecker+Valid, 4673 SdHoareTripleChecker+Invalid, 5585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2031 IncrementalHoareTripleChecker+Valid, 3554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:48,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5327 Valid, 4673 Invalid, 5585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2031 Valid, 3554 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2025-01-09 09:42:48,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22475 states. [2025-01-09 09:42:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22475 to 5015. [2025-01-09 09:42:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5015 states, 3966 states have (on average 1.5693393847705497) internal successors, (6224), 3990 states have internal predecessors, (6224), 1012 states have call successors, (1012), 36 states have call predecessors, (1012), 36 states have return successors, (1012), 988 states have call predecessors, (1012), 1012 states have call successors, (1012) [2025-01-09 09:42:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 8248 transitions. [2025-01-09 09:42:49,022 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 8248 transitions. Word has length 500 [2025-01-09 09:42:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:49,023 INFO L471 AbstractCegarLoop]: Abstraction has 5015 states and 8248 transitions. [2025-01-09 09:42:49,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 states have internal predecessors, (103), 4 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-01-09 09:42:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 8248 transitions. [2025-01-09 09:42:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 09:42:49,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:49,028 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:49,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:42:49,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:49,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash -426188899, now seen corresponding path program 1 times [2025-01-09 09:42:49,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:49,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198716218] [2025-01-09 09:42:49,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:49,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 09:42:49,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 09:42:49,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:49,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 36 proven. 201 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:42:49,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198716218] [2025-01-09 09:42:49,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198716218] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:42:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298800487] [2025-01-09 09:42:49,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:49,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:49,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:42:49,501 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 09:42:49,502 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 09:42:49,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 09:42:49,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 09:42:49,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:49,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:49,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 09:42:49,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:42:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 3207 proven. 33 refuted. 0 times theorem prover too weak. 9400 trivial. 0 not checked. [2025-01-09 09:42:50,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:42:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 204 proven. 33 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:42:50,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298800487] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:42:50,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:42:50,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-01-09 09:42:50,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137209853] [2025-01-09 09:42:50,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:42:50,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 09:42:50,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:50,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 09:42:50,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:42:50,371 INFO L87 Difference]: Start difference. First operand 5015 states and 8248 transitions. Second operand has 12 states, 12 states have (on average 19.416666666666668) internal successors, (233), 12 states have internal predecessors, (233), 5 states have call successors, (171), 2 states have call predecessors, (171), 4 states have return successors, (172), 5 states have call predecessors, (172), 5 states have call successors, (172) [2025-01-09 09:42:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:53,064 INFO L93 Difference]: Finished difference Result 15159 states and 24656 transitions. [2025-01-09 09:42:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 09:42:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.416666666666668) internal successors, (233), 12 states have internal predecessors, (233), 5 states have call successors, (171), 2 states have call predecessors, (171), 4 states have return successors, (172), 5 states have call predecessors, (172), 5 states have call successors, (172) Word has length 500 [2025-01-09 09:42:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:53,098 INFO L225 Difference]: With dead ends: 15159 [2025-01-09 09:42:53,098 INFO L226 Difference]: Without dead ends: 10147 [2025-01-09 09:42:53,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1033 GetRequests, 998 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=371, Invalid=961, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 09:42:53,113 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1567 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:53,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 2477 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 09:42:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10147 states. [2025-01-09 09:42:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10147 to 9793. [2025-01-09 09:42:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9793 states, 7712 states have (on average 1.5407157676348548) internal successors, (11882), 7764 states have internal predecessors, (11882), 1976 states have call successors, (1976), 104 states have call predecessors, (1976), 104 states have return successors, (1976), 1924 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-01-09 09:42:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9793 states to 9793 states and 15834 transitions. [2025-01-09 09:42:54,237 INFO L78 Accepts]: Start accepts. Automaton has 9793 states and 15834 transitions. Word has length 500 [2025-01-09 09:42:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:54,237 INFO L471 AbstractCegarLoop]: Abstraction has 9793 states and 15834 transitions. [2025-01-09 09:42:54,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.416666666666668) internal successors, (233), 12 states have internal predecessors, (233), 5 states have call successors, (171), 2 states have call predecessors, (171), 4 states have return successors, (172), 5 states have call predecessors, (172), 5 states have call successors, (172) [2025-01-09 09:42:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 9793 states and 15834 transitions. [2025-01-09 09:42:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-01-09 09:42:54,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:54,243 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:54,252 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 09:42:54,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:42:54,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -320232421, now seen corresponding path program 1 times [2025-01-09 09:42:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649610722] [2025-01-09 09:42:54,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:54,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-09 09:42:54,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-09 09:42:54,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:54,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:42:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649610722] [2025-01-09 09:42:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649610722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:54,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:54,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:42:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401011323] [2025-01-09 09:42:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:42:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:54,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:42:54,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:54,648 INFO L87 Difference]: Start difference. First operand 9793 states and 15834 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:56,295 INFO L93 Difference]: Finished difference Result 19599 states and 31677 transitions. [2025-01-09 09:42:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:42:56,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 502 [2025-01-09 09:42:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:56,342 INFO L225 Difference]: With dead ends: 19599 [2025-01-09 09:42:56,342 INFO L226 Difference]: Without dead ends: 9809 [2025-01-09 09:42:56,366 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 09:42:56,366 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 244 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:56,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 890 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:42:56,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9809 states. [2025-01-09 09:42:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9809 to 6701. [2025-01-09 09:42:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6701 states, 5630 states have (on average 1.580284191829485) internal successors, (8897), 5654 states have internal predecessors, (8897), 1012 states have call successors, (1012), 58 states have call predecessors, (1012), 58 states have return successors, (1012), 988 states have call predecessors, (1012), 1012 states have call successors, (1012) [2025-01-09 09:42:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6701 states to 6701 states and 10921 transitions. [2025-01-09 09:42:57,316 INFO L78 Accepts]: Start accepts. Automaton has 6701 states and 10921 transitions. Word has length 502 [2025-01-09 09:42:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:57,318 INFO L471 AbstractCegarLoop]: Abstraction has 6701 states and 10921 transitions. [2025-01-09 09:42:57,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:42:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6701 states and 10921 transitions. [2025-01-09 09:42:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-01-09 09:42:57,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:57,323 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:57,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:42:57,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:57,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:57,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2125670755, now seen corresponding path program 1 times [2025-01-09 09:42:57,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:57,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710078645] [2025-01-09 09:42:57,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:57,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:57,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-09 09:42:57,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-09 09:42:57,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:57,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 09:42:58,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:58,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710078645] [2025-01-09 09:42:58,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710078645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:58,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:58,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:42:58,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232678700] [2025-01-09 09:42:58,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:58,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:42:58,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:58,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:42:58,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:42:58,523 INFO L87 Difference]: Start difference. First operand 6701 states and 10921 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:43:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:04,527 INFO L93 Difference]: Finished difference Result 24630 states and 39723 transitions. [2025-01-09 09:43:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:43:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 502 [2025-01-09 09:43:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:04,604 INFO L225 Difference]: With dead ends: 24630 [2025-01-09 09:43:04,604 INFO L226 Difference]: Without dead ends: 17932 [2025-01-09 09:43:04,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-01-09 09:43:04,638 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 2461 mSDsluCounter, 4376 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 906 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2461 SdHoareTripleChecker+Valid, 4791 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 906 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:04,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2461 Valid, 4791 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [906 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 09:43:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17932 states. [2025-01-09 09:43:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17932 to 5273. [2025-01-09 09:43:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4406 states have (on average 1.5785292782569225) internal successors, (6955), 4422 states have internal predecessors, (6955), 812 states have call successors, (812), 54 states have call predecessors, (812), 54 states have return successors, (812), 796 states have call predecessors, (812), 812 states have call successors, (812) [2025-01-09 09:43:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 8579 transitions. [2025-01-09 09:43:05,327 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 8579 transitions. Word has length 502 [2025-01-09 09:43:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:05,328 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 8579 transitions. [2025-01-09 09:43:05,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 09:43:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 8579 transitions. [2025-01-09 09:43:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-01-09 09:43:05,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:05,332 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:05,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:43:05,332 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:05,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash 175151835, now seen corresponding path program 1 times [2025-01-09 09:43:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870979562] [2025-01-09 09:43:05,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:05,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-09 09:43:05,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-09 09:43:05,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:05,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 114 proven. 123 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:43:05,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:05,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870979562] [2025-01-09 09:43:05,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870979562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:43:05,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151031585] [2025-01-09 09:43:05,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:05,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:43:05,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:43:05,781 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 09:43:05,784 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 09:43:05,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-09 09:43:06,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-09 09:43:06,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:06,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:06,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:43:06,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:43:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 6387 proven. 123 refuted. 0 times theorem prover too weak. 6130 trivial. 0 not checked. [2025-01-09 09:43:06,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:43:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 114 proven. 123 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:43:07,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151031585] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:43:07,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:43:07,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-01-09 09:43:07,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540968024] [2025-01-09 09:43:07,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:43:07,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:43:07,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:07,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:43:07,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:43:07,650 INFO L87 Difference]: Start difference. First operand 5273 states and 8579 transitions. Second operand has 14 states, 14 states have (on average 19.0) internal successors, (266), 14 states have internal predecessors, (266), 6 states have call successors, (240), 3 states have call predecessors, (240), 6 states have return successors, (240), 6 states have call predecessors, (240), 6 states have call successors, (240) [2025-01-09 09:43:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:10,266 INFO L93 Difference]: Finished difference Result 14741 states and 23751 transitions. [2025-01-09 09:43:10,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 09:43:10,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.0) internal successors, (266), 14 states have internal predecessors, (266), 6 states have call successors, (240), 3 states have call predecessors, (240), 6 states have return successors, (240), 6 states have call predecessors, (240), 6 states have call successors, (240) Word has length 502 [2025-01-09 09:43:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:10,291 INFO L225 Difference]: With dead ends: 14741 [2025-01-09 09:43:10,291 INFO L226 Difference]: Without dead ends: 9471 [2025-01-09 09:43:10,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 996 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2025-01-09 09:43:10,303 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1061 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:10,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 1979 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:43:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9471 states. [2025-01-09 09:43:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9471 to 5305. [2025-01-09 09:43:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5305 states, 4430 states have (on average 1.5609480812641083) internal successors, (6915), 4446 states have internal predecessors, (6915), 812 states have call successors, (812), 62 states have call predecessors, (812), 62 states have return successors, (812), 796 states have call predecessors, (812), 812 states have call successors, (812) [2025-01-09 09:43:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5305 states to 5305 states and 8539 transitions. [2025-01-09 09:43:10,936 INFO L78 Accepts]: Start accepts. Automaton has 5305 states and 8539 transitions. Word has length 502 [2025-01-09 09:43:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:10,937 INFO L471 AbstractCegarLoop]: Abstraction has 5305 states and 8539 transitions. [2025-01-09 09:43:10,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.0) internal successors, (266), 14 states have internal predecessors, (266), 6 states have call successors, (240), 3 states have call predecessors, (240), 6 states have return successors, (240), 6 states have call predecessors, (240), 6 states have call successors, (240) [2025-01-09 09:43:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5305 states and 8539 transitions. [2025-01-09 09:43:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-01-09 09:43:10,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:10,941 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:10,952 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 09:43:11,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:43:11,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:11,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:11,144 INFO L85 PathProgramCache]: Analyzing trace with hash 43373039, now seen corresponding path program 1 times [2025-01-09 09:43:11,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:11,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480078146] [2025-01-09 09:43:11,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:11,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:11,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 09:43:11,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 09:43:11,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:11,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 120 proven. 117 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:43:11,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:43:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480078146] [2025-01-09 09:43:11,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480078146] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:43:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309591040] [2025-01-09 09:43:11,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:11,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:43:11,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:43:11,602 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 09:43:11,606 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 09:43:11,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 09:43:11,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 09:43:11,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:11,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:11,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 09:43:11,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:43:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 7031 proven. 354 refuted. 0 times theorem prover too weak. 5255 trivial. 0 not checked. [2025-01-09 09:43:13,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:43:14,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 120 proven. 117 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-01-09 09:43:14,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309591040] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:43:14,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:43:14,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 6] total 21 [2025-01-09 09:43:14,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676932021] [2025-01-09 09:43:14,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:43:14,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 09:43:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:43:14,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 09:43:14,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-01-09 09:43:14,084 INFO L87 Difference]: Start difference. First operand 5305 states and 8539 transitions. Second operand has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 20 states have internal predecessors, (212), 8 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (178), 8 states have call predecessors, (178), 8 states have call successors, (178) [2025-01-09 09:43:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:43:17,549 INFO L93 Difference]: Finished difference Result 13257 states and 20929 transitions. [2025-01-09 09:43:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 09:43:17,550 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 20 states have internal predecessors, (212), 8 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (178), 8 states have call predecessors, (178), 8 states have call successors, (178) Word has length 503 [2025-01-09 09:43:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:43:17,574 INFO L225 Difference]: With dead ends: 13257 [2025-01-09 09:43:17,574 INFO L226 Difference]: Without dead ends: 7955 [2025-01-09 09:43:17,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 999 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=835, Invalid=2357, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 09:43:17,585 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 1752 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:43:17,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1950 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 09:43:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7955 states. [2025-01-09 09:43:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7955 to 4749. [2025-01-09 09:43:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4749 states, 3842 states have (on average 1.5104112441436752) internal successors, (5803), 3858 states have internal predecessors, (5803), 812 states have call successors, (812), 94 states have call predecessors, (812), 94 states have return successors, (812), 796 states have call predecessors, (812), 812 states have call successors, (812) [2025-01-09 09:43:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 7427 transitions. [2025-01-09 09:43:18,328 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 7427 transitions. Word has length 503 [2025-01-09 09:43:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:43:18,329 INFO L471 AbstractCegarLoop]: Abstraction has 4749 states and 7427 transitions. [2025-01-09 09:43:18,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.095238095238095) internal successors, (212), 20 states have internal predecessors, (212), 8 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (178), 8 states have call predecessors, (178), 8 states have call successors, (178) [2025-01-09 09:43:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 7427 transitions. [2025-01-09 09:43:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-01-09 09:43:18,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:43:18,335 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:43:18,343 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 09:43:18,538 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 09:43:18,539 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:43:18,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:43:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1888222003, now seen corresponding path program 1 times [2025-01-09 09:43:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:43:18,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094418752] [2025-01-09 09:43:18,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:43:18,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:43:18,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:43:18,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:18,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:43:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770687022] [2025-01-09 09:43:18,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:43:18,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:43:18,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:43:18,883 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 09:43:18,885 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 09:43:19,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-01-09 09:43:19,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-01-09 09:43:19,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:43:19,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:43:19,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-01-09 09:43:19,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:43:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 9635 proven. 951 refuted. 0 times theorem prover too weak. 2054 trivial. 0 not checked. [2025-01-09 09:43:29,154 INFO L312 TraceCheckSpWp]: Computing backward predicates...