./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:38:48,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:38:48,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:38:48,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:38:48,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:38:48,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:38:48,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:38:48,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:38:48,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:38:48,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:38:48,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:38:48,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:38:48,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:38:48,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:38:48,354 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:38:48,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:38:48,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:38:48,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:38:48,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:38:48,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:38:48,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:38:48,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:38:48,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:38:48,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:38:48,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:38:48,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:38:48,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:38:48,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:38:48,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:38:48,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:38:48,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:38:48,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:38:48,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:38:48,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:38:48,357 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/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 -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2025-03-04 01:38:48,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:38:48,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:38:48,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:38:48,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:38:48,590 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:38:48,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2025-03-04 01:38:49,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87bf4225/95a0316f7a44451ca7914092809211dd/FLAG8d832cec3 [2025-03-04 01:38:49,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:38:49,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2025-03-04 01:38:49,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87bf4225/95a0316f7a44451ca7914092809211dd/FLAG8d832cec3 [2025-03-04 01:38:49,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87bf4225/95a0316f7a44451ca7914092809211dd [2025-03-04 01:38:49,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:38:49,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:38:49,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:38:49,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:38:49,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:38:49,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:38:49" (1/1) ... [2025-03-04 01:38:49,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:49, skipping insertion in model container [2025-03-04 01:38:49,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:38:49" (1/1) ... [2025-03-04 01:38:49,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:38:49,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2025-03-04 01:38:50,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:38:50,047 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:38:50,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2025-03-04 01:38:50,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:38:50,103 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:38:50,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50 WrapperNode [2025-03-04 01:38:50,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:38:50,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:38:50,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:38:50,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:38:50,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,159 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2025-03-04 01:38:50,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:38:50,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:38:50,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:38:50,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:38:50,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,183 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:38:50,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,197 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:38:50,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:38:50,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:38:50,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:38:50,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (1/1) ... [2025-03-04 01:38:50,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:38:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:38:50,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:38:50,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:38:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:38:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:38:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:38:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:38:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:38:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:38:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:38:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:38:50,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:38:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:38:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:38:50,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:38:50,313 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:38:50,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:38:50,785 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~ite81#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~short89#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~ite110#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short118#1; [2025-03-04 01:38:50,821 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-04 01:38:50,821 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:38:50,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:38:50,831 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:38:50,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:38:50 BoogieIcfgContainer [2025-03-04 01:38:50,832 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:38:50,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:38:50,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:38:50,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:38:50,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:38:49" (1/3) ... [2025-03-04 01:38:50,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b71186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:38:50, skipping insertion in model container [2025-03-04 01:38:50,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:38:50" (2/3) ... [2025-03-04 01:38:50,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b71186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:38:50, skipping insertion in model container [2025-03-04 01:38:50,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:38:50" (3/3) ... [2025-03-04 01:38:50,839 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2025-03-04 01:38:50,849 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:38:50,850 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-34.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:38:50,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:38:50,894 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;@51c9e33c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:38:50,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:38:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:38:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 01:38:50,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:50,905 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:50,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1856502944, now seen corresponding path program 1 times [2025-03-04 01:38:50,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425271986] [2025-03-04 01:38:50,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:51,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:38:51,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:38:51,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:51,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 01:38:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425271986] [2025-03-04 01:38:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425271986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:38:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055236318] [2025-03-04 01:38:51,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:51,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:38:51,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:38:51,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:38:51,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:38:51,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:38:51,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:38:51,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:51,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:51,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:38:51,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 01:38:51,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:51,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055236318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:51,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:38:51,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:38:51,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962864379] [2025-03-04 01:38:51,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:51,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:38:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:51,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:38:51,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:38:51,474 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:38:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:51,492 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2025-03-04 01:38:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:38:51,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-03-04 01:38:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:51,497 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:38:51,497 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:38:51,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-03-04 01:38:51,501 INFO L435 NwaCegarLoop]: 168 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, 168 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-03-04 01:38:51,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:38:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:38:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:38:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:38:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-03-04 01:38:51,529 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2025-03-04 01:38:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:51,530 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-03-04 01:38:51,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:38:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-03-04 01:38:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 01:38:51,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:51,536 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:51,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:38:51,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:38:51,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:51,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash 684919535, now seen corresponding path program 1 times [2025-03-04 01:38:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716751759] [2025-03-04 01:38:51,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:51,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:38:51,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:38:51,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:51,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:38:52,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:52,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716751759] [2025-03-04 01:38:52,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716751759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:38:52,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521878134] [2025-03-04 01:38:52,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:52,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:38:52,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:38:52,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:38:52,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:38:52,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:38:52,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:38:52,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:52,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:52,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:38:52,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:38:52,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:52,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521878134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:52,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:38:52,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:38:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066022708] [2025-03-04 01:38:52,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:52,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:38:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:52,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:38:52,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:38:52,412 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:52,442 INFO L93 Difference]: Finished difference Result 231 states and 336 transitions. [2025-03-04 01:38:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:38:52,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2025-03-04 01:38:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:52,448 INFO L225 Difference]: With dead ends: 231 [2025-03-04 01:38:52,448 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 01:38:52,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:38:52,449 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:52,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:38:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 01:38:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 01:38:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:38:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2025-03-04 01:38:52,461 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 171 [2025-03-04 01:38:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:52,465 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2025-03-04 01:38:52,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2025-03-04 01:38:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 01:38:52,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:52,466 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:52,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:38:52,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 01:38:52,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:52,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash -64537397, now seen corresponding path program 1 times [2025-03-04 01:38:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:52,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031785658] [2025-03-04 01:38:52,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:52,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:52,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 01:38:52,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 01:38:52,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:52,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:38:52,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:52,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031785658] [2025-03-04 01:38:52,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031785658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:52,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:52,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:38:52,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187517275] [2025-03-04 01:38:52,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:52,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:38:52,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:52,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:38:52,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:38:52,802 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:52,831 INFO L93 Difference]: Finished difference Result 282 states and 408 transitions. [2025-03-04 01:38:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:38:52,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2025-03-04 01:38:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:52,833 INFO L225 Difference]: With dead ends: 282 [2025-03-04 01:38:52,833 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 01:38:52,834 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-03-04 01:38:52,834 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:52,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:38:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 01:38:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 136. [2025-03-04 01:38:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:38:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2025-03-04 01:38:52,849 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 173 [2025-03-04 01:38:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:52,850 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2025-03-04 01:38:52,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2025-03-04 01:38:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:38:52,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:52,854 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:52,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:38:52,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:52,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash 775459130, now seen corresponding path program 1 times [2025-03-04 01:38:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:52,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996404932] [2025-03-04 01:38:52,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:52,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:38:52,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:38:52,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:52,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:38:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996404932] [2025-03-04 01:38:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996404932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:38:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256505246] [2025-03-04 01:38:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:38:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:52,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:38:52,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:38:52,971 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:53,056 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2025-03-04 01:38:53,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:38:53,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-04 01:38:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:53,058 INFO L225 Difference]: With dead ends: 297 [2025-03-04 01:38:53,058 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 01:38:53,059 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-03-04 01:38:53,059 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 61 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:53,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 380 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:38:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 01:38:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 136. [2025-03-04 01:38:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 111 states have internal predecessors, (148), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:38:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2025-03-04 01:38:53,072 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 176 [2025-03-04 01:38:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:53,073 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2025-03-04 01:38:53,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2025-03-04 01:38:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:38:53,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:53,075 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:53,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:38:53,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:53,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1679505017, now seen corresponding path program 1 times [2025-03-04 01:38:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130008569] [2025-03-04 01:38:53,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:53,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:38:53,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:38:53,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:38:54,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:54,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130008569] [2025-03-04 01:38:54,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130008569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:54,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:54,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:38:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467266320] [2025-03-04 01:38:54,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:54,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:38:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:54,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:38:54,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:38:54,517 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:54,721 INFO L93 Difference]: Finished difference Result 400 states and 574 transitions. [2025-03-04 01:38:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:38:54,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2025-03-04 01:38:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:54,724 INFO L225 Difference]: With dead ends: 400 [2025-03-04 01:38:54,724 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 01:38:54,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:38:54,725 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 98 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:54,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 412 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:38:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 01:38:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2025-03-04 01:38:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 216 states have internal predecessors, (286), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:38:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 378 transitions. [2025-03-04 01:38:54,746 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 378 transitions. Word has length 176 [2025-03-04 01:38:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:54,747 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 378 transitions. [2025-03-04 01:38:54,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 378 transitions. [2025-03-04 01:38:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 01:38:54,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:54,748 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:54,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:38:54,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:54,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1653848262, now seen corresponding path program 1 times [2025-03-04 01:38:54,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:54,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58266687] [2025-03-04 01:38:54,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:54,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 01:38:54,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 01:38:54,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:54,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:38:55,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:55,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58266687] [2025-03-04 01:38:55,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58266687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:55,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:55,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:38:55,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171296341] [2025-03-04 01:38:55,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:55,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:38:55,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:55,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:38:55,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:55,263 INFO L87 Difference]: Start difference. First operand 265 states and 378 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:38:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:55,616 INFO L93 Difference]: Finished difference Result 396 states and 565 transitions. [2025-03-04 01:38:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:38:55,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2025-03-04 01:38:55,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:55,619 INFO L225 Difference]: With dead ends: 396 [2025-03-04 01:38:55,619 INFO L226 Difference]: Without dead ends: 261 [2025-03-04 01:38:55,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:38:55,620 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 189 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:55,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 244 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:38:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-04 01:38:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 132. [2025-03-04 01:38:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.308411214953271) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:38:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 186 transitions. [2025-03-04 01:38:55,630 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 186 transitions. Word has length 176 [2025-03-04 01:38:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:55,630 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 186 transitions. [2025-03-04 01:38:55,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 01:38:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 186 transitions. [2025-03-04 01:38:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 01:38:55,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:55,631 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:55,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:38:55,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:55,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash -44190356, now seen corresponding path program 1 times [2025-03-04 01:38:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:55,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923407527] [2025-03-04 01:38:55,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:55,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 01:38:55,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 01:38:55,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:55,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:38:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923407527] [2025-03-04 01:38:56,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923407527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:56,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:56,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:38:56,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678806476] [2025-03-04 01:38:56,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:56,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:38:56,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:56,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:38:56,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:56,535 INFO L87 Difference]: Start difference. First operand 132 states and 186 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:56,852 INFO L93 Difference]: Finished difference Result 387 states and 547 transitions. [2025-03-04 01:38:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:38:56,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-04 01:38:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:56,854 INFO L225 Difference]: With dead ends: 387 [2025-03-04 01:38:56,854 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 01:38:56,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:38:56,854 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:56,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 392 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:38:56,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 01:38:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-03-04 01:38:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 207 states have (on average 1.289855072463768) internal successors, (267), 207 states have internal predecessors, (267), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:38:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 359 transitions. [2025-03-04 01:38:56,872 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 359 transitions. Word has length 178 [2025-03-04 01:38:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:56,872 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 359 transitions. [2025-03-04 01:38:56,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 359 transitions. [2025-03-04 01:38:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 01:38:56,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:56,874 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:56,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:38:56,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:56,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash -737292053, now seen corresponding path program 1 times [2025-03-04 01:38:56,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:56,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338519524] [2025-03-04 01:38:56,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:56,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 01:38:56,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 01:38:56,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:56,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:38:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338519524] [2025-03-04 01:38:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338519524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:57,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:38:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259744458] [2025-03-04 01:38:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:57,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:38:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:57,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:38:57,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:57,330 INFO L87 Difference]: Start difference. First operand 256 states and 359 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:38:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:57,654 INFO L93 Difference]: Finished difference Result 384 states and 540 transitions. [2025-03-04 01:38:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:38:57,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 178 [2025-03-04 01:38:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:57,656 INFO L225 Difference]: With dead ends: 384 [2025-03-04 01:38:57,657 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 01:38:57,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:38:57,658 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 168 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:57,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 235 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:38:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 01:38:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2025-03-04 01:38:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 204 states have (on average 1.2843137254901962) internal successors, (262), 204 states have internal predecessors, (262), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:38:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 354 transitions. [2025-03-04 01:38:57,672 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 354 transitions. Word has length 178 [2025-03-04 01:38:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:57,672 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 354 transitions. [2025-03-04 01:38:57,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:38:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 354 transitions. [2025-03-04 01:38:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:38:57,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:57,674 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:57,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:38:57,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:57,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash -303032457, now seen corresponding path program 1 times [2025-03-04 01:38:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:57,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573711045] [2025-03-04 01:38:57,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:57,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:38:57,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:38:57,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:57,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:38:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:58,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573711045] [2025-03-04 01:38:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573711045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:58,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:58,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:38:58,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329350302] [2025-03-04 01:38:58,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:58,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:38:58,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:58,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:38:58,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:38:58,067 INFO L87 Difference]: Start difference. First operand 253 states and 354 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:58,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:58,291 INFO L93 Difference]: Finished difference Result 645 states and 903 transitions. [2025-03-04 01:38:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:38:58,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:38:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:58,294 INFO L225 Difference]: With dead ends: 645 [2025-03-04 01:38:58,294 INFO L226 Difference]: Without dead ends: 395 [2025-03-04 01:38:58,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:38:58,295 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 107 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:58,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 362 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:38:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-04 01:38:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 312. [2025-03-04 01:38:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 239 states have (on average 1.2552301255230125) internal successors, (300), 239 states have internal predecessors, (300), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-04 01:38:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 438 transitions. [2025-03-04 01:38:58,317 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 438 transitions. Word has length 180 [2025-03-04 01:38:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:58,318 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 438 transitions. [2025-03-04 01:38:58,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:38:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 438 transitions. [2025-03-04 01:38:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:38:58,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:58,319 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:38:58,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:38:58,319 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:58,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:58,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1533697393, now seen corresponding path program 1 times [2025-03-04 01:38:58,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:38:58,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459367551] [2025-03-04 01:38:58,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:58,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:38:58,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:38:58,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:38:58,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:58,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:38:59,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:38:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459367551] [2025-03-04 01:38:59,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459367551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:59,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:59,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:38:59,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703782591] [2025-03-04 01:38:59,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:59,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:38:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:38:59,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:38:59,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:38:59,885 INFO L87 Difference]: Start difference. First operand 312 states and 438 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:00,643 INFO L93 Difference]: Finished difference Result 706 states and 980 transitions. [2025-03-04 01:39:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:39:00,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-03-04 01:39:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:00,646 INFO L225 Difference]: With dead ends: 706 [2025-03-04 01:39:00,646 INFO L226 Difference]: Without dead ends: 456 [2025-03-04 01:39:00,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:39:00,647 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 73 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:00,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1109 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:39:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-04 01:39:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 452. [2025-03-04 01:39:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 367 states have (on average 1.2697547683923707) internal successors, (466), 369 states have internal predecessors, (466), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 01:39:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 624 transitions. [2025-03-04 01:39:00,674 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 624 transitions. Word has length 180 [2025-03-04 01:39:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:00,674 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 624 transitions. [2025-03-04 01:39:00,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 624 transitions. [2025-03-04 01:39:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:00,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:00,675 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:00,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:39:00,676 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -263253966, now seen corresponding path program 1 times [2025-03-04 01:39:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781994699] [2025-03-04 01:39:00,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:00,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:00,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:00,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:00,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:00,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781994699] [2025-03-04 01:39:00,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781994699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:00,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:00,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778586220] [2025-03-04 01:39:00,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:00,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:00,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:00,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:00,914 INFO L87 Difference]: Start difference. First operand 452 states and 624 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:01,147 INFO L93 Difference]: Finished difference Result 988 states and 1350 transitions. [2025-03-04 01:39:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:39:01,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:39:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:01,152 INFO L225 Difference]: With dead ends: 988 [2025-03-04 01:39:01,152 INFO L226 Difference]: Without dead ends: 598 [2025-03-04 01:39:01,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:01,154 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 81 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:01,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 536 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-04 01:39:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 592. [2025-03-04 01:39:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 495 states have (on average 1.2727272727272727) internal successors, (630), 501 states have internal predecessors, (630), 87 states have call successors, (87), 9 states have call predecessors, (87), 9 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 01:39:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 804 transitions. [2025-03-04 01:39:01,191 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 804 transitions. Word has length 180 [2025-03-04 01:39:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:01,192 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 804 transitions. [2025-03-04 01:39:01,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 804 transitions. [2025-03-04 01:39:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:01,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:01,194 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:01,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:39:01,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:01,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash -556656973, now seen corresponding path program 1 times [2025-03-04 01:39:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:01,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637246064] [2025-03-04 01:39:01,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:01,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:01,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:01,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:01,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:02,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637246064] [2025-03-04 01:39:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637246064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:02,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:02,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:02,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518081254] [2025-03-04 01:39:02,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:02,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:02,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:02,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:02,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:02,134 INFO L87 Difference]: Start difference. First operand 592 states and 804 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:02,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:02,513 INFO L93 Difference]: Finished difference Result 1428 states and 1924 transitions. [2025-03-04 01:39:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:39:02,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-03-04 01:39:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:02,517 INFO L225 Difference]: With dead ends: 1428 [2025-03-04 01:39:02,517 INFO L226 Difference]: Without dead ends: 898 [2025-03-04 01:39:02,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:02,519 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:02,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 531 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:39:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-04 01:39:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 712. [2025-03-04 01:39:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 615 states have (on average 1.2715447154471544) internal successors, (782), 621 states have internal predecessors, (782), 87 states have call successors, (87), 9 states have call predecessors, (87), 9 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 01:39:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 956 transitions. [2025-03-04 01:39:02,555 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 956 transitions. Word has length 180 [2025-03-04 01:39:02,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:02,556 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 956 transitions. [2025-03-04 01:39:02,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 956 transitions. [2025-03-04 01:39:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:02,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:02,557 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:02,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:39:02,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:02,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1244297843, now seen corresponding path program 1 times [2025-03-04 01:39:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:02,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356227845] [2025-03-04 01:39:02,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:02,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:02,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:02,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:03,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:03,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356227845] [2025-03-04 01:39:03,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356227845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:03,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:03,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:03,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701803144] [2025-03-04 01:39:03,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:03,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:03,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:03,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:03,302 INFO L87 Difference]: Start difference. First operand 712 states and 956 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:03,637 INFO L93 Difference]: Finished difference Result 1832 states and 2434 transitions. [2025-03-04 01:39:03,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:39:03,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-03-04 01:39:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:03,642 INFO L225 Difference]: With dead ends: 1832 [2025-03-04 01:39:03,642 INFO L226 Difference]: Without dead ends: 1182 [2025-03-04 01:39:03,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:03,644 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 105 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:03,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 454 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:39:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-03-04 01:39:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 928. [2025-03-04 01:39:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 831 states have (on average 1.273164861612515) internal successors, (1058), 837 states have internal predecessors, (1058), 87 states have call successors, (87), 9 states have call predecessors, (87), 9 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 01:39:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1232 transitions. [2025-03-04 01:39:03,680 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1232 transitions. Word has length 180 [2025-03-04 01:39:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:03,681 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1232 transitions. [2025-03-04 01:39:03,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1232 transitions. [2025-03-04 01:39:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:03,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:03,682 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:03,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:39:03,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:03,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash -543511950, now seen corresponding path program 1 times [2025-03-04 01:39:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:03,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439878155] [2025-03-04 01:39:03,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:03,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:03,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:03,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:03,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:03,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:03,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439878155] [2025-03-04 01:39:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439878155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:03,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624737169] [2025-03-04 01:39:03,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:03,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:03,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:03,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:03,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:03,890 INFO L87 Difference]: Start difference. First operand 928 states and 1232 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:04,129 INFO L93 Difference]: Finished difference Result 1896 states and 2506 transitions. [2025-03-04 01:39:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:39:04,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:39:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:04,133 INFO L225 Difference]: With dead ends: 1896 [2025-03-04 01:39:04,134 INFO L226 Difference]: Without dead ends: 1030 [2025-03-04 01:39:04,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:04,135 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 129 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:04,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 495 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-03-04 01:39:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 880. [2025-03-04 01:39:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 783 states have (on average 1.2694763729246488) internal successors, (994), 789 states have internal predecessors, (994), 87 states have call successors, (87), 9 states have call predecessors, (87), 9 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 01:39:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1168 transitions. [2025-03-04 01:39:04,166 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1168 transitions. Word has length 180 [2025-03-04 01:39:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:04,166 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1168 transitions. [2025-03-04 01:39:04,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1168 transitions. [2025-03-04 01:39:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:04,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:04,168 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:04,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:39:04,169 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:04,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash 404957044, now seen corresponding path program 1 times [2025-03-04 01:39:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:04,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91252810] [2025-03-04 01:39:04,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:04,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:04,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:04,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:04,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:04,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:04,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91252810] [2025-03-04 01:39:04,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91252810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:04,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:04,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064348457] [2025-03-04 01:39:04,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:04,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:04,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:04,242 INFO L87 Difference]: Start difference. First operand 880 states and 1168 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:04,276 INFO L93 Difference]: Finished difference Result 1586 states and 2105 transitions. [2025-03-04 01:39:04,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:39:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:04,280 INFO L225 Difference]: With dead ends: 1586 [2025-03-04 01:39:04,281 INFO L226 Difference]: Without dead ends: 768 [2025-03-04 01:39:04,283 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-03-04 01:39:04,283 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 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-03-04 01:39:04,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-03-04 01:39:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2025-03-04 01:39:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 671 states have (on average 1.2548435171385992) internal successors, (842), 677 states have internal predecessors, (842), 87 states have call successors, (87), 9 states have call predecessors, (87), 9 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 01:39:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1016 transitions. [2025-03-04 01:39:04,315 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1016 transitions. Word has length 180 [2025-03-04 01:39:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:04,315 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1016 transitions. [2025-03-04 01:39:04,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1016 transitions. [2025-03-04 01:39:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:04,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:04,317 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:04,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:39:04,317 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:04,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash 418102067, now seen corresponding path program 1 times [2025-03-04 01:39:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:04,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979024722] [2025-03-04 01:39:04,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:04,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:04,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:04,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:04,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:05,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979024722] [2025-03-04 01:39:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979024722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:05,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:05,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476885265] [2025-03-04 01:39:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:05,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:05,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:05,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:05,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:05,224 INFO L87 Difference]: Start difference. First operand 768 states and 1016 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:05,504 INFO L93 Difference]: Finished difference Result 1560 states and 2060 transitions. [2025-03-04 01:39:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:39:05,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-03-04 01:39:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:05,508 INFO L225 Difference]: With dead ends: 1560 [2025-03-04 01:39:05,508 INFO L226 Difference]: Without dead ends: 854 [2025-03-04 01:39:05,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:05,511 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 89 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:05,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 525 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-04 01:39:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 768. [2025-03-04 01:39:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 671 states have (on average 1.248882265275708) internal successors, (838), 677 states have internal predecessors, (838), 87 states have call successors, (87), 9 states have call predecessors, (87), 9 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 01:39:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1012 transitions. [2025-03-04 01:39:05,539 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1012 transitions. Word has length 180 [2025-03-04 01:39:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:05,540 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1012 transitions. [2025-03-04 01:39:05,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1012 transitions. [2025-03-04 01:39:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:05,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:05,542 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:05,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:39:05,542 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:05,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash 124699060, now seen corresponding path program 1 times [2025-03-04 01:39:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:05,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478686068] [2025-03-04 01:39:05,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:05,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:05,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:05,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:05,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:05,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:05,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478686068] [2025-03-04 01:39:05,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478686068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:05,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:05,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:05,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973879420] [2025-03-04 01:39:05,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:05,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:05,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:05,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:05,623 INFO L87 Difference]: Start difference. First operand 768 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:05,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:05,658 INFO L93 Difference]: Finished difference Result 1482 states and 1947 transitions. [2025-03-04 01:39:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:05,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:39:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:05,662 INFO L225 Difference]: With dead ends: 1482 [2025-03-04 01:39:05,662 INFO L226 Difference]: Without dead ends: 776 [2025-03-04 01:39:05,663 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-03-04 01:39:05,664 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:05,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 458 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-03-04 01:39:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 772. [2025-03-04 01:39:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 675 states have (on average 1.2444444444444445) internal successors, (840), 681 states have internal predecessors, (840), 87 states have call successors, (87), 9 states have call predecessors, (87), 9 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 01:39:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1014 transitions. [2025-03-04 01:39:05,692 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1014 transitions. Word has length 180 [2025-03-04 01:39:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:05,692 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1014 transitions. [2025-03-04 01:39:05,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1014 transitions. [2025-03-04 01:39:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:05,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:05,694 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:05,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:39:05,694 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:05,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1672252299, now seen corresponding path program 1 times [2025-03-04 01:39:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:05,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014961527] [2025-03-04 01:39:05,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:05,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:05,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:05,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:05,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:05,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:06,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:06,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014961527] [2025-03-04 01:39:06,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014961527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:06,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:06,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:39:06,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246466217] [2025-03-04 01:39:06,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:06,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:39:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:06,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:39:06,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:39:06,106 INFO L87 Difference]: Start difference. First operand 772 states and 1014 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:06,543 INFO L93 Difference]: Finished difference Result 1676 states and 2196 transitions. [2025-03-04 01:39:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:39:06,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:39:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:06,548 INFO L225 Difference]: With dead ends: 1676 [2025-03-04 01:39:06,548 INFO L226 Difference]: Without dead ends: 966 [2025-03-04 01:39:06,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:39:06,549 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 139 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:06,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1520 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:39:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-04 01:39:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 868. [2025-03-04 01:39:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 733 states have (on average 1.2251023192360164) internal successors, (898), 739 states have internal predecessors, (898), 123 states have call successors, (123), 11 states have call predecessors, (123), 11 states have return successors, (123), 117 states have call predecessors, (123), 123 states have call successors, (123) [2025-03-04 01:39:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1144 transitions. [2025-03-04 01:39:06,583 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1144 transitions. Word has length 180 [2025-03-04 01:39:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:06,584 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1144 transitions. [2025-03-04 01:39:06,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1144 transitions. [2025-03-04 01:39:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:06,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:06,585 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:06,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:39:06,586 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:06,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1937399540, now seen corresponding path program 1 times [2025-03-04 01:39:06,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:06,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278246437] [2025-03-04 01:39:06,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:06,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:06,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:06,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:06,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:06,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:06,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:06,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278246437] [2025-03-04 01:39:06,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278246437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:06,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:06,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323013006] [2025-03-04 01:39:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:06,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:06,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:06,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:06,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:06,781 INFO L87 Difference]: Start difference. First operand 868 states and 1144 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:06,957 INFO L93 Difference]: Finished difference Result 1646 states and 2151 transitions. [2025-03-04 01:39:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:39:06,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:39:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:06,961 INFO L225 Difference]: With dead ends: 1646 [2025-03-04 01:39:06,961 INFO L226 Difference]: Without dead ends: 840 [2025-03-04 01:39:06,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:06,963 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 129 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:06,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 581 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:39:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-04 01:39:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 700. [2025-03-04 01:39:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 572 states have (on average 1.2045454545454546) internal successors, (689), 574 states have internal predecessors, (689), 115 states have call successors, (115), 12 states have call predecessors, (115), 12 states have return successors, (115), 113 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-04 01:39:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 919 transitions. [2025-03-04 01:39:06,992 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 919 transitions. Word has length 180 [2025-03-04 01:39:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:06,993 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 919 transitions. [2025-03-04 01:39:06,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 919 transitions. [2025-03-04 01:39:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:06,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:06,994 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:06,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:39:06,994 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash 149589747, now seen corresponding path program 1 times [2025-03-04 01:39:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:06,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571459614] [2025-03-04 01:39:06,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:07,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:07,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:07,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:07,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:07,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:07,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571459614] [2025-03-04 01:39:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571459614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:07,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:07,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851999503] [2025-03-04 01:39:07,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:07,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:07,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:07,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:07,766 INFO L87 Difference]: Start difference. First operand 700 states and 919 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:08,049 INFO L93 Difference]: Finished difference Result 1396 states and 1825 transitions. [2025-03-04 01:39:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:39:08,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 180 [2025-03-04 01:39:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:08,055 INFO L225 Difference]: With dead ends: 1396 [2025-03-04 01:39:08,055 INFO L226 Difference]: Without dead ends: 762 [2025-03-04 01:39:08,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:08,057 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 107 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:08,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 530 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-03-04 01:39:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 692. [2025-03-04 01:39:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 564 states have (on average 1.200354609929078) internal successors, (677), 566 states have internal predecessors, (677), 115 states have call successors, (115), 12 states have call predecessors, (115), 12 states have return successors, (115), 113 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-04 01:39:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 907 transitions. [2025-03-04 01:39:08,103 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 907 transitions. Word has length 180 [2025-03-04 01:39:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:08,104 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 907 transitions. [2025-03-04 01:39:08,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 907 transitions. [2025-03-04 01:39:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:08,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:08,105 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:08,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:39:08,106 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:08,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1657141556, now seen corresponding path program 1 times [2025-03-04 01:39:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209850343] [2025-03-04 01:39:08,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:08,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:08,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:08,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:08,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:08,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:08,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209850343] [2025-03-04 01:39:08,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209850343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:08,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:08,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:08,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905568763] [2025-03-04 01:39:08,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:08,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:08,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:08,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:08,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:08,352 INFO L87 Difference]: Start difference. First operand 692 states and 907 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:08,519 INFO L93 Difference]: Finished difference Result 1380 states and 1799 transitions. [2025-03-04 01:39:08,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:39:08,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:39:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:08,523 INFO L225 Difference]: With dead ends: 1380 [2025-03-04 01:39:08,523 INFO L226 Difference]: Without dead ends: 754 [2025-03-04 01:39:08,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:08,525 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 41 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:08,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 667 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:39:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-04 01:39:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 684. [2025-03-04 01:39:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 556 states have (on average 1.1996402877697843) internal successors, (667), 558 states have internal predecessors, (667), 115 states have call successors, (115), 12 states have call predecessors, (115), 12 states have return successors, (115), 113 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-04 01:39:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 897 transitions. [2025-03-04 01:39:08,553 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 897 transitions. Word has length 180 [2025-03-04 01:39:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:08,554 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 897 transitions. [2025-03-04 01:39:08,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 897 transitions. [2025-03-04 01:39:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-04 01:39:08,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:08,555 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:08,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:39:08,555 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:08,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:08,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1318354360, now seen corresponding path program 1 times [2025-03-04 01:39:08,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:08,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915349724] [2025-03-04 01:39:08,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:08,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 01:39:08,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 01:39:08,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:08,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:39:08,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915349724] [2025-03-04 01:39:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915349724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767494176] [2025-03-04 01:39:08,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:08,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:08,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:08,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:39:08,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:39:08,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 01:39:08,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 01:39:08,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:08,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:08,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:39:08,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:08,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:08,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767494176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:08,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:39:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649274421] [2025-03-04 01:39:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:08,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:39:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:08,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:39:08,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:08,963 INFO L87 Difference]: Start difference. First operand 684 states and 897 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:08,999 INFO L93 Difference]: Finished difference Result 1314 states and 1720 transitions. [2025-03-04 01:39:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:39:09,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-03-04 01:39:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:09,004 INFO L225 Difference]: With dead ends: 1314 [2025-03-04 01:39:09,004 INFO L226 Difference]: Without dead ends: 696 [2025-03-04 01:39:09,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 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-03-04 01:39:09,007 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:09,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-04 01:39:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2025-03-04 01:39:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 568 states have (on average 1.1954225352112675) internal successors, (679), 570 states have internal predecessors, (679), 115 states have call successors, (115), 12 states have call predecessors, (115), 12 states have return successors, (115), 113 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-04 01:39:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 909 transitions. [2025-03-04 01:39:09,039 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 909 transitions. Word has length 182 [2025-03-04 01:39:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:09,040 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 909 transitions. [2025-03-04 01:39:09,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 909 transitions. [2025-03-04 01:39:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 01:39:09,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:09,041 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:09,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:39:09,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:09,243 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:09,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash -749586874, now seen corresponding path program 1 times [2025-03-04 01:39:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:09,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958256487] [2025-03-04 01:39:09,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:09,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 01:39:09,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 01:39:09,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:09,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:39:09,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:39:09,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 01:39:09,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 01:39:09,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:09,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:39:09,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:39:09,430 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:39:09,431 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:39:09,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:39:09,435 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:09,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:39:09,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:39:09 BoogieIcfgContainer [2025-03-04 01:39:09,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:39:09,508 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:39:09,508 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:39:09,508 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:39:09,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:38:50" (3/4) ... [2025-03-04 01:39:09,511 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:39:09,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:39:09,512 INFO L158 Benchmark]: Toolchain (without parser) took 19623.80ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 956.3MB). Free memory was 112.6MB in the beginning and 439.7MB in the end (delta: -327.1MB). Peak memory consumption was 632.3MB. Max. memory is 16.1GB. [2025-03-04 01:39:09,513 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:39:09,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.77ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.2MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:39:09,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.83ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 92.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:39:09,514 INFO L158 Benchmark]: Boogie Preprocessor took 47.56ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:39:09,514 INFO L158 Benchmark]: IcfgBuilder took 618.13ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 58.5MB in the end (delta: 31.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:39:09,514 INFO L158 Benchmark]: TraceAbstraction took 18674.39ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 956.3MB). Free memory was 58.1MB in the beginning and 440.0MB in the end (delta: -382.0MB). Peak memory consumption was 573.6MB. Max. memory is 16.1GB. [2025-03-04 01:39:09,514 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 1.1GB. Free memory was 440.0MB in the beginning and 439.7MB in the end (delta: 295.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:39:09,515 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.77ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 96.2MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.83ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 92.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.56ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 618.13ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 58.5MB in the end (delta: 31.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18674.39ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 956.3MB). Free memory was 58.1MB in the beginning and 440.0MB in the end (delta: -382.0MB). Peak memory consumption was 573.6MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 1.1GB. Free memory was 440.0MB in the beginning and 439.7MB in the end (delta: 295.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 68. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L59] unsigned char last_1_WrapperStruct00_var_1_5 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_5=0] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L124] EXPR WrapperStruct00.var_1_5 [L124] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L93] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_4 [L94] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L101] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L135] RET updateVariables() [L136] CALL step() [L63] COND FALSE !(\read(last_1_WrapperStruct00_var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] EXPR WrapperStruct00.var_1_1 [L68] EXPR WrapperStruct00.var_1_4 [L68] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L68] COND FALSE !(WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) [L71] EXPR WrapperStruct00.var_1_3 [L71] WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) [L71] EXPR WrapperStruct00.var_1_17 [L71] WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L71] COND TRUE WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) [L72] EXPR WrapperStruct00.var_1_2 [L72] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 [L72] EXPR WrapperStruct00.var_1_3 [L72] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 [L72] EXPR WrapperStruct00.var_1_7 [L72] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L72] WrapperStruct00.var_1_5 = ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7) [L76] EXPR WrapperStruct00.var_1_11 [L76] EXPR WrapperStruct00.var_1_12 [L76] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] EXPR ((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1) [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR ((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L76] signed long int stepLocal_1 = (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1))); [L77] EXPR WrapperStruct00.var_1_17 [L77] signed char stepLocal_0 = WrapperStruct00.var_1_17; [L78] COND FALSE !(-10 >= stepLocal_0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0, stepLocal_1=255] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) [L127] EXPR WrapperStruct00.var_1_3 [L127] EXPR WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) [L127] EXPR WrapperStruct00.var_1_17 [L127] EXPR WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) [L127] EXPR WrapperStruct00.var_1_5 [L127] EXPR WrapperStruct00.var_1_2 [L127] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 [L127] EXPR WrapperStruct00.var_1_3 [L127] EXPR WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 [L127] EXPR WrapperStruct00.var_1_7 [L127] EXPR (WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) [L127] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) [L127] EXPR WrapperStruct00.var_1_1 [L127] EXPR WrapperStruct00.var_1_4 [L127] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 [L127] EXPR WrapperStruct00.var_1_17 [L127] EXPR WrapperStruct00.var_1_15 [L127] EXPR (WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127-L128] return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_4) < 0 ) ? -(WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_4))))) : 1) : 1) && ((WrapperStruct00.var_1_3 || (256 >= (WrapperStruct00.var_1_17 + 4))) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_3) || WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_5 == ((unsigned char) (! (! (WrapperStruct00.var_1_8 || WrapperStruct00.var_1_9))))))) && ((-10 >= WrapperStruct00.var_1_17) ? ((((WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) - ((((WrapperStruct00.var_1_13) < (1)) ? (WrapperStruct00.var_1_13) : (1)))) > (~ WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_16))) : 1)) && ((WrapperStruct00.var_1_1 >= (- (WrapperStruct00.var_1_4 * WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_15)) : 1) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 23, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1768 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1763 mSDsluCounter, 11472 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8044 mSDsCounter, 456 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3811 IncrementalHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 456 mSolverCounterUnsat, 3428 mSDtfsCounter, 3811 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=928occurred in iteration=13, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 1344 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 4629 NumberOfCodeBlocks, 4629 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4420 ConstructedInterpolants, 0 QuantifiedInterpolants, 7952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1746 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 25124/25300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:39:09,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:39:11,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:39:11,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:39:11,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:39:11,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:39:11,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:39:11,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:39:11,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:39:11,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:39:11,637 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:39:11,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:39:11,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:39:11,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:39:11,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:39:11,637 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:39:11,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:39:11,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:39:11,637 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:39:11,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:39:11,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:39:11,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:39:11,638 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:39:11,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:39:11,638 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:39:11,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:39:11,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:39:11,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:39:11,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:39:11,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:39:11,639 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/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 -> c1e424fdb45007bba7dcf6b9c7609abd758db94a72eb27633df48ff94056907f [2025-03-04 01:39:11,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:39:11,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:39:11,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:39:11,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:39:11,898 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:39:11,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2025-03-04 01:39:13,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5747e9087/f161d825fa2d4c238042c450677307c2/FLAG61cefd133 [2025-03-04 01:39:13,291 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:39:13,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i [2025-03-04 01:39:13,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5747e9087/f161d825fa2d4c238042c450677307c2/FLAG61cefd133 [2025-03-04 01:39:13,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5747e9087/f161d825fa2d4c238042c450677307c2 [2025-03-04 01:39:13,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:39:13,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:39:13,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:13,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:39:13,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:39:13,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c411522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13, skipping insertion in model container [2025-03-04 01:39:13,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:39:13,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2025-03-04 01:39:13,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:13,519 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:39:13,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-34.i[916,929] [2025-03-04 01:39:13,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:13,601 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:39:13,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13 WrapperNode [2025-03-04 01:39:13,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:13,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:13,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:39:13,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:39:13,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,656 INFO L138 Inliner]: procedures = 31, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2025-03-04 01:39:13,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:13,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:39:13,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:39:13,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:39:13,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,692 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-03-04 01:39:13,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:39:13,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:39:13,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:39:13,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:39:13,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (1/1) ... [2025-03-04 01:39:13,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:39:13,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:13,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:39:13,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:39:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:39:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:39:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:39:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:39:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:39:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:39:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:39:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:39:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:39:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:39:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:39:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:39:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:39:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:39:13,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:39:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:39:13,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:39:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:39:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:39:13,886 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:39:13,888 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:39:22,982 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: havoc property_#t~ite81#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~ite95#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~short87#1;havoc property_#t~mem88#1;havoc property_#t~short89#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short93#1;havoc property_#t~short96#1;havoc property_#t~mem97#1;havoc property_#t~ite110#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short118#1; [2025-03-04 01:39:23,026 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-04 01:39:23,027 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:39:23,040 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:39:23,040 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:39:23,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:23 BoogieIcfgContainer [2025-03-04 01:39:23,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:39:23,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:39:23,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:39:23,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:39:23,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:39:13" (1/3) ... [2025-03-04 01:39:23,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e308f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:23, skipping insertion in model container [2025-03-04 01:39:23,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:13" (2/3) ... [2025-03-04 01:39:23,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e308f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:23, skipping insertion in model container [2025-03-04 01:39:23,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:23" (3/3) ... [2025-03-04 01:39:23,048 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-34.i [2025-03-04 01:39:23,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:39:23,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-34.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:39:23,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:39:23,114 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;@30c28983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:39:23,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:39:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:39:23,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 01:39:23,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:23,126 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:23,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:23,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:23,130 INFO L85 PathProgramCache]: Analyzing trace with hash -897767277, now seen corresponding path program 1 times [2025-03-04 01:39:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:23,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994458741] [2025-03-04 01:39:23,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:23,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:23,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:23,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:23,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:39:23,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:39:23,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:39:23,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:23,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:23,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:39:23,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-04 01:39:23,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:23,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:23,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994458741] [2025-03-04 01:39:23,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994458741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:23,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:23,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:39:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159275815] [2025-03-04 01:39:23,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:23,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:39:23,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:23,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:39:23,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:39:23,557 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 94 states have internal predecessors, (127), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:23,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:23,580 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2025-03-04 01:39:23,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:39:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-03-04 01:39:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:23,585 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:39:23,586 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:39:23,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-03-04 01:39:23,589 INFO L435 NwaCegarLoop]: 168 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, 168 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-03-04 01:39:23,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:39:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:39:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:39:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-03-04 01:39:23,620 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2025-03-04 01:39:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:23,620 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-03-04 01:39:23,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 01:39:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-03-04 01:39:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 01:39:23,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:23,623 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:23,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:39:23,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:23,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:23,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:23,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2069350686, now seen corresponding path program 1 times [2025-03-04 01:39:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:23,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711167070] [2025-03-04 01:39:23,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:23,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:23,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:23,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:23,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:39:23,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 01:39:24,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 01:39:24,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:24,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:24,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:39:24,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:24,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:24,267 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711167070] [2025-03-04 01:39:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711167070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:24,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:24,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:39:24,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049953030] [2025-03-04 01:39:24,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:24,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:39:24,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:24,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:39:24,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:24,269 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:24,317 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2025-03-04 01:39:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:39:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2025-03-04 01:39:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:24,320 INFO L225 Difference]: With dead ends: 227 [2025-03-04 01:39:24,321 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:39:24,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 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-03-04 01:39:24,323 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:24,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:39:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 01:39:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:39:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-04 01:39:24,340 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 171 [2025-03-04 01:39:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:24,341 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-04 01:39:24,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:24,342 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-04 01:39:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 01:39:24,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:24,343 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:24,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:39:24,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:24,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:24,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:24,544 INFO L85 PathProgramCache]: Analyzing trace with hash 699367325, now seen corresponding path program 1 times [2025-03-04 01:39:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:24,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460804018] [2025-03-04 01:39:24,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:24,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:24,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:24,547 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:24,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:39:24,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 01:39:24,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 01:39:24,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:24,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:39:24,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:24,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:24,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460804018] [2025-03-04 01:39:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460804018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:24,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:24,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86680611] [2025-03-04 01:39:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:24,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:24,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:24,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:24,942 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:25,032 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2025-03-04 01:39:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:25,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2025-03-04 01:39:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:25,033 INFO L225 Difference]: With dead ends: 227 [2025-03-04 01:39:25,034 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:39:25,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 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-03-04 01:39:25,034 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:25,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:39:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:39:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:39:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:39:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-03-04 01:39:25,046 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 173 [2025-03-04 01:39:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:25,046 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-03-04 01:39:25,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-03-04 01:39:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 01:39:25,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:25,050 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:25,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:39:25,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:25,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:25,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash 934887033, now seen corresponding path program 1 times [2025-03-04 01:39:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:25,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10228010] [2025-03-04 01:39:25,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:25,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:25,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:25,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:39:25,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 01:39:25,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 01:39:25,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:25,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:25,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:39:25,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:25,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:25,592 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:25,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10228010] [2025-03-04 01:39:25,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10228010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:25,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:25,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:39:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387682468] [2025-03-04 01:39:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:25,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:39:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:25,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:39:25,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:25,594 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:25,783 INFO L93 Difference]: Finished difference Result 273 states and 392 transitions. [2025-03-04 01:39:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:39:25,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2025-03-04 01:39:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:25,785 INFO L225 Difference]: With dead ends: 273 [2025-03-04 01:39:25,785 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 01:39:25,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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-03-04 01:39:25,786 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 72 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:25,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 01:39:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2025-03-04 01:39:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 107 states have internal predecessors, (141), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:39:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 187 transitions. [2025-03-04 01:39:25,792 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 187 transitions. Word has length 175 [2025-03-04 01:39:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:25,792 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 187 transitions. [2025-03-04 01:39:25,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 187 transitions. [2025-03-04 01:39:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 01:39:25,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:25,794 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:25,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:39:25,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:25,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:25,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash -668115525, now seen corresponding path program 1 times [2025-03-04 01:39:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:25,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353537188] [2025-03-04 01:39:25,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:25,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:25,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:25,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:25,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:39:26,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 01:39:26,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 01:39:26,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:26,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:26,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:39:26,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:26,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:26,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:26,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353537188] [2025-03-04 01:39:26,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353537188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:26,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:26,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:39:26,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083584890] [2025-03-04 01:39:26,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:26,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:39:26,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:26,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:39:26,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:26,434 INFO L87 Difference]: Start difference. First operand 132 states and 187 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:26,474 INFO L93 Difference]: Finished difference Result 289 states and 410 transitions. [2025-03-04 01:39:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:39:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2025-03-04 01:39:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:26,478 INFO L225 Difference]: With dead ends: 289 [2025-03-04 01:39:26,478 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 01:39:26,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 175 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-03-04 01:39:26,478 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 51 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:26,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 313 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 01:39:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2025-03-04 01:39:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.308411214953271) internal successors, (140), 107 states have internal predecessors, (140), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:39:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 186 transitions. [2025-03-04 01:39:26,490 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 186 transitions. Word has length 177 [2025-03-04 01:39:26,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:26,491 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 186 transitions. [2025-03-04 01:39:26,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 186 transitions. [2025-03-04 01:39:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 01:39:26,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:26,494 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:26,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:39:26,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:26,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:26,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash -833005794, now seen corresponding path program 1 times [2025-03-04 01:39:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:26,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212024740] [2025-03-04 01:39:26,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:26,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:26,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:26,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:26,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:39:26,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 01:39:27,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 01:39:27,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:27,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:27,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:39:27,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:27,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:27,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:27,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212024740] [2025-03-04 01:39:27,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212024740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:27,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:27,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:39:27,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038720857] [2025-03-04 01:39:27,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:27,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:39:27,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:27,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:39:27,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:27,040 INFO L87 Difference]: Start difference. First operand 132 states and 186 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:27,066 INFO L93 Difference]: Finished difference Result 259 states and 366 transitions. [2025-03-04 01:39:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:39:27,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-04 01:39:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:27,068 INFO L225 Difference]: With dead ends: 259 [2025-03-04 01:39:27,068 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 01:39:27,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 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-03-04 01:39:27,069 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:27,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 01:39:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-04 01:39:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:39:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2025-03-04 01:39:27,075 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 178 [2025-03-04 01:39:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:27,075 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2025-03-04 01:39:27,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2025-03-04 01:39:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:27,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:27,076 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:27,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:39:27,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:27,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:27,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:27,277 INFO L85 PathProgramCache]: Analyzing trace with hash 952527818, now seen corresponding path program 1 times [2025-03-04 01:39:27,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:27,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778738708] [2025-03-04 01:39:27,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:27,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:27,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:27,279 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:27,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:39:27,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:27,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:27,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:27,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:27,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:39:27,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:27,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:27,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2025-03-04 01:39:28,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:28,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 101 treesize of output 41 [2025-03-04 01:39:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:28,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:28,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778738708] [2025-03-04 01:39:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778738708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:28,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:39:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22306273] [2025-03-04 01:39:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:28,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:28,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:28,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:28,793 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:30,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:33,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:33,220 INFO L93 Difference]: Finished difference Result 346 states and 484 transitions. [2025-03-04 01:39:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:33,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:39:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:33,223 INFO L225 Difference]: With dead ends: 346 [2025-03-04 01:39:33,223 INFO L226 Difference]: Without dead ends: 219 [2025-03-04 01:39:33,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:39:33,224 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 81 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:33,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 386 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 01:39:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-04 01:39:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 193. [2025-03-04 01:39:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 143 states have internal predecessors, (177), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 01:39:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 269 transitions. [2025-03-04 01:39:33,247 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 269 transitions. Word has length 180 [2025-03-04 01:39:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:33,247 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 269 transitions. [2025-03-04 01:39:33,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 269 transitions. [2025-03-04 01:39:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:33,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:33,249 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:33,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:39:33,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:33,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:33,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash -603694301, now seen corresponding path program 1 times [2025-03-04 01:39:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594318081] [2025-03-04 01:39:33,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:33,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:33,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:33,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:33,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:39:33,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:33,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:33,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:33,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:33,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:39:33,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:33,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:33,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594318081] [2025-03-04 01:39:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594318081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797549250] [2025-03-04 01:39:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:33,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:33,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:33,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:33,915 INFO L87 Difference]: Start difference. First operand 193 states and 269 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:35,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:37,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:40,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:40,881 INFO L93 Difference]: Finished difference Result 361 states and 498 transitions. [2025-03-04 01:39:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:39:40,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:39:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:40,884 INFO L225 Difference]: With dead ends: 361 [2025-03-04 01:39:40,884 INFO L226 Difference]: Without dead ends: 234 [2025-03-04 01:39:40,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:39:40,884 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 43 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:40,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 587 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-03-04 01:39:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-04 01:39:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2025-03-04 01:39:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 176 states have (on average 1.2386363636363635) internal successors, (218), 177 states have internal predecessors, (218), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:39:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 314 transitions. [2025-03-04 01:39:40,898 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 314 transitions. Word has length 180 [2025-03-04 01:39:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:40,899 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 314 transitions. [2025-03-04 01:39:40,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 314 transitions. [2025-03-04 01:39:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:39:40,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:40,900 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:39:40,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:39:41,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:41,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:41,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1894321636, now seen corresponding path program 1 times [2025-03-04 01:39:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512199579] [2025-03-04 01:39:41,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:41,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:41,104 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:41,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:39:41,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:39:41,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:39:41,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:41,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:41,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:39:41,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:41,561 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 14 treesize of output 10 [2025-03-04 01:39:41,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 29 [2025-03-04 01:39:46,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:46,232 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 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-04 01:39:46,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:46,543 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 1 case distinctions, treesize of input 35 treesize of output 37 [2025-03-04 01:39:47,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:47,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-03-04 01:39:47,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:47,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-04 01:39:47,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:47,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-04 01:39:48,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:48,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-04 01:39:48,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:48,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 53 [2025-03-04 01:39:49,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:49,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2025-03-04 01:39:49,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:49,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:39:50,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:50,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 77 [2025-03-04 01:39:50,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:50,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 85 [2025-03-04 01:39:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 730 proven. 57 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-04 01:39:51,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:39:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:39:51,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512199579] [2025-03-04 01:39:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512199579] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 17 [2025-03-04 01:39:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186968766] [2025-03-04 01:39:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:51,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:39:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:51,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:39:51,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=198, Unknown=1, NotChecked=0, Total=272 [2025-03-04 01:39:51,429 INFO L87 Difference]: Start difference. First operand 230 states and 314 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:39:54,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:57,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:59,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:00,137 INFO L93 Difference]: Finished difference Result 459 states and 626 transitions. [2025-03-04 01:40:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-03-04 01:40:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:00,140 INFO L225 Difference]: With dead ends: 459 [2025-03-04 01:40:00,140 INFO L226 Difference]: Without dead ends: 299 [2025-03-04 01:40:00,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=78, Invalid=227, Unknown=1, NotChecked=0, Total=306 [2025-03-04 01:40:00,141 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 55 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:00,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 458 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-03-04 01:40:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-04 01:40:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 267. [2025-03-04 01:40:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 213 states have (on average 1.2629107981220657) internal successors, (269), 214 states have internal predecessors, (269), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:40:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 365 transitions. [2025-03-04 01:40:00,159 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 365 transitions. Word has length 180 [2025-03-04 01:40:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:00,160 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 365 transitions. [2025-03-04 01:40:00,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:40:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 365 transitions. [2025-03-04 01:40:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:40:00,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:00,162 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:40:00,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:40:00,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:40:00,363 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:00,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2111246110, now seen corresponding path program 1 times [2025-03-04 01:40:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:00,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256490443] [2025-03-04 01:40:00,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:00,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:40:00,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:00,366 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:40:00,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:40:00,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:40:00,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:40:00,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:00,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:00,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 01:40:00,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:00,818 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 8 treesize of output 1 [2025-03-04 01:40:01,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 30 [2025-03-04 01:40:01,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:01,349 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 1 case distinctions, treesize of input 47 treesize of output 43 [2025-03-04 01:40:01,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:01,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2025-03-04 01:40:02,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:02,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2025-03-04 01:40:02,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:02,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 69 [2025-03-04 01:40:02,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:02,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 72 [2025-03-04 01:40:03,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:03,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 82 [2025-03-04 01:40:03,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:03,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 85 [2025-03-04 01:40:04,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:04,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 96 [2025-03-04 01:40:05,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:05,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 104 treesize of output 109 [2025-03-04 01:40:06,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:06,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 60 [2025-03-04 01:40:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 791 proven. 96 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-04 01:40:06,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:40:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:40:07,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256490443] [2025-03-04 01:40:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256490443] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:07,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:07,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [23] total 28 [2025-03-04 01:40:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5616330] [2025-03-04 01:40:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:07,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:40:07,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:07,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:40:07,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:40:07,537 INFO L87 Difference]: Start difference. First operand 267 states and 365 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:40:11,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:13,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []