./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.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_variablewrapping_wrapper-sp_file-24.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 eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:07:56,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:07:56,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:07:56,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:07:56,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:07:56,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:07:56,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:07:56,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:07:56,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:07:56,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:07:56,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:07:56,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:07:56,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:07:56,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:07:56,859 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:07:56,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:07:56,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:07:56,860 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:07:56,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:07:56,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:07:56,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:07:56,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:07:56,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:07:56,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:07:56,860 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:07:56,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:07:56,861 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:07:56,861 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:07:56,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:07:56,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:07:56,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:07:56,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:07:56,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:56,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:07:56,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:07:56,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:07:56,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:07:56,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:56,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:07:56,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:07:56,862 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:07:56,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:07:56,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:07:56,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:07:56,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:07:56,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:07:56,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:07:56,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:07:56,864 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 -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2025-01-09 16:07:57,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:07:57,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:07:57,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:07:57,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:07:57,190 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:07:57,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2025-01-09 16:07:58,489 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/debe0e4f8/45e0690070444f95a680a8863eb29083/FLAGe9c0c6aca [2025-01-09 16:07:58,758 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:07:58,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2025-01-09 16:07:58,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/debe0e4f8/45e0690070444f95a680a8863eb29083/FLAGe9c0c6aca [2025-01-09 16:07:58,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/debe0e4f8/45e0690070444f95a680a8863eb29083 [2025-01-09 16:07:58,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:07:58,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:07:58,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:07:58,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:07:58,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:07:58,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:07:58" (1/1) ... [2025-01-09 16:07:58,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f532e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:58, skipping insertion in model container [2025-01-09 16:07:58,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:07:58" (1/1) ... [2025-01-09 16:07:58,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:07:58,958 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_variablewrapping_wrapper-sp_file-24.i[917,930] [2025-01-09 16:07:59,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:07:59,020 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:07:59,030 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_variablewrapping_wrapper-sp_file-24.i[917,930] [2025-01-09 16:07:59,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:07:59,099 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:07:59,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59 WrapperNode [2025-01-09 16:07:59,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:07:59,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:07:59,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:07:59,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:07:59,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,177 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2025-01-09 16:07:59,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:07:59,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:07:59,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:07:59,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:07:59,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,204 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:07:59,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:07:59,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:07:59,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:07:59,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:07:59,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (1/1) ... [2025-01-09 16:07:59,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:59,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:07:59,288 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 16:07:59,291 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 16:07:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:07:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:07:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:07:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:07:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:07:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:07:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:07:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:07:59,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:07:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:07:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:07:59,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:07:59,438 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:07:59,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:08:00,041 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-01-09 16:08:00,041 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:08:00,055 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:08:00,055 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:08:00,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:00 BoogieIcfgContainer [2025-01-09 16:08:00,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:08:00,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:08:00,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:08:00,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:08:00,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:07:58" (1/3) ... [2025-01-09 16:08:00,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fd415d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:00, skipping insertion in model container [2025-01-09 16:08:00,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:59" (2/3) ... [2025-01-09 16:08:00,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fd415d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:08:00, skipping insertion in model container [2025-01-09 16:08:00,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:08:00" (3/3) ... [2025-01-09 16:08:00,069 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2025-01-09 16:08:00,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:08:00,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-24.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:08:00,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:08:00,159 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;@3903f845, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:08:00,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:08:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:08:00,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:00,177 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:00,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:00,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1651162084, now seen corresponding path program 1 times [2025-01-09 16:08:00,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:00,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552463496] [2025-01-09 16:08:00,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:00,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:08:00,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:08:00,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:00,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 16:08:00,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:00,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552463496] [2025-01-09 16:08:00,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552463496] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:00,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324598848] [2025-01-09 16:08:00,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:00,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:00,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:00,614 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 16:08:00,616 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 16:08:00,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:08:00,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:08:00,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:00,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:00,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:08:00,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 16:08:00,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:00,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324598848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:00,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:08:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:08:00,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838737997] [2025-01-09 16:08:00,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:08:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:00,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:08:00,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:08:00,931 INFO L87 Difference]: Start difference. First operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 16:08:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:00,965 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2025-01-09 16:08:00,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:08:00,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-01-09 16:08:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:00,974 INFO L225 Difference]: With dead ends: 194 [2025-01-09 16:08:00,975 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 16:08:00,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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 16:08:00,980 INFO L435 NwaCegarLoop]: 139 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, 139 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 16:08:00,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 16:08:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 16:08:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-01-09 16:08:01,012 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2025-01-09 16:08:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:01,013 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-01-09 16:08:01,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 16:08:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-01-09 16:08:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:08:01,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:01,020 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:01,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:08:01,220 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 16:08:01,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:01,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:01,221 INFO L85 PathProgramCache]: Analyzing trace with hash 325787070, now seen corresponding path program 1 times [2025-01-09 16:08:01,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:01,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701826111] [2025-01-09 16:08:01,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:01,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:01,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:08:01,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:08:01,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:01,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:01,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:01,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701826111] [2025-01-09 16:08:01,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701826111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:01,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:01,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088695846] [2025-01-09 16:08:01,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:01,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:01,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:01,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:01,554 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:01,594 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-01-09 16:08:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:01,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 16:08:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:01,597 INFO L225 Difference]: With dead ends: 192 [2025-01-09 16:08:01,597 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 16:08:01,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:01,599 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:01,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 16:08:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 16:08:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-01-09 16:08:01,609 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2025-01-09 16:08:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:01,613 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-01-09 16:08:01,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-01-09 16:08:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:08:01,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:01,618 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:01,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:08:01,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:01,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1479651264, now seen corresponding path program 1 times [2025-01-09 16:08:01,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:01,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677449040] [2025-01-09 16:08:01,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:01,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:01,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:08:01,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:08:01,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:01,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:01,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677449040] [2025-01-09 16:08:01,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677449040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:01,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:01,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:08:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314384353] [2025-01-09 16:08:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:01,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:08:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:01,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:08:01,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:01,813 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:01,836 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2025-01-09 16:08:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:08:01,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 16:08:01,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:01,843 INFO L225 Difference]: With dead ends: 194 [2025-01-09 16:08:01,843 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 16:08:01,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:08:01,845 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:01,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 16:08:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 16:08:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-01-09 16:08:01,857 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2025-01-09 16:08:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:01,857 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-01-09 16:08:01,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-01-09 16:08:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:08:01,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:01,859 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:01,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:08:01,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:01,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1794247678, now seen corresponding path program 1 times [2025-01-09 16:08:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:01,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937002269] [2025-01-09 16:08:01,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:01,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:08:01,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:08:01,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:01,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:02,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937002269] [2025-01-09 16:08:02,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937002269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:02,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:02,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:08:02,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859172175] [2025-01-09 16:08:02,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:08:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:02,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:08:02,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:02,098 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:02,142 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2025-01-09 16:08:02,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:08:02,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 16:08:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:02,145 INFO L225 Difference]: With dead ends: 198 [2025-01-09 16:08:02,146 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 16:08:02,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:02,148 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:02,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 16:08:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-01-09 16:08:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-01-09 16:08:02,165 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2025-01-09 16:08:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:02,166 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-01-09 16:08:02,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-01-09 16:08:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:08:02,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:02,171 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:02,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:08:02,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:02,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1820661248, now seen corresponding path program 1 times [2025-01-09 16:08:02,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:02,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159957108] [2025-01-09 16:08:02,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:02,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:08:02,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:08:02,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:02,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159957108] [2025-01-09 16:08:02,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159957108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:02,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:02,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:08:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635662451] [2025-01-09 16:08:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:02,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:08:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:02,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:08:02,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:02,408 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:02,435 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2025-01-09 16:08:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:08:02,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 16:08:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:02,439 INFO L225 Difference]: With dead ends: 202 [2025-01-09 16:08:02,439 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 16:08:02,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:08:02,440 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:02,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 16:08:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-01-09 16:08:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2025-01-09 16:08:02,453 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2025-01-09 16:08:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2025-01-09 16:08:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2025-01-09 16:08:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 16:08:02,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:02,456 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:02,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:08:02,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:02,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1818814206, now seen corresponding path program 1 times [2025-01-09 16:08:02,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:02,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273017664] [2025-01-09 16:08:02,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:02,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:02,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 16:08:02,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 16:08:02,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:02,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:03,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273017664] [2025-01-09 16:08:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273017664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:03,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:03,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:08:03,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054716969] [2025-01-09 16:08:03,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:08:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:03,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:08:03,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:08:03,071 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:03,434 INFO L93 Difference]: Finished difference Result 253 states and 356 transitions. [2025-01-09 16:08:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:08:03,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-01-09 16:08:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:03,436 INFO L225 Difference]: With dead ends: 253 [2025-01-09 16:08:03,436 INFO L226 Difference]: Without dead ends: 153 [2025-01-09 16:08:03,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:08:03,438 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:03,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 420 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:08:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-09 16:08:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 112. [2025-01-09 16:08:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 95 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2025-01-09 16:08:03,452 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 124 [2025-01-09 16:08:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:03,453 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2025-01-09 16:08:03,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2025-01-09 16:08:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 16:08:03,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:03,456 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:03,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:08:03,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash -541689522, now seen corresponding path program 1 times [2025-01-09 16:08:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619225613] [2025-01-09 16:08:03,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:03,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:08:03,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:08:03,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:03,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:04,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:04,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619225613] [2025-01-09 16:08:04,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619225613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:04,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:04,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:08:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678178461] [2025-01-09 16:08:04,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:04,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:08:04,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:04,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:08:04,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:08:04,267 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:04,819 INFO L93 Difference]: Finished difference Result 275 states and 388 transitions. [2025-01-09 16:08:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:04,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-01-09 16:08:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:04,822 INFO L225 Difference]: With dead ends: 275 [2025-01-09 16:08:04,823 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 16:08:04,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:08:04,824 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 304 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:04,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 394 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:08:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 16:08:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2025-01-09 16:08:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 108 states have (on average 1.3611111111111112) internal successors, (147), 108 states have internal predecessors, (147), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2025-01-09 16:08:04,839 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 125 [2025-01-09 16:08:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:04,840 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2025-01-09 16:08:04,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2025-01-09 16:08:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 16:08:04,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:04,841 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:04,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:08:04,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:04,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash -675703028, now seen corresponding path program 1 times [2025-01-09 16:08:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054734112] [2025-01-09 16:08:04,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:04,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 16:08:04,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 16:08:04,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:04,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054734112] [2025-01-09 16:08:05,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054734112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:05,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:08:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451617008] [2025-01-09 16:08:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:05,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:08:05,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:05,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:08:05,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:08:05,223 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:05,361 INFO L93 Difference]: Finished difference Result 249 states and 353 transitions. [2025-01-09 16:08:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:08:05,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-01-09 16:08:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:05,363 INFO L225 Difference]: With dead ends: 249 [2025-01-09 16:08:05,363 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 16:08:05,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:08:05,364 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:05,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 345 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:08:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 16:08:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-01-09 16:08:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 108 states have internal predecessors, (146), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2025-01-09 16:08:05,373 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 176 transitions. Word has length 125 [2025-01-09 16:08:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:05,373 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 176 transitions. [2025-01-09 16:08:05,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2025-01-09 16:08:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 16:08:05,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:05,374 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:05,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:08:05,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:05,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1459180417, now seen corresponding path program 1 times [2025-01-09 16:08:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394103328] [2025-01-09 16:08:05,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:05,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:05,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 16:08:05,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 16:08:05,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:05,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:05,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:05,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394103328] [2025-01-09 16:08:05,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394103328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:05,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:05,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:08:05,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304455441] [2025-01-09 16:08:05,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:05,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:08:05,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:05,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:08:05,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:08:05,943 INFO L87 Difference]: Start difference. First operand 125 states and 176 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:06,266 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2025-01-09 16:08:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:08:06,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-01-09 16:08:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:06,268 INFO L225 Difference]: With dead ends: 290 [2025-01-09 16:08:06,268 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 16:08:06,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:08:06,269 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 235 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:06,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 305 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:08:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 16:08:06,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 127. [2025-01-09 16:08:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 110 states have internal predecessors, (147), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2025-01-09 16:08:06,281 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 126 [2025-01-09 16:08:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:06,281 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2025-01-09 16:08:06,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2025-01-09 16:08:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 16:08:06,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:06,283 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:08:06,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:06,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash 841642173, now seen corresponding path program 1 times [2025-01-09 16:08:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:06,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514450549] [2025-01-09 16:08:06,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:06,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:06,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 16:08:06,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 16:08:06,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:06,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:06,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514450549] [2025-01-09 16:08:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514450549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:06,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:08:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489711017] [2025-01-09 16:08:06,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:08:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:06,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:08:06,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:08:06,587 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:06,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:06,729 INFO L93 Difference]: Finished difference Result 289 states and 402 transitions. [2025-01-09 16:08:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:08:06,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-01-09 16:08:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:06,731 INFO L225 Difference]: With dead ends: 289 [2025-01-09 16:08:06,732 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 16:08:06,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:08:06,733 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 99 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:06,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 311 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:08:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 16:08:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 128. [2025-01-09 16:08:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 111 states have internal predecessors, (148), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 178 transitions. [2025-01-09 16:08:06,743 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 178 transitions. Word has length 126 [2025-01-09 16:08:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:06,744 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 178 transitions. [2025-01-09 16:08:06,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 178 transitions. [2025-01-09 16:08:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 16:08:06,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:06,746 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:06,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:08:06,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:06,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1774640039, now seen corresponding path program 1 times [2025-01-09 16:08:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490476116] [2025-01-09 16:08:06,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:06,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 16:08:06,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 16:08:06,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:06,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:07,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490476116] [2025-01-09 16:08:07,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490476116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:07,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:07,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:08:07,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492195877] [2025-01-09 16:08:07,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:07,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:08:07,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:07,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:08:07,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:08:07,405 INFO L87 Difference]: Start difference. First operand 128 states and 178 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:07,725 INFO L93 Difference]: Finished difference Result 300 states and 417 transitions. [2025-01-09 16:08:07,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:08:07,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-01-09 16:08:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:07,727 INFO L225 Difference]: With dead ends: 300 [2025-01-09 16:08:07,728 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 16:08:07,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:08:07,728 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 206 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:07,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 425 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:08:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 16:08:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2025-01-09 16:08:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 115 states have internal predecessors, (154), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2025-01-09 16:08:07,739 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 126 [2025-01-09 16:08:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:07,739 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2025-01-09 16:08:07,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2025-01-09 16:08:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 16:08:07,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:07,741 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:07,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:08:07,741 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:07,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1791961547, now seen corresponding path program 1 times [2025-01-09 16:08:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168014492] [2025-01-09 16:08:07,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:07,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 16:08:07,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 16:08:07,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:07,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:08,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168014492] [2025-01-09 16:08:08,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168014492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:08,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:08,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:08:08,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491611788] [2025-01-09 16:08:08,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:08,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:08:08,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:08,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:08:08,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:08:08,849 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:09,414 INFO L93 Difference]: Finished difference Result 311 states and 432 transitions. [2025-01-09 16:08:09,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:09,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-01-09 16:08:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:09,418 INFO L225 Difference]: With dead ends: 311 [2025-01-09 16:08:09,419 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 16:08:09,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:08:09,420 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 152 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:09,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 607 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:08:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 16:08:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 141. [2025-01-09 16:08:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2025-01-09 16:08:09,438 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 127 [2025-01-09 16:08:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:09,438 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2025-01-09 16:08:09,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2025-01-09 16:08:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 16:08:09,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:09,440 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:09,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:08:09,440 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:09,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash 730814707, now seen corresponding path program 1 times [2025-01-09 16:08:09,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:09,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190457783] [2025-01-09 16:08:09,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:09,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 16:08:09,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 16:08:09,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:09,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190457783] [2025-01-09 16:08:10,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190457783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:10,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:10,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:08:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703316321] [2025-01-09 16:08:10,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:10,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:08:10,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:10,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:08:10,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:08:10,126 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:10,623 INFO L93 Difference]: Finished difference Result 324 states and 449 transitions. [2025-01-09 16:08:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:08:10,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-01-09 16:08:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:10,625 INFO L225 Difference]: With dead ends: 324 [2025-01-09 16:08:10,625 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 16:08:10,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:08:10,629 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 293 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:10,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 387 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:08:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 16:08:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 143. [2025-01-09 16:08:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 126 states have (on average 1.3412698412698412) internal successors, (169), 126 states have internal predecessors, (169), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 199 transitions. [2025-01-09 16:08:10,645 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 199 transitions. Word has length 127 [2025-01-09 16:08:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:10,646 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 199 transitions. [2025-01-09 16:08:10,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 199 transitions. [2025-01-09 16:08:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 16:08:10,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:10,648 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:10,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:08:10,648 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:10,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -850634319, now seen corresponding path program 1 times [2025-01-09 16:08:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:10,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022292530] [2025-01-09 16:08:10,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:10,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:08:10,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:08:10,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:10,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 16:08:10,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:10,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022292530] [2025-01-09 16:08:10,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022292530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:10,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432089874] [2025-01-09 16:08:10,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:10,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:10,836 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 16:08:10,838 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 16:08:11,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:08:11,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:08:11,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:11,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:11,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:08:11,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:11,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432089874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:08:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 16:08:11,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816719527] [2025-01-09 16:08:11,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:11,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:08:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:11,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:08:11,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:08:11,199 INFO L87 Difference]: Start difference. First operand 143 states and 199 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:11,239 INFO L93 Difference]: Finished difference Result 286 states and 399 transitions. [2025-01-09 16:08:11,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:08:11,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-01-09 16:08:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:11,240 INFO L225 Difference]: With dead ends: 286 [2025-01-09 16:08:11,240 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 16:08:11,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:08:11,241 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:11,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 16:08:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-01-09 16:08:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 129 states have internal predecessors, (172), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 202 transitions. [2025-01-09 16:08:11,259 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 202 transitions. Word has length 128 [2025-01-09 16:08:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:11,259 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 202 transitions. [2025-01-09 16:08:11,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 202 transitions. [2025-01-09 16:08:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 16:08:11,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:11,261 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:11,271 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 16:08:11,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:11,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:11,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1303356956, now seen corresponding path program 1 times [2025-01-09 16:08:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:11,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535384962] [2025-01-09 16:08:11,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:11,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 16:08:11,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 16:08:11,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:11,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:08:12,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:12,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535384962] [2025-01-09 16:08:12,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535384962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:12,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:12,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:08:12,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022616737] [2025-01-09 16:08:12,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:12,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:08:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:12,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:08:12,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:08:12,104 INFO L87 Difference]: Start difference. First operand 146 states and 202 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:12,479 INFO L93 Difference]: Finished difference Result 331 states and 455 transitions. [2025-01-09 16:08:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:08:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-01-09 16:08:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:12,482 INFO L225 Difference]: With dead ends: 331 [2025-01-09 16:08:12,482 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 16:08:12,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:08:12,485 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 159 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:12,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 383 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:08:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 16:08:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 142. [2025-01-09 16:08:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 125 states have (on average 1.328) internal successors, (166), 125 states have internal predecessors, (166), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:08:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2025-01-09 16:08:12,498 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 128 [2025-01-09 16:08:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:12,500 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2025-01-09 16:08:12,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 16:08:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2025-01-09 16:08:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 16:08:12,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:12,503 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:12,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:08:12,503 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:12,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 602846256, now seen corresponding path program 1 times [2025-01-09 16:08:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903244144] [2025-01-09 16:08:12,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:12,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:12,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 16:08:12,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 16:08:12,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:12,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 16:08:15,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903244144] [2025-01-09 16:08:15,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903244144] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134474147] [2025-01-09 16:08:15,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:15,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:15,603 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 16:08:15,606 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 16:08:15,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 16:08:15,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 16:08:15,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:15,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:16,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-09 16:08:16,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:17,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:08:18,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 16:08:18,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 16:08:19,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 16:08:19,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 16:08:20,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 16:08:20,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:20,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:20,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 16:08:20,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:20,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:20,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,013 INFO L349 Elim1Store]: treesize reduction 148, result has 28.8 percent of original size [2025-01-09 16:08:21,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 303 treesize of output 326 [2025-01-09 16:08:21,185 INFO L349 Elim1Store]: treesize reduction 33, result has 35.3 percent of original size [2025-01-09 16:08:21,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 114 [2025-01-09 16:08:21,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2025-01-09 16:08:21,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,290 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 16:08:21,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 59 [2025-01-09 16:08:21,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 73 [2025-01-09 16:08:21,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2025-01-09 16:08:21,432 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-01-09 16:08:21,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 254 treesize of output 231 [2025-01-09 16:08:21,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:08:21,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 199 [2025-01-09 16:08:21,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-01-09 16:08:21,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-01-09 16:08:21,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-01-09 16:08:21,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:21,919 INFO L349 Elim1Store]: treesize reduction 334, result has 0.3 percent of original size [2025-01-09 16:08:21,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 220 [2025-01-09 16:08:22,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:22,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:22,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:08:22,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2025-01-09 16:08:22,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2025-01-09 16:08:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 242 proven. 95 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-09 16:08:22,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:08:26,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1844 Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1844)))) (< (+ 22924 (mod (select (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset) 256)) (+ (mod (select (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset) 65536) (select (select .cse0 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset))))) is different from false [2025-01-09 16:09:10,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134474147] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:09:10,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:09:10,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2025-01-09 16:09:10,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236182920] [2025-01-09 16:09:10,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:09:10,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:09:10,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:10,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:09:10,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=834, Unknown=7, NotChecked=60, Total=1056 [2025-01-09 16:09:10,446 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 28 states, 25 states have (on average 4.48) internal successors, (112), 28 states have internal predecessors, (112), 11 states have call successors, (30), 5 states have call predecessors, (30), 8 states have return successors, (30), 8 states have call predecessors, (30), 11 states have call successors, (30) [2025-01-09 16:09:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:18,181 INFO L93 Difference]: Finished difference Result 390 states and 519 transitions. [2025-01-09 16:09:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 16:09:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 4.48) internal successors, (112), 28 states have internal predecessors, (112), 11 states have call successors, (30), 5 states have call predecessors, (30), 8 states have return successors, (30), 8 states have call predecessors, (30), 11 states have call successors, (30) Word has length 129 [2025-01-09 16:09:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:18,184 INFO L225 Difference]: With dead ends: 390 [2025-01-09 16:09:18,184 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 16:09:18,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=632, Invalid=2335, Unknown=7, NotChecked=106, Total=3080 [2025-01-09 16:09:18,186 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 923 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:18,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 677 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 16:09:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 16:09:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 241. [2025-01-09 16:09:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 206 states have (on average 1.2621359223300972) internal successors, (260), 208 states have internal predecessors, (260), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 314 transitions. [2025-01-09 16:09:18,216 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 314 transitions. Word has length 129 [2025-01-09 16:09:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:18,217 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 314 transitions. [2025-01-09 16:09:18,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 4.48) internal successors, (112), 28 states have internal predecessors, (112), 11 states have call successors, (30), 5 states have call predecessors, (30), 8 states have return successors, (30), 8 states have call predecessors, (30), 11 states have call successors, (30) [2025-01-09 16:09:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 314 transitions. [2025-01-09 16:09:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 16:09:18,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:18,218 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:18,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:09:18,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:09:18,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:18,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1025548082, now seen corresponding path program 1 times [2025-01-09 16:09:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:18,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641910231] [2025-01-09 16:09:18,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:18,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:18,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 16:09:18,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 16:09:18,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:18,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 16:09:20,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:20,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641910231] [2025-01-09 16:09:20,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641910231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:20,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:20,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:09:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45592674] [2025-01-09 16:09:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:20,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:09:20,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:20,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:09:20,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:09:20,621 INFO L87 Difference]: Start difference. First operand 241 states and 314 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 16:09:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:22,252 INFO L93 Difference]: Finished difference Result 559 states and 728 transitions. [2025-01-09 16:09:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:09:22,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-01-09 16:09:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:22,255 INFO L225 Difference]: With dead ends: 559 [2025-01-09 16:09:22,256 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 16:09:22,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:09:22,257 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 213 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:22,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 560 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 16:09:22,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 16:09:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 248. [2025-01-09 16:09:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.2582159624413145) internal successors, (268), 215 states have internal predecessors, (268), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 16:09:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2025-01-09 16:09:22,292 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 129 [2025-01-09 16:09:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:22,293 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2025-01-09 16:09:22,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 16:09:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2025-01-09 16:09:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 16:09:22,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:22,295 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:22,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:09:22,295 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:22,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash -566892668, now seen corresponding path program 1 times [2025-01-09 16:09:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:22,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114636809] [2025-01-09 16:09:22,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:22,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:22,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 16:09:22,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 16:09:22,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:22,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat