./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-a_file-33.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 281fe865ae002c37b4eaf841ade310d12dfc0d84dbffda3840d13e21dda564dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:22:30,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:22:30,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:22:30,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:22:30,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:22:31,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:22:31,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:22:31,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:22:31,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:22:31,015 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:22:31,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:22:31,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:22:31,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:22:31,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:22:31,016 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:22:31,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:22:31,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:22:31,017 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:22:31,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:22:31,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:22:31,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:22:31,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:22:31,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:22:31,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:22:31,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:22:31,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:22:31,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:22:31,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:22:31,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:22:31,019 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 -> 281fe865ae002c37b4eaf841ade310d12dfc0d84dbffda3840d13e21dda564dc [2025-03-17 05:22:31,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:22:31,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:22:31,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:22:31,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:22:31,308 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:22:31,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-33.i [2025-03-17 05:22:32,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794c0d139/7052f3c5354f4171a1ba8f0f00f1596d/FLAG0e747dbcb [2025-03-17 05:22:32,851 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:22:32,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-33.i [2025-03-17 05:22:32,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794c0d139/7052f3c5354f4171a1ba8f0f00f1596d/FLAG0e747dbcb [2025-03-17 05:22:32,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794c0d139/7052f3c5354f4171a1ba8f0f00f1596d [2025-03-17 05:22:32,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:22:32,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:22:32,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:32,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:22:32,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:22:32,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:32" (1/1) ... [2025-03-17 05:22:32,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506ecd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:32, skipping insertion in model container [2025-03-17 05:22:32,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:32" (1/1) ... [2025-03-17 05:22:32,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:22:33,067 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-a_file-33.i[916,929] [2025-03-17 05:22:33,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:33,127 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:22:33,136 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-a_file-33.i[916,929] [2025-03-17 05:22:33,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:33,183 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:22:33,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33 WrapperNode [2025-03-17 05:22:33,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:33,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:33,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:22:33,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:22:33,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,247 INFO L138 Inliner]: procedures = 29, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 469 [2025-03-17 05:22:33,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:33,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:22:33,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:22:33,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:22:33,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,296 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 44, 21, 11, 31]. 38 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 2, 2]. The 15 writes are split as follows [0, 1, 5, 4, 3, 2]. [2025-03-17 05:22:33,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:22:33,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:22:33,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:22:33,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:22:33,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (1/1) ... [2025-03-17 05:22:33,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:22:33,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:33,367 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-17 05:22:33,371 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-17 05:22:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:22:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:22:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:22:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:22:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:22:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:22:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:22:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:22:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:22:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:22:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:22:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:22:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:22:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:22:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:22:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:22:33,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:22:33,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:22:33,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:22:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:22:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:22:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:22:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:22:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:22:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:22:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:22:33,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:22:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:22:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:22:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:22:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:22:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:22:33,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:22:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:22:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:22:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:22:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:22:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:22:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:22:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:22:33,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:22:33,523 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:22:33,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:22:33,921 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~bitwise73#1;havoc property_#t~mem74#1;havoc property_#t~ite79#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short84#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~bitwise87#1;havoc property_#t~bitwise89#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite100#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short116#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1; [2025-03-17 05:22:33,962 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-03-17 05:22:33,962 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:22:33,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:22:33,986 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:22:33,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:33 BoogieIcfgContainer [2025-03-17 05:22:33,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:22:33,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:22:33,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:22:33,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:22:33,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:22:32" (1/3) ... [2025-03-17 05:22:33,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3430d86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:33, skipping insertion in model container [2025-03-17 05:22:33,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:33" (2/3) ... [2025-03-17 05:22:33,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3430d86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:33, skipping insertion in model container [2025-03-17 05:22:33,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:33" (3/3) ... [2025-03-17 05:22:33,999 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-33.i [2025-03-17 05:22:34,012 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:22:34,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-33.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:22:34,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:22:34,078 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;@3a39079d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:22:34,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:22:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 90 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:22:34,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:34,089 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:34,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:34,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:34,095 INFO L85 PathProgramCache]: Analyzing trace with hash 83701688, now seen corresponding path program 1 times [2025-03-17 05:22:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610934801] [2025-03-17 05:22:34,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:34,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:34,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:34,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:34,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:34,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 05:22:34,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:34,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610934801] [2025-03-17 05:22:34,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610934801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:34,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741988115] [2025-03-17 05:22:34,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:34,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:34,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:34,373 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-17 05:22:34,375 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-17 05:22:34,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:34,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:34,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:34,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:34,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:22:34,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 05:22:34,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741988115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:34,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:34,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:22:34,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238017546] [2025-03-17 05:22:34,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:34,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:22:34,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:34,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:22:34,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:22:34,585 INFO L87 Difference]: Start difference. First operand has 101 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 90 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 05:22:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:34,621 INFO L93 Difference]: Finished difference Result 199 states and 309 transitions. [2025-03-17 05:22:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:22:34,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2025-03-17 05:22:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:34,630 INFO L225 Difference]: With dead ends: 199 [2025-03-17 05:22:34,632 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 05:22:34,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-17 05:22:34,639 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:34,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 05:22:34,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 05:22:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 88 states have internal predecessors, (129), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2025-03-17 05:22:34,688 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 94 [2025-03-17 05:22:34,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:34,689 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2025-03-17 05:22:34,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 05:22:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2025-03-17 05:22:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:22:34,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:34,692 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:34,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:22:34,892 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-17 05:22:34,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:34,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1835251867, now seen corresponding path program 1 times [2025-03-17 05:22:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:34,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70876226] [2025-03-17 05:22:34,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:34,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:34,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:34,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:35,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:35,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70876226] [2025-03-17 05:22:35,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70876226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:35,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:35,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:22:35,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343697571] [2025-03-17 05:22:35,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:35,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:22:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:35,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:22:35,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:35,154 INFO L87 Difference]: Start difference. First operand 99 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:35,210 INFO L93 Difference]: Finished difference Result 200 states and 297 transitions. [2025-03-17 05:22:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:35,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-17 05:22:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:35,213 INFO L225 Difference]: With dead ends: 200 [2025-03-17 05:22:35,213 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 05:22:35,213 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-17 05:22:35,214 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:35,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 05:22:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-17 05:22:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 149 transitions. [2025-03-17 05:22:35,225 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 149 transitions. Word has length 94 [2025-03-17 05:22:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:35,229 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 149 transitions. [2025-03-17 05:22:35,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 149 transitions. [2025-03-17 05:22:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:22:35,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:35,234 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:35,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:22:35,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:35,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1572211748, now seen corresponding path program 1 times [2025-03-17 05:22:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:35,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991407309] [2025-03-17 05:22:35,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:35,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:35,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:35,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:35,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:35,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:35,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:35,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991407309] [2025-03-17 05:22:35,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991407309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:35,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:35,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:22:35,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347414580] [2025-03-17 05:22:35,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:35,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:22:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:35,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:22:35,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:35,421 INFO L87 Difference]: Start difference. First operand 101 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:35,473 INFO L93 Difference]: Finished difference Result 204 states and 301 transitions. [2025-03-17 05:22:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:35,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-17 05:22:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:35,474 INFO L225 Difference]: With dead ends: 204 [2025-03-17 05:22:35,474 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:22:35,481 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-17 05:22:35,481 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:35,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 406 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:22:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-17 05:22:35,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-03-17 05:22:35,493 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 94 [2025-03-17 05:22:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:35,493 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-03-17 05:22:35,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-03-17 05:22:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:22:35,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:35,494 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:22:35,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:35,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1571288227, now seen corresponding path program 1 times [2025-03-17 05:22:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:35,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426071620] [2025-03-17 05:22:35,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:35,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:35,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:35,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:35,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:35,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:35,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426071620] [2025-03-17 05:22:35,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426071620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:35,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:35,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:35,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957283425] [2025-03-17 05:22:35,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:35,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:35,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:35,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:35,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:35,917 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:36,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:36,054 INFO L93 Difference]: Finished difference Result 309 states and 454 transitions. [2025-03-17 05:22:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:36,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-17 05:22:36,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:36,056 INFO L225 Difference]: With dead ends: 309 [2025-03-17 05:22:36,056 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 05:22:36,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-17 05:22:36,058 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 138 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:36,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 735 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 05:22:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 122. [2025-03-17 05:22:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 111 states have (on average 1.4594594594594594) internal successors, (162), 111 states have internal predecessors, (162), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-03-17 05:22:36,073 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 94 [2025-03-17 05:22:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:36,073 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-03-17 05:22:36,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-03-17 05:22:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:22:36,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:36,075 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:36,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:22:36,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:36,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash -63736418, now seen corresponding path program 1 times [2025-03-17 05:22:36,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:36,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197360400] [2025-03-17 05:22:36,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:36,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:36,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:36,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:36,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:36,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:36,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:36,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197360400] [2025-03-17 05:22:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197360400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:36,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:36,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140219100] [2025-03-17 05:22:36,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:36,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:36,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:36,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:36,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:36,535 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:36,755 INFO L93 Difference]: Finished difference Result 285 states and 420 transitions. [2025-03-17 05:22:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-17 05:22:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:36,758 INFO L225 Difference]: With dead ends: 285 [2025-03-17 05:22:36,759 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 05:22:36,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-17 05:22:36,761 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 138 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:36,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 473 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 05:22:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 124. [2025-03-17 05:22:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 113 states have internal predecessors, (164), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2025-03-17 05:22:36,777 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 94 [2025-03-17 05:22:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:36,778 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2025-03-17 05:22:36,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2025-03-17 05:22:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:22:36,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:36,779 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:36,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:22:36,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:36,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash -326523746, now seen corresponding path program 1 times [2025-03-17 05:22:36,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:36,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711664952] [2025-03-17 05:22:36,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:36,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:36,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:36,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:36,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:36,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:37,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:37,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711664952] [2025-03-17 05:22:37,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711664952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:37,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:37,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169897153] [2025-03-17 05:22:37,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:37,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:37,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:37,114 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:37,249 INFO L93 Difference]: Finished difference Result 291 states and 427 transitions. [2025-03-17 05:22:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-17 05:22:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:37,251 INFO L225 Difference]: With dead ends: 291 [2025-03-17 05:22:37,251 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 05:22:37,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:37,251 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 136 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:37,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 572 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 05:22:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2025-03-17 05:22:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 1.4434782608695653) internal successors, (166), 115 states have internal predecessors, (166), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:22:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2025-03-17 05:22:37,259 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 94 [2025-03-17 05:22:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:37,259 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2025-03-17 05:22:37,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2025-03-17 05:22:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:22:37,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:37,260 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:37,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:22:37,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:37,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:37,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1181028063, now seen corresponding path program 1 times [2025-03-17 05:22:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:37,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106841617] [2025-03-17 05:22:37,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:37,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:37,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:37,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:37,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:37,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:22:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106841617] [2025-03-17 05:22:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106841617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233385837] [2025-03-17 05:22:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:37,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:37,812 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-17 05:22:37,814 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-17 05:22:37,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:37,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:37,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:37,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:37,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:22:37,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:37,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-03-17 05:22:38,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-03-17 05:22:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 05:22:38,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:38,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2025-03-17 05:22:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:22:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233385837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:22:38,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:22:38,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2025-03-17 05:22:38,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113042284] [2025-03-17 05:22:38,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:22:38,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 05:22:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:38,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 05:22:38,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:22:38,455 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 22 states, 19 states have (on average 5.684210526315789) internal successors, (108), 22 states have internal predecessors, (108), 9 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-17 05:22:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:39,207 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2025-03-17 05:22:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:22:39,208 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.684210526315789) internal successors, (108), 22 states have internal predecessors, (108), 9 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) Word has length 94 [2025-03-17 05:22:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:39,210 INFO L225 Difference]: With dead ends: 385 [2025-03-17 05:22:39,210 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 05:22:39,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:22:39,216 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 303 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:39,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1889 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:22:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 05:22:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 169. [2025-03-17 05:22:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 147 states have (on average 1.4081632653061225) internal successors, (207), 147 states have internal predecessors, (207), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:22:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 243 transitions. [2025-03-17 05:22:39,238 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 243 transitions. Word has length 94 [2025-03-17 05:22:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:39,238 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 243 transitions. [2025-03-17 05:22:39,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.684210526315789) internal successors, (108), 22 states have internal predecessors, (108), 9 states have call successors, (27), 3 states have call predecessors, (27), 6 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-17 05:22:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 243 transitions. [2025-03-17 05:22:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:22:39,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:39,240 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:39,256 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-17 05:22:39,440 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,SelfDestructingSolverStorable6 [2025-03-17 05:22:39,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:39,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:39,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1874129760, now seen corresponding path program 1 times [2025-03-17 05:22:39,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:39,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105042547] [2025-03-17 05:22:39,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:39,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:39,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:22:39,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:22:39,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:39,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:40,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:40,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105042547] [2025-03-17 05:22:40,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105042547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:40,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:40,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:22:40,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877218057] [2025-03-17 05:22:40,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:40,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:40,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:40,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:40,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:40,443 INFO L87 Difference]: Start difference. First operand 169 states and 243 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:40,928 INFO L93 Difference]: Finished difference Result 511 states and 740 transitions. [2025-03-17 05:22:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:22:40,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-17 05:22:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:40,930 INFO L225 Difference]: With dead ends: 511 [2025-03-17 05:22:40,932 INFO L226 Difference]: Without dead ends: 386 [2025-03-17 05:22:40,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:22:40,933 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 442 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:40,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1099 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-17 05:22:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 294. [2025-03-17 05:22:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 262 states have (on average 1.4236641221374047) internal successors, (373), 262 states have internal predecessors, (373), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 427 transitions. [2025-03-17 05:22:40,957 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 427 transitions. Word has length 94 [2025-03-17 05:22:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:40,957 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 427 transitions. [2025-03-17 05:22:40,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 427 transitions. [2025-03-17 05:22:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:22:40,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:40,958 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:40,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:22:40,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:40,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:40,962 INFO L85 PathProgramCache]: Analyzing trace with hash -376995490, now seen corresponding path program 1 times [2025-03-17 05:22:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:40,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750302782] [2025-03-17 05:22:40,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:40,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:22:40,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:22:40,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:40,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:41,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:41,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750302782] [2025-03-17 05:22:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750302782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:41,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:41,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:41,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718365931] [2025-03-17 05:22:41,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:41,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:41,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:41,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:41,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:41,033 INFO L87 Difference]: Start difference. First operand 294 states and 427 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:41,158 INFO L93 Difference]: Finished difference Result 742 states and 1081 transitions. [2025-03-17 05:22:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:41,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2025-03-17 05:22:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:41,161 INFO L225 Difference]: With dead ends: 742 [2025-03-17 05:22:41,161 INFO L226 Difference]: Without dead ends: 492 [2025-03-17 05:22:41,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-17 05:22:41,163 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 136 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:41,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 630 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-17 05:22:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 322. [2025-03-17 05:22:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 290 states have (on average 1.4172413793103449) internal successors, (411), 290 states have internal predecessors, (411), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 465 transitions. [2025-03-17 05:22:41,188 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 465 transitions. Word has length 95 [2025-03-17 05:22:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:41,188 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 465 transitions. [2025-03-17 05:22:41,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 465 transitions. [2025-03-17 05:22:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:22:41,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:41,189 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:41,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:22:41,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:41,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1636903712, now seen corresponding path program 1 times [2025-03-17 05:22:41,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:41,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433761101] [2025-03-17 05:22:41,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:41,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:41,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:22:41,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:22:41,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:41,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:41,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433761101] [2025-03-17 05:22:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433761101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:41,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237305790] [2025-03-17 05:22:41,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:41,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:41,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:41,259 INFO L87 Difference]: Start difference. First operand 322 states and 465 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:41,390 INFO L93 Difference]: Finished difference Result 758 states and 1096 transitions. [2025-03-17 05:22:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2025-03-17 05:22:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:41,393 INFO L225 Difference]: With dead ends: 758 [2025-03-17 05:22:41,393 INFO L226 Difference]: Without dead ends: 480 [2025-03-17 05:22:41,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:41,394 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 123 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:41,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 744 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-17 05:22:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 322. [2025-03-17 05:22:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 290 states have (on average 1.410344827586207) internal successors, (409), 290 states have internal predecessors, (409), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 463 transitions. [2025-03-17 05:22:41,419 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 463 transitions. Word has length 95 [2025-03-17 05:22:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:41,420 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 463 transitions. [2025-03-17 05:22:41,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 463 transitions. [2025-03-17 05:22:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:22:41,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:41,421 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:41,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:22:41,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:41,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2079049507, now seen corresponding path program 1 times [2025-03-17 05:22:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:41,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283122866] [2025-03-17 05:22:41,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:41,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:22:41,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:22:41,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:41,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:41,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:41,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283122866] [2025-03-17 05:22:41,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283122866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:41,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:41,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:22:41,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520837136] [2025-03-17 05:22:41,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:41,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:22:41,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:41,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:22:41,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:22:41,788 INFO L87 Difference]: Start difference. First operand 322 states and 463 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:42,726 INFO L93 Difference]: Finished difference Result 990 states and 1430 transitions. [2025-03-17 05:22:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:22:42,727 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-03-17 05:22:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:42,731 INFO L225 Difference]: With dead ends: 990 [2025-03-17 05:22:42,731 INFO L226 Difference]: Without dead ends: 712 [2025-03-17 05:22:42,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:22:42,734 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 475 mSDsluCounter, 2329 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:42,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 2599 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:22:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-17 05:22:42,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 358. [2025-03-17 05:22:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 326 states have (on average 1.4202453987730062) internal successors, (463), 326 states have internal predecessors, (463), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 517 transitions. [2025-03-17 05:22:42,779 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 517 transitions. Word has length 96 [2025-03-17 05:22:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:42,780 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 517 transitions. [2025-03-17 05:22:42,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 517 transitions. [2025-03-17 05:22:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:22:42,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:42,781 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:42,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:22:42,781 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:42,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash 504490945, now seen corresponding path program 1 times [2025-03-17 05:22:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856750684] [2025-03-17 05:22:42,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:42,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:22:42,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:22:42,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:42,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:43,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856750684] [2025-03-17 05:22:43,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856750684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:43,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:43,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:22:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990249457] [2025-03-17 05:22:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:43,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:22:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:43,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:22:43,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:22:43,164 INFO L87 Difference]: Start difference. First operand 358 states and 517 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:44,057 INFO L93 Difference]: Finished difference Result 1058 states and 1532 transitions. [2025-03-17 05:22:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:22:44,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-03-17 05:22:44,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:44,060 INFO L225 Difference]: With dead ends: 1058 [2025-03-17 05:22:44,060 INFO L226 Difference]: Without dead ends: 744 [2025-03-17 05:22:44,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:22:44,063 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 368 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:44,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 2402 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:22:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-17 05:22:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 384. [2025-03-17 05:22:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 352 states have (on average 1.4346590909090908) internal successors, (505), 352 states have internal predecessors, (505), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 559 transitions. [2025-03-17 05:22:44,089 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 559 transitions. Word has length 96 [2025-03-17 05:22:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:44,089 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 559 transitions. [2025-03-17 05:22:44,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 559 transitions. [2025-03-17 05:22:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:22:44,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:44,090 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:44,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:22:44,090 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:44,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash 507213566, now seen corresponding path program 1 times [2025-03-17 05:22:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967888454] [2025-03-17 05:22:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:44,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:22:44,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:22:44,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:44,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:44,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:44,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967888454] [2025-03-17 05:22:44,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967888454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:44,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:44,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619378665] [2025-03-17 05:22:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:44,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:44,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:44,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:44,272 INFO L87 Difference]: Start difference. First operand 384 states and 559 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:44,355 INFO L93 Difference]: Finished difference Result 856 states and 1251 transitions. [2025-03-17 05:22:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:44,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-03-17 05:22:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:44,358 INFO L225 Difference]: With dead ends: 856 [2025-03-17 05:22:44,358 INFO L226 Difference]: Without dead ends: 516 [2025-03-17 05:22:44,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:44,359 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 72 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:44,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 515 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-17 05:22:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 482. [2025-03-17 05:22:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 450 states have (on average 1.4444444444444444) internal successors, (650), 450 states have internal predecessors, (650), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 704 transitions. [2025-03-17 05:22:44,382 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 704 transitions. Word has length 96 [2025-03-17 05:22:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:44,383 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 704 transitions. [2025-03-17 05:22:44,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 704 transitions. [2025-03-17 05:22:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:22:44,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:44,385 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:44,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:22:44,385 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:44,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1654941, now seen corresponding path program 1 times [2025-03-17 05:22:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007578553] [2025-03-17 05:22:44,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:44,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:22:44,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:22:44,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:44,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:22:44,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:44,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007578553] [2025-03-17 05:22:44,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007578553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:44,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557577646] [2025-03-17 05:22:44,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:44,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:44,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:44,490 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-17 05:22:44,493 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-17 05:22:44,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:22:44,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:22:44,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:44,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:44,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:22:44,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:44,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:44,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557577646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:44,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:44,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:22:44,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547744296] [2025-03-17 05:22:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:44,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:44,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:44,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:22:44,650 INFO L87 Difference]: Start difference. First operand 482 states and 704 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:44,695 INFO L93 Difference]: Finished difference Result 925 states and 1355 transitions. [2025-03-17 05:22:44,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-03-17 05:22:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:44,698 INFO L225 Difference]: With dead ends: 925 [2025-03-17 05:22:44,698 INFO L226 Difference]: Without dead ends: 487 [2025-03-17 05:22:44,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 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-17 05:22:44,699 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:44,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-17 05:22:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2025-03-17 05:22:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 455 states have (on average 1.4395604395604396) internal successors, (655), 455 states have internal predecessors, (655), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 709 transitions. [2025-03-17 05:22:44,720 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 709 transitions. Word has length 96 [2025-03-17 05:22:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:44,720 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 709 transitions. [2025-03-17 05:22:44,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 709 transitions. [2025-03-17 05:22:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 05:22:44,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:44,721 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:44,729 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-17 05:22:44,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:44,925 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:44,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:44,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2132834712, now seen corresponding path program 1 times [2025-03-17 05:22:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:44,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461965377] [2025-03-17 05:22:44,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:44,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 05:22:44,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 05:22:44,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:44,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:45,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:45,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461965377] [2025-03-17 05:22:45,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461965377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:45,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:45,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:22:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289085810] [2025-03-17 05:22:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:45,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:22:45,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:45,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:22:45,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:45,211 INFO L87 Difference]: Start difference. First operand 487 states and 709 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:45,867 INFO L93 Difference]: Finished difference Result 1353 states and 1953 transitions. [2025-03-17 05:22:45,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:22:45,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-03-17 05:22:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:45,872 INFO L225 Difference]: With dead ends: 1353 [2025-03-17 05:22:45,872 INFO L226 Difference]: Without dead ends: 904 [2025-03-17 05:22:45,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:22:45,874 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 334 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:45,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 2116 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:22:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-03-17 05:22:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 490. [2025-03-17 05:22:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 458 states have (on average 1.443231441048035) internal successors, (661), 458 states have internal predecessors, (661), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 715 transitions. [2025-03-17 05:22:45,901 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 715 transitions. Word has length 97 [2025-03-17 05:22:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:45,902 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 715 transitions. [2025-03-17 05:22:45,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 715 transitions. [2025-03-17 05:22:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 05:22:45,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:45,903 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:45,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:22:45,903 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:45,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1451926440, now seen corresponding path program 1 times [2025-03-17 05:22:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835204020] [2025-03-17 05:22:45,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:45,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 05:22:45,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 05:22:45,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:45,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:46,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835204020] [2025-03-17 05:22:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835204020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:46,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:46,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:22:46,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516213964] [2025-03-17 05:22:46,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:46,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:22:46,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:46,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:22:46,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:46,177 INFO L87 Difference]: Start difference. First operand 490 states and 715 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:46,786 INFO L93 Difference]: Finished difference Result 1600 states and 2329 transitions. [2025-03-17 05:22:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:22:46,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-03-17 05:22:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:46,791 INFO L225 Difference]: With dead ends: 1600 [2025-03-17 05:22:46,793 INFO L226 Difference]: Without dead ends: 1148 [2025-03-17 05:22:46,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:22:46,795 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 352 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:46,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1810 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:22:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-17 05:22:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 589. [2025-03-17 05:22:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 557 states have (on average 1.466786355475763) internal successors, (817), 557 states have internal predecessors, (817), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 871 transitions. [2025-03-17 05:22:46,818 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 871 transitions. Word has length 97 [2025-03-17 05:22:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:46,819 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 871 transitions. [2025-03-17 05:22:46,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 871 transitions. [2025-03-17 05:22:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 05:22:46,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:46,820 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:46,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:22:46,820 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:46,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2146206920, now seen corresponding path program 1 times [2025-03-17 05:22:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737253573] [2025-03-17 05:22:46,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:46,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:22:46,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:22:46,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:46,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737253573] [2025-03-17 05:22:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737253573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:46,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:46,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:22:46,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521917529] [2025-03-17 05:22:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:46,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:22:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:46,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:22:46,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:46,928 INFO L87 Difference]: Start difference. First operand 589 states and 871 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:47,083 INFO L93 Difference]: Finished difference Result 1309 states and 1932 transitions. [2025-03-17 05:22:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:22:47,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-17 05:22:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:47,086 INFO L225 Difference]: With dead ends: 1309 [2025-03-17 05:22:47,086 INFO L226 Difference]: Without dead ends: 764 [2025-03-17 05:22:47,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:22:47,089 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 140 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:47,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 679 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-17 05:22:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 595. [2025-03-17 05:22:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 563 states have (on average 1.4511545293072825) internal successors, (817), 563 states have internal predecessors, (817), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:22:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 871 transitions. [2025-03-17 05:22:47,110 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 871 transitions. Word has length 98 [2025-03-17 05:22:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:47,110 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 871 transitions. [2025-03-17 05:22:47,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 871 transitions. [2025-03-17 05:22:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 05:22:47,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:47,111 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:47,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:22:47,111 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:47,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:47,112 INFO L85 PathProgramCache]: Analyzing trace with hash 566286612, now seen corresponding path program 1 times [2025-03-17 05:22:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193494667] [2025-03-17 05:22:47,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:47,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:22:47,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:22:47,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:47,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:47,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193494667] [2025-03-17 05:22:47,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193494667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:47,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:47,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:22:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347206302] [2025-03-17 05:22:47,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:47,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:22:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:47,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:22:47,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:22:47,355 INFO L87 Difference]: Start difference. First operand 595 states and 871 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:47,876 INFO L93 Difference]: Finished difference Result 1812 states and 2629 transitions. [2025-03-17 05:22:47,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:22:47,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-17 05:22:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:47,881 INFO L225 Difference]: With dead ends: 1812 [2025-03-17 05:22:47,882 INFO L226 Difference]: Without dead ends: 1261 [2025-03-17 05:22:47,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:22:47,883 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 331 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:47,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1259 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-03-17 05:22:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1245. [2025-03-17 05:22:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1175 states have (on average 1.4280851063829787) internal successors, (1678), 1179 states have internal predecessors, (1678), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:22:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1796 transitions. [2025-03-17 05:22:47,921 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1796 transitions. Word has length 98 [2025-03-17 05:22:47,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:47,922 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1796 transitions. [2025-03-17 05:22:47,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1796 transitions. [2025-03-17 05:22:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 05:22:47,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:47,923 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:47,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:22:47,923 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:47,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1973470691, now seen corresponding path program 1 times [2025-03-17 05:22:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779089668] [2025-03-17 05:22:47,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:47,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:47,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:22:47,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:22:47,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:47,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:48,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:48,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779089668] [2025-03-17 05:22:48,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779089668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:48,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:48,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:22:48,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383767209] [2025-03-17 05:22:48,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:48,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:48,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:48,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:48,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:48,062 INFO L87 Difference]: Start difference. First operand 1245 states and 1796 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:48,320 INFO L93 Difference]: Finished difference Result 2671 states and 3846 transitions. [2025-03-17 05:22:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:22:48,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-17 05:22:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:48,326 INFO L225 Difference]: With dead ends: 2671 [2025-03-17 05:22:48,327 INFO L226 Difference]: Without dead ends: 1458 [2025-03-17 05:22:48,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:48,329 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 130 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:48,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1227 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-03-17 05:22:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1242. [2025-03-17 05:22:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1172 states have (on average 1.424061433447099) internal successors, (1669), 1176 states have internal predecessors, (1669), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:22:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1787 transitions. [2025-03-17 05:22:48,371 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1787 transitions. Word has length 98 [2025-03-17 05:22:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:48,371 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1787 transitions. [2025-03-17 05:22:48,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1787 transitions. [2025-03-17 05:22:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 05:22:48,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:48,374 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:48,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:22:48,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:48,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash -910245390, now seen corresponding path program 1 times [2025-03-17 05:22:48,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:48,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766039340] [2025-03-17 05:22:48,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:48,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:22:48,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:22:48,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:48,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:48,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766039340] [2025-03-17 05:22:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766039340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:22:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236774840] [2025-03-17 05:22:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:48,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:22:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:48,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:22:48,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:22:48,637 INFO L87 Difference]: Start difference. First operand 1242 states and 1787 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:49,369 INFO L93 Difference]: Finished difference Result 2903 states and 4151 transitions. [2025-03-17 05:22:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:22:49,371 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-17 05:22:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:49,377 INFO L225 Difference]: With dead ends: 2903 [2025-03-17 05:22:49,377 INFO L226 Difference]: Without dead ends: 1705 [2025-03-17 05:22:49,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:22:49,382 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 472 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:49,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 2342 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:22:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2025-03-17 05:22:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1254. [2025-03-17 05:22:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1184 states have (on average 1.4222972972972974) internal successors, (1684), 1188 states have internal predecessors, (1684), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:22:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1802 transitions. [2025-03-17 05:22:49,463 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1802 transitions. Word has length 98 [2025-03-17 05:22:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:49,463 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1802 transitions. [2025-03-17 05:22:49,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1802 transitions. [2025-03-17 05:22:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 05:22:49,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:49,465 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:49,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:22:49,466 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:49,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:49,467 INFO L85 PathProgramCache]: Analyzing trace with hash 496938689, now seen corresponding path program 1 times [2025-03-17 05:22:49,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:49,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928558421] [2025-03-17 05:22:49,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:49,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:49,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:22:49,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:22:49,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:49,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:49,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:49,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928558421] [2025-03-17 05:22:49,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928558421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:49,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:49,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:22:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236263999] [2025-03-17 05:22:49,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:49,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:49,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:49,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:49,641 INFO L87 Difference]: Start difference. First operand 1254 states and 1802 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:49,985 INFO L93 Difference]: Finished difference Result 3013 states and 4322 transitions. [2025-03-17 05:22:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:22:49,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-17 05:22:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:49,994 INFO L225 Difference]: With dead ends: 3013 [2025-03-17 05:22:49,994 INFO L226 Difference]: Without dead ends: 1803 [2025-03-17 05:22:49,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:49,998 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 130 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:49,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1598 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-03-17 05:22:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1293. [2025-03-17 05:22:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1223 states have (on average 1.4260016353229763) internal successors, (1744), 1227 states have internal predecessors, (1744), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:22:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1862 transitions. [2025-03-17 05:22:50,070 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1862 transitions. Word has length 98 [2025-03-17 05:22:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:50,070 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1862 transitions. [2025-03-17 05:22:50,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1862 transitions. [2025-03-17 05:22:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 05:22:50,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:50,074 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:50,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:22:50,074 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:50,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash -88676081, now seen corresponding path program 1 times [2025-03-17 05:22:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172355850] [2025-03-17 05:22:50,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:50,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:22:50,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:22:50,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:50,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:50,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172355850] [2025-03-17 05:22:50,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172355850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:50,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:22:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821477120] [2025-03-17 05:22:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:50,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:22:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:50,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:22:50,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:22:50,342 INFO L87 Difference]: Start difference. First operand 1293 states and 1862 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:50,905 INFO L93 Difference]: Finished difference Result 3289 states and 4712 transitions. [2025-03-17 05:22:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:22:50,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-17 05:22:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:50,913 INFO L225 Difference]: With dead ends: 3289 [2025-03-17 05:22:50,914 INFO L226 Difference]: Without dead ends: 2040 [2025-03-17 05:22:50,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:22:50,920 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 343 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:50,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1346 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2025-03-17 05:22:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1288. [2025-03-17 05:22:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1218 states have (on average 1.4137931034482758) internal successors, (1722), 1222 states have internal predecessors, (1722), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:22:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1840 transitions. [2025-03-17 05:22:50,980 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1840 transitions. Word has length 98 [2025-03-17 05:22:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:50,981 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1840 transitions. [2025-03-17 05:22:50,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1840 transitions. [2025-03-17 05:22:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:22:50,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:50,983 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:50,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:22:50,983 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:50,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:50,984 INFO L85 PathProgramCache]: Analyzing trace with hash 714261065, now seen corresponding path program 1 times [2025-03-17 05:22:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:50,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136464983] [2025-03-17 05:22:50,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:50,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:22:51,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:22:51,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:51,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:51,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136464983] [2025-03-17 05:22:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136464983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:51,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:51,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:22:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795202174] [2025-03-17 05:22:51,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:51,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:22:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:51,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:22:51,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:51,257 INFO L87 Difference]: Start difference. First operand 1288 states and 1840 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:51,877 INFO L93 Difference]: Finished difference Result 3249 states and 4613 transitions. [2025-03-17 05:22:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:22:51,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-17 05:22:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:51,887 INFO L225 Difference]: With dead ends: 3249 [2025-03-17 05:22:51,887 INFO L226 Difference]: Without dead ends: 2005 [2025-03-17 05:22:51,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:22:51,891 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 327 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:51,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 2063 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:22:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2025-03-17 05:22:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1321. [2025-03-17 05:22:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1251 states have (on average 1.4124700239808154) internal successors, (1767), 1255 states have internal predecessors, (1767), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:22:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1885 transitions. [2025-03-17 05:22:51,960 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1885 transitions. Word has length 99 [2025-03-17 05:22:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1885 transitions. [2025-03-17 05:22:51,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1885 transitions. [2025-03-17 05:22:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:22:51,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:51,962 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:51,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:22:51,963 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:51,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash 168323273, now seen corresponding path program 1 times [2025-03-17 05:22:51,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710931686] [2025-03-17 05:22:51,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:51,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:51,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:22:51,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:22:51,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:51,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:52,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710931686] [2025-03-17 05:22:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710931686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:52,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:52,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:22:52,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536796413] [2025-03-17 05:22:52,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:52,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:22:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:52,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:22:52,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:52,094 INFO L87 Difference]: Start difference. First operand 1321 states and 1885 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:52,236 INFO L93 Difference]: Finished difference Result 2518 states and 3596 transitions. [2025-03-17 05:22:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:52,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-17 05:22:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:52,246 INFO L225 Difference]: With dead ends: 2518 [2025-03-17 05:22:52,246 INFO L226 Difference]: Without dead ends: 1241 [2025-03-17 05:22:52,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:52,249 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 112 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:52,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 338 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-17 05:22:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-03-17 05:22:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1169 states have (on average 1.4106073567151411) internal successors, (1649), 1173 states have internal predecessors, (1649), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:22:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1767 transitions. [2025-03-17 05:22:52,300 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1767 transitions. Word has length 99 [2025-03-17 05:22:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:52,300 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1767 transitions. [2025-03-17 05:22:52,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1767 transitions. [2025-03-17 05:22:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:22:52,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:52,301 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:52,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:22:52,302 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:52,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash 115367133, now seen corresponding path program 1 times [2025-03-17 05:22:52,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:52,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201083325] [2025-03-17 05:22:52,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:52,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:52,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:22:52,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:22:52,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:52,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:52,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201083325] [2025-03-17 05:22:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201083325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:52,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:52,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:22:52,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483761224] [2025-03-17 05:22:52,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:52,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:52,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:52,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:52,493 INFO L87 Difference]: Start difference. First operand 1239 states and 1767 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:52,875 INFO L93 Difference]: Finished difference Result 2968 states and 4227 transitions. [2025-03-17 05:22:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:22:52,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-17 05:22:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:52,882 INFO L225 Difference]: With dead ends: 2968 [2025-03-17 05:22:52,882 INFO L226 Difference]: Without dead ends: 1773 [2025-03-17 05:22:52,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:52,886 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 129 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:52,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1605 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-03-17 05:22:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1240. [2025-03-17 05:22:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1170 states have (on average 1.4085470085470086) internal successors, (1648), 1174 states have internal predecessors, (1648), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:22:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1766 transitions. [2025-03-17 05:22:52,947 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1766 transitions. Word has length 99 [2025-03-17 05:22:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:52,947 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1766 transitions. [2025-03-17 05:22:52,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1766 transitions. [2025-03-17 05:22:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:22:52,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:52,948 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:52,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:22:52,948 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:52,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash -642149076, now seen corresponding path program 1 times [2025-03-17 05:22:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:52,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414434907] [2025-03-17 05:22:52,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:52,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:52,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:22:52,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:22:52,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:52,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:53,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:53,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414434907] [2025-03-17 05:22:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414434907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:22:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784067826] [2025-03-17 05:22:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:53,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:22:53,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:53,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:22:53,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:53,039 INFO L87 Difference]: Start difference. First operand 1240 states and 1766 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:53,149 INFO L93 Difference]: Finished difference Result 2438 states and 3473 transitions. [2025-03-17 05:22:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-17 05:22:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:53,156 INFO L225 Difference]: With dead ends: 2438 [2025-03-17 05:22:53,157 INFO L226 Difference]: Without dead ends: 1242 [2025-03-17 05:22:53,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:53,158 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 99 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:53,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 337 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-03-17 05:22:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1191. [2025-03-17 05:22:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1121 states have (on average 1.3987511150758252) internal successors, (1568), 1125 states have internal predecessors, (1568), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 05:22:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1686 transitions. [2025-03-17 05:22:53,200 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1686 transitions. Word has length 99 [2025-03-17 05:22:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:53,200 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1686 transitions. [2025-03-17 05:22:53,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1686 transitions. [2025-03-17 05:22:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:22:53,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:53,202 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:53,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:22:53,202 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:53,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1224506925, now seen corresponding path program 1 times [2025-03-17 05:22:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506454215] [2025-03-17 05:22:53,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:53,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:22:53,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:22:53,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:53,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:53,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506454215] [2025-03-17 05:22:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506454215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:53,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:22:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719852509] [2025-03-17 05:22:53,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:53,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:22:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:53,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:22:53,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:22:53,408 INFO L87 Difference]: Start difference. First operand 1191 states and 1686 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:53,859 INFO L93 Difference]: Finished difference Result 3833 states and 5433 transitions. [2025-03-17 05:22:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:22:53,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-17 05:22:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:53,871 INFO L225 Difference]: With dead ends: 3833 [2025-03-17 05:22:53,871 INFO L226 Difference]: Without dead ends: 2634 [2025-03-17 05:22:53,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:22:53,874 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 280 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:53,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1542 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-03-17 05:22:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1738. [2025-03-17 05:22:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1648 states have (on average 1.3992718446601942) internal successors, (2306), 1652 states have internal predecessors, (2306), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:22:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2460 transitions. [2025-03-17 05:22:53,936 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2460 transitions. Word has length 100 [2025-03-17 05:22:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:53,937 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2460 transitions. [2025-03-17 05:22:53,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:53,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2460 transitions. [2025-03-17 05:22:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:22:53,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:53,938 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:53,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:22:53,939 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:53,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:53,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1501710040, now seen corresponding path program 1 times [2025-03-17 05:22:53,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:53,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913987698] [2025-03-17 05:22:53,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:53,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:53,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:22:53,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:22:53,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:53,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:54,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:54,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913987698] [2025-03-17 05:22:54,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913987698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:54,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:54,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:22:54,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780218040] [2025-03-17 05:22:54,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:54,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:22:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:54,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:22:54,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:22:54,118 INFO L87 Difference]: Start difference. First operand 1738 states and 2460 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:54,502 INFO L93 Difference]: Finished difference Result 4581 states and 6478 transitions. [2025-03-17 05:22:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:22:54,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-17 05:22:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:54,516 INFO L225 Difference]: With dead ends: 4581 [2025-03-17 05:22:54,516 INFO L226 Difference]: Without dead ends: 2887 [2025-03-17 05:22:54,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:22:54,521 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 462 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:54,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1316 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2025-03-17 05:22:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1816. [2025-03-17 05:22:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1726 states have (on average 1.402665121668598) internal successors, (2421), 1730 states have internal predecessors, (2421), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:22:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2575 transitions. [2025-03-17 05:22:54,614 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2575 transitions. Word has length 100 [2025-03-17 05:22:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:54,614 INFO L471 AbstractCegarLoop]: Abstraction has 1816 states and 2575 transitions. [2025-03-17 05:22:54,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2575 transitions. [2025-03-17 05:22:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:22:54,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:54,617 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:54,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:22:54,617 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:54,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash -787019535, now seen corresponding path program 1 times [2025-03-17 05:22:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743789802] [2025-03-17 05:22:54,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:54,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:22:54,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:22:54,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:54,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:22:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:54,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743789802] [2025-03-17 05:22:54,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743789802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546720389] [2025-03-17 05:22:54,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:54,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:54,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:54,732 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:22:54,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:22:54,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:22:54,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:22:54,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:54,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:22:54,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:54,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:54,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546720389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:54,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:22:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330410545] [2025-03-17 05:22:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:54,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:54,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:54,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:22:54,911 INFO L87 Difference]: Start difference. First operand 1816 states and 2575 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:54,967 INFO L93 Difference]: Finished difference Result 3612 states and 5122 transitions. [2025-03-17 05:22:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:54,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-17 05:22:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:54,972 INFO L225 Difference]: With dead ends: 3612 [2025-03-17 05:22:54,973 INFO L226 Difference]: Without dead ends: 1840 [2025-03-17 05:22:54,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 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-17 05:22:54,976 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:54,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2025-03-17 05:22:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2025-03-17 05:22:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1750 states have (on average 1.3971428571428572) internal successors, (2445), 1754 states have internal predecessors, (2445), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:22:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2599 transitions. [2025-03-17 05:22:55,022 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2599 transitions. Word has length 100 [2025-03-17 05:22:55,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:55,022 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2599 transitions. [2025-03-17 05:22:55,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2599 transitions. [2025-03-17 05:22:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:22:55,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:55,023 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:55,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:22:55,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 05:22:55,224 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:55,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1747044498, now seen corresponding path program 1 times [2025-03-17 05:22:55,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:55,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124923785] [2025-03-17 05:22:55,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:55,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:22:55,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:22:55,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:55,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:55,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:55,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124923785] [2025-03-17 05:22:55,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124923785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:55,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:55,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:22:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421056932] [2025-03-17 05:22:55,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:55,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:22:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:55,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:22:55,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:22:55,423 INFO L87 Difference]: Start difference. First operand 1840 states and 2599 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:55,952 INFO L93 Difference]: Finished difference Result 3800 states and 5344 transitions. [2025-03-17 05:22:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:22:55,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-17 05:22:55,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:55,960 INFO L225 Difference]: With dead ends: 3800 [2025-03-17 05:22:55,960 INFO L226 Difference]: Without dead ends: 2852 [2025-03-17 05:22:55,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:22:55,963 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 284 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:55,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 2181 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-03-17 05:22:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1849. [2025-03-17 05:22:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1759 states have (on average 1.3985218874360432) internal successors, (2460), 1763 states have internal predecessors, (2460), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:22:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2614 transitions. [2025-03-17 05:22:56,063 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2614 transitions. Word has length 100 [2025-03-17 05:22:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:56,064 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 2614 transitions. [2025-03-17 05:22:56,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2614 transitions. [2025-03-17 05:22:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:22:56,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:56,066 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:22:56,066 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:56,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1786705992, now seen corresponding path program 1 times [2025-03-17 05:22:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:56,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655785897] [2025-03-17 05:22:56,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:56,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:22:56,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:22:56,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:56,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:56,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:56,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655785897] [2025-03-17 05:22:56,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655785897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:56,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:56,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:22:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239356325] [2025-03-17 05:22:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:56,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:22:56,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:56,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:22:56,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:22:56,349 INFO L87 Difference]: Start difference. First operand 1849 states and 2614 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:56,775 INFO L93 Difference]: Finished difference Result 4707 states and 6624 transitions. [2025-03-17 05:22:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:22:56,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2025-03-17 05:22:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:56,782 INFO L225 Difference]: With dead ends: 4707 [2025-03-17 05:22:56,782 INFO L226 Difference]: Without dead ends: 2902 [2025-03-17 05:22:56,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:22:56,785 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 400 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:56,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1476 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2025-03-17 05:22:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1869. [2025-03-17 05:22:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1779 states have (on average 1.398538504777965) internal successors, (2488), 1783 states have internal predecessors, (2488), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:22:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2642 transitions. [2025-03-17 05:22:56,867 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2642 transitions. Word has length 100 [2025-03-17 05:22:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:56,867 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2642 transitions. [2025-03-17 05:22:56,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2642 transitions. [2025-03-17 05:22:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:22:56,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:56,869 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:56,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:22:56,869 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:56,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1196073970, now seen corresponding path program 1 times [2025-03-17 05:22:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322777516] [2025-03-17 05:22:56,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:56,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:22:56,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:22:56,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:56,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:57,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322777516] [2025-03-17 05:22:57,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322777516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:57,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:57,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:22:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134609263] [2025-03-17 05:22:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:57,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:57,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:57,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:57,010 INFO L87 Difference]: Start difference. First operand 1869 states and 2642 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:57,408 INFO L93 Difference]: Finished difference Result 3854 states and 5412 transitions. [2025-03-17 05:22:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:22:57,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-03-17 05:22:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:57,415 INFO L225 Difference]: With dead ends: 3854 [2025-03-17 05:22:57,415 INFO L226 Difference]: Without dead ends: 2895 [2025-03-17 05:22:57,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:22:57,417 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 137 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:57,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1634 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2025-03-17 05:22:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1848. [2025-03-17 05:22:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1758 states have (on average 1.399886234357224) internal successors, (2461), 1762 states have internal predecessors, (2461), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:22:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2615 transitions. [2025-03-17 05:22:57,501 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2615 transitions. Word has length 101 [2025-03-17 05:22:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:57,502 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 2615 transitions. [2025-03-17 05:22:57,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2615 transitions. [2025-03-17 05:22:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:22:57,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:57,504 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:57,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:22:57,505 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:57,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1129531613, now seen corresponding path program 1 times [2025-03-17 05:22:57,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:57,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775521502] [2025-03-17 05:22:57,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:57,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:22:57,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:22:57,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:57,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:57,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:57,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775521502] [2025-03-17 05:22:57,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775521502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:57,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:57,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:22:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789109398] [2025-03-17 05:22:57,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:57,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:22:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:57,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:22:57,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:57,861 INFO L87 Difference]: Start difference. First operand 1848 states and 2615 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:58,375 INFO L93 Difference]: Finished difference Result 4479 states and 6296 transitions. [2025-03-17 05:22:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:22:58,376 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-03-17 05:22:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:58,381 INFO L225 Difference]: With dead ends: 4479 [2025-03-17 05:22:58,381 INFO L226 Difference]: Without dead ends: 2615 [2025-03-17 05:22:58,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:22:58,388 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 553 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:58,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1425 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2025-03-17 05:22:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 1839. [2025-03-17 05:22:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1749 states have (on average 1.3916523727844483) internal successors, (2434), 1753 states have internal predecessors, (2434), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:22:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2588 transitions. [2025-03-17 05:22:58,468 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2588 transitions. Word has length 101 [2025-03-17 05:22:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:58,469 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2588 transitions. [2025-03-17 05:22:58,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2588 transitions. [2025-03-17 05:22:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:22:58,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:58,470 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:58,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:22:58,470 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:58,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:58,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1396814741, now seen corresponding path program 1 times [2025-03-17 05:22:58,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:58,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498548141] [2025-03-17 05:22:58,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:58,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:58,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:22:58,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:22:58,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:58,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:58,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:58,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498548141] [2025-03-17 05:22:58,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498548141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:58,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:58,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:22:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662406319] [2025-03-17 05:22:58,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:58,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:58,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:58,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:58,645 INFO L87 Difference]: Start difference. First operand 1839 states and 2588 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:59,071 INFO L93 Difference]: Finished difference Result 4259 states and 5966 transitions. [2025-03-17 05:22:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:22:59,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-03-17 05:22:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:59,079 INFO L225 Difference]: With dead ends: 4259 [2025-03-17 05:22:59,079 INFO L226 Difference]: Without dead ends: 2446 [2025-03-17 05:22:59,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:22:59,082 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 269 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:59,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1217 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2025-03-17 05:22:59,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 1815. [2025-03-17 05:22:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1725 states have (on average 1.3872463768115941) internal successors, (2393), 1729 states have internal predecessors, (2393), 77 states have call successors, (77), 12 states have call predecessors, (77), 12 states have return successors, (77), 73 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:22:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2547 transitions. [2025-03-17 05:22:59,146 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2547 transitions. Word has length 101 [2025-03-17 05:22:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:59,146 INFO L471 AbstractCegarLoop]: Abstraction has 1815 states and 2547 transitions. [2025-03-17 05:22:59,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2547 transitions. [2025-03-17 05:22:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:22:59,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:59,148 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:59,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:22:59,148 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:59,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1319972646, now seen corresponding path program 1 times [2025-03-17 05:22:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891036298] [2025-03-17 05:22:59,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:59,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:22:59,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:22:59,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:59,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:22:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:59,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891036298] [2025-03-17 05:22:59,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891036298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:59,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:22:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219274998] [2025-03-17 05:22:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:59,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:22:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:59,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:22:59,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:22:59,367 INFO L87 Difference]: Start difference. First operand 1815 states and 2547 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:59,906 INFO L93 Difference]: Finished difference Result 3803 states and 5333 transitions. [2025-03-17 05:22:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:22:59,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-03-17 05:22:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:59,910 INFO L225 Difference]: With dead ends: 3803 [2025-03-17 05:22:59,911 INFO L226 Difference]: Without dead ends: 2032 [2025-03-17 05:22:59,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:22:59,913 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 450 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:59,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1488 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2025-03-17 05:22:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1791. [2025-03-17 05:22:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1697 states have (on average 1.3594578668238066) internal successors, (2307), 1699 states have internal predecessors, (2307), 81 states have call successors, (81), 12 states have call predecessors, (81), 12 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 05:22:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2469 transitions. [2025-03-17 05:22:59,973 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2469 transitions. Word has length 101 [2025-03-17 05:22:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:59,974 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2469 transitions. [2025-03-17 05:22:59,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:22:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2469 transitions. [2025-03-17 05:22:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:22:59,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:59,975 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:22:59,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 05:22:59,975 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:59,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2122222656, now seen corresponding path program 1 times [2025-03-17 05:22:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190015825] [2025-03-17 05:22:59,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:59,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:59,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:22:59,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:22:59,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:59,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:23:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:00,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190015825] [2025-03-17 05:23:00,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190015825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:00,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:00,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:23:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522231075] [2025-03-17 05:23:00,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:00,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:23:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:00,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:23:00,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:23:00,143 INFO L87 Difference]: Start difference. First operand 1791 states and 2469 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:00,309 INFO L93 Difference]: Finished difference Result 3058 states and 4256 transitions. [2025-03-17 05:23:00,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:23:00,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2025-03-17 05:23:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:00,313 INFO L225 Difference]: With dead ends: 3058 [2025-03-17 05:23:00,313 INFO L226 Difference]: Without dead ends: 1318 [2025-03-17 05:23:00,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:23:00,315 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 142 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:00,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 716 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-03-17 05:23:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1298. [2025-03-17 05:23:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1204 states have (on average 1.3712624584717608) internal successors, (1651), 1206 states have internal predecessors, (1651), 81 states have call successors, (81), 12 states have call predecessors, (81), 12 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 05:23:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1813 transitions. [2025-03-17 05:23:00,367 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1813 transitions. Word has length 102 [2025-03-17 05:23:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:00,367 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 1813 transitions. [2025-03-17 05:23:00,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1813 transitions. [2025-03-17 05:23:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:23:00,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:00,368 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:00,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 05:23:00,368 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:00,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash 410456286, now seen corresponding path program 1 times [2025-03-17 05:23:00,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:00,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88320550] [2025-03-17 05:23:00,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:00,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:00,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:23:00,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:23:00,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:00,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:23:00,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:00,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88320550] [2025-03-17 05:23:00,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88320550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:00,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:00,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:23:00,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437953324] [2025-03-17 05:23:00,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:00,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:23:00,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:00,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:23:00,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:23:00,605 INFO L87 Difference]: Start difference. First operand 1298 states and 1813 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:00,886 INFO L93 Difference]: Finished difference Result 2533 states and 3537 transitions. [2025-03-17 05:23:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:23:00,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2025-03-17 05:23:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:00,890 INFO L225 Difference]: With dead ends: 2533 [2025-03-17 05:23:00,890 INFO L226 Difference]: Without dead ends: 1286 [2025-03-17 05:23:00,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:00,893 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 127 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:00,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 794 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:23:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-03-17 05:23:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 780. [2025-03-17 05:23:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 706 states have (on average 1.358356940509915) internal successors, (959), 708 states have internal predecessors, (959), 63 states have call successors, (63), 10 states have call predecessors, (63), 10 states have return successors, (63), 61 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 05:23:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1085 transitions. [2025-03-17 05:23:00,953 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1085 transitions. Word has length 102 [2025-03-17 05:23:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:00,954 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1085 transitions. [2025-03-17 05:23:00,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1085 transitions. [2025-03-17 05:23:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:23:00,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:00,954 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:00,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 05:23:00,955 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:00,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1291127340, now seen corresponding path program 1 times [2025-03-17 05:23:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:00,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094198852] [2025-03-17 05:23:00,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:00,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:23:00,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:23:00,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:00,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:23:01,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:01,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094198852] [2025-03-17 05:23:01,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094198852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:01,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:01,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:23:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866600546] [2025-03-17 05:23:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:01,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:23:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:01,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:23:01,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:23:01,001 INFO L87 Difference]: Start difference. First operand 780 states and 1085 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:01,054 INFO L93 Difference]: Finished difference Result 1522 states and 2122 transitions. [2025-03-17 05:23:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:23:01,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2025-03-17 05:23:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:01,057 INFO L225 Difference]: With dead ends: 1522 [2025-03-17 05:23:01,057 INFO L226 Difference]: Without dead ends: 786 [2025-03-17 05:23:01,058 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-17 05:23:01,058 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:01,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-17 05:23:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2025-03-17 05:23:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 712 states have (on average 1.3553370786516854) internal successors, (965), 714 states have internal predecessors, (965), 63 states have call successors, (63), 10 states have call predecessors, (63), 10 states have return successors, (63), 61 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 05:23:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1091 transitions. [2025-03-17 05:23:01,099 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1091 transitions. Word has length 102 [2025-03-17 05:23:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:01,100 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1091 transitions. [2025-03-17 05:23:01,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1091 transitions. [2025-03-17 05:23:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:23:01,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:01,101 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:01,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 05:23:01,101 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:01,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:01,101 INFO L85 PathProgramCache]: Analyzing trace with hash 175691085, now seen corresponding path program 1 times [2025-03-17 05:23:01,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349472739] [2025-03-17 05:23:01,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:01,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:23:01,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:23:01,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:01,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:23:01,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:01,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349472739] [2025-03-17 05:23:01,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349472739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:01,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:01,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:23:01,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100303293] [2025-03-17 05:23:01,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:01,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:23:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:23:01,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:23:01,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:23:01,524 INFO L87 Difference]: Start difference. First operand 786 states and 1091 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:01,912 INFO L93 Difference]: Finished difference Result 800 states and 1106 transitions. [2025-03-17 05:23:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:23:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2025-03-17 05:23:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:01,921 INFO L225 Difference]: With dead ends: 800 [2025-03-17 05:23:01,921 INFO L226 Difference]: Without dead ends: 798 [2025-03-17 05:23:01,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:23:01,925 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 330 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:01,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1150 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:23:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-17 05:23:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 795. [2025-03-17 05:23:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 721 states have (on average 1.3509015256588073) internal successors, (974), 723 states have internal predecessors, (974), 63 states have call successors, (63), 10 states have call predecessors, (63), 10 states have return successors, (63), 61 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 05:23:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1100 transitions. [2025-03-17 05:23:02,006 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1100 transitions. Word has length 102 [2025-03-17 05:23:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:02,006 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1100 transitions. [2025-03-17 05:23:02,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1100 transitions. [2025-03-17 05:23:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:23:02,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:02,007 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:02,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 05:23:02,007 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:02,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:02,007 INFO L85 PathProgramCache]: Analyzing trace with hash 176614606, now seen corresponding path program 1 times [2025-03-17 05:23:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:02,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368475624] [2025-03-17 05:23:02,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:02,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:02,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:23:02,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:23:02,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:02,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:23:02,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:23:02,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:23:02,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:23:02,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:02,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:23:02,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:23:02,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:23:02,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:23:02,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 05:23:02,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:02,224 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:23:02,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:23:02 BoogieIcfgContainer [2025-03-17 05:23:02,229 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:23:02,230 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:23:02,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:23:02,230 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:23:02,230 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:33" (3/4) ... [2025-03-17 05:23:02,232 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:23:02,233 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:23:02,234 INFO L158 Benchmark]: Toolchain (without parser) took 29344.52ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 111.8MB in the beginning and 514.0MB in the end (delta: -402.2MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2025-03-17 05:23:02,235 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:02,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.85ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:23:02,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.43ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 93.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:23:02,236 INFO L158 Benchmark]: Boogie Preprocessor took 91.28ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 88.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:23:02,236 INFO L158 Benchmark]: IcfgBuilder took 650.16ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 52.2MB in the end (delta: 36.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:23:02,236 INFO L158 Benchmark]: TraceAbstraction took 28236.82ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 51.3MB in the beginning and 514.1MB in the end (delta: -462.8MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2025-03-17 05:23:02,236 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 629.1MB. Free memory was 514.1MB in the beginning and 514.0MB in the end (delta: 132.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:23:02,237 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.24ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.85ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.43ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 93.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 91.28ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 88.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 650.16ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 52.2MB in the end (delta: 36.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28236.82ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 51.3MB in the beginning and 514.1MB in the end (delta: -462.8MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 629.1MB. Free memory was 514.1MB in the beginning and 514.0MB in the end (delta: 132.2kB). 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 someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someUnaryDOUBLEoperation at line 26. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L25-L27] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -8; [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L84] EXPR signed_long_int_Array_0[0] [L84] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L70] float_Array_0[0] = __VERIFIER_nondet_float() [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] float_Array_0[2] = __VERIFIER_nondet_float() [L73] EXPR float_Array_0[2] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F [L73] EXPR float_Array_0[2] [L73] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] float_Array_0[3] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[3] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F [L75] EXPR float_Array_0[3] [L75] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L41] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L41] COND FALSE !(signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) [L44] EXPR unsigned_char_Array_0[1] [L44] signed_long_int_Array_0[1] = unsigned_char_Array_0[1] [L45] EXPR unsigned_char_Array_0[1] [L45] unsigned char stepLocal_1 = unsigned_char_Array_0[1]; [L46] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L46] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L47] EXPR unsigned_char_Array_0[0] [L47] signed_long_int_Array_0[0] = unsigned_char_Array_0[0] [L55] EXPR float_Array_0[3] [L55] float_Array_0[4] = float_Array_0[3] [L56] EXPR signed_long_int_Array_0[0] [L56] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] EXPR signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=200, unsigned_char_Array_0={8:0}] [L56] EXPR signed_long_int_Array_0[1] [L56] signed long int stepLocal_0 = (signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]; [L57] COND FALSE !(stepLocal_0 < -1) [L60] EXPR unsigned_char_Array_0[1] [L60] EXPR unsigned_char_Array_0[1] [L60] signed_short_int_Array_0[1] = (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) [L62] EXPR unsigned_char_Array_0[1] [L62] EXPR signed_long_int_Array_0[0] [L62] EXPR unsigned_char_Array_0[1] [L62] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L62] EXPR unsigned_char_Array_0[1] | signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=200, unsigned_char_Array_0={8:0}] [L62] EXPR signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=200, unsigned_char_Array_0={8:0}] [L62] COND FALSE !(unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])))) [L87] EXPR signed_short_int_Array_0[1] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR (((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1) [L87] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1 [L87] EXPR (signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1) [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[1] | signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1 [L87] EXPR (unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1])))) [L87] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))) [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR unsigned_char_Array_0[0] [L87] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3])) [L87] EXPR float_Array_0[4] [L87] EXPR float_Array_0[3] [L87] EXPR (((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87-L88] return ((((((((signed_long_int_Array_0[0] ^ unsigned_char_Array_0[1]) + signed_long_int_Array_0[1]) < -1) ? (signed_short_int_Array_0[1] == ((signed short int) 8)) : (signed_short_int_Array_0[1] == ((signed short int) (128 - (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))))) && ((signed_short_int_Array_0[0] < last_1_signed_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 1))) : 1)) && ((unsigned_char_Array_0[1] < (signed_long_int_Array_0[0] & (unsigned_char_Array_0[1] | signed_long_int_Array_0[1]))) ? (float_Array_0[1] == ((float) ((((float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) < 0 ) ? -(float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])) : (float_Array_0[2] + (float_Array_0[3] - float_Array_0[0])))))) : 1)) && ((! BOOL_unsigned_char_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : ((unsigned_char_Array_0[1] > (unsigned_char_Array_0[1] + unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) : (signed_long_int_Array_0[0] == ((signed long int) signed_long_int_Array_0[1]))))) && (float_Array_0[4] == ((float) float_Array_0[3]))) && (signed_long_int_Array_0[1] == ((signed long int) unsigned_char_Array_0[1])) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 160 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.1s, OverallIterations: 40, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8666 SdHoareTripleChecker+Valid, 10.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8666 mSDsluCounter, 45607 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38044 mSDsCounter, 766 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16268 IncrementalHoareTripleChecker+Invalid, 17034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 766 mSolverCounterUnsat, 7563 mSDtfsCounter, 16268 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1000 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1869occurred in iteration=31, InterpolantAutomatonStates: 362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 13012 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 4302 NumberOfCodeBlocks, 4302 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 4250 ConstructedInterpolants, 0 QuantifiedInterpolants, 13256 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1499 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 44 InterpolantComputations, 38 PerfectInterpolantSequences, 6245/6336 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-17 05:23:02,260 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-a_file-33.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 281fe865ae002c37b4eaf841ade310d12dfc0d84dbffda3840d13e21dda564dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:23:04,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:23:04,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:23:04,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:23:04,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:23:04,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:23:04,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:23:04,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:23:04,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:23:04,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:23:04,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:23:04,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:23:04,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:23:04,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:23:04,491 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:23:04,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:23:04,492 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:23:04,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:23:04,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:23:04,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:23:04,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:23:04,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:23:04,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:04,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:23:04,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:23:04,494 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:23:04,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:23:04,494 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:23:04,494 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:04,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:23:04,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:23:04,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:23:04,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:23:04,494 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 -> 281fe865ae002c37b4eaf841ade310d12dfc0d84dbffda3840d13e21dda564dc [2025-03-17 05:23:04,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:23:04,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:23:04,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:23:04,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:23:04,781 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:23:04,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-33.i [2025-03-17 05:23:06,125 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f08b1ab1/82e62b451f524c6486328ce4dec293f8/FLAG2f04ec398 [2025-03-17 05:23:06,320 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:23:06,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-33.i [2025-03-17 05:23:06,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f08b1ab1/82e62b451f524c6486328ce4dec293f8/FLAG2f04ec398 [2025-03-17 05:23:06,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f08b1ab1/82e62b451f524c6486328ce4dec293f8 [2025-03-17 05:23:06,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:23:06,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:23:06,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:06,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:23:06,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:23:06,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319f1c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06, skipping insertion in model container [2025-03-17 05:23:06,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:23:06,539 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-a_file-33.i[916,929] [2025-03-17 05:23:06,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:06,609 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:23:06,619 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-a_file-33.i[916,929] [2025-03-17 05:23:06,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:06,665 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:23:06,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06 WrapperNode [2025-03-17 05:23:06,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:06,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:06,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:23:06,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:23:06,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,728 INFO L138 Inliner]: procedures = 36, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 411 [2025-03-17 05:23:06,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:06,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:23:06,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:23:06,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:23:06,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,776 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 44, 21, 11, 31]. 38 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 2, 2]. The 15 writes are split as follows [0, 1, 5, 4, 3, 2]. [2025-03-17 05:23:06,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:23:06,811 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:23:06,811 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:23:06,811 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:23:06,812 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (1/1) ... [2025-03-17 05:23:06,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:06,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:06,842 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-17 05:23:06,846 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-17 05:23:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:23:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:23:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:23:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:23:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:23:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:23:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:23:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:23:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:23:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:23:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:23:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:23:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:23:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:23:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:23:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:23:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:23:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:23:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:23:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:23:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:23:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:23:06,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:23:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:23:06,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:23:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:23:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:23:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:23:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:23:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:23:07,049 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:23:07,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:23:12,565 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~ite75#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite94#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short97#1;havoc property_#t~mem98#1;havoc property_#t~ite109#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite108#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short116#1; [2025-03-17 05:23:12,602 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-03-17 05:23:12,603 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:23:12,613 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:23:12,613 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:23:12,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:12 BoogieIcfgContainer [2025-03-17 05:23:12,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:23:12,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:23:12,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:23:12,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:23:12,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:23:06" (1/3) ... [2025-03-17 05:23:12,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4848fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:12, skipping insertion in model container [2025-03-17 05:23:12,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:06" (2/3) ... [2025-03-17 05:23:12,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4848fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:12, skipping insertion in model container [2025-03-17 05:23:12,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:12" (3/3) ... [2025-03-17 05:23:12,623 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-33.i [2025-03-17 05:23:12,634 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:23:12,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-33.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:23:12,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:23:12,685 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;@419cb08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:23:12,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:23:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:23:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:23:12,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:12,697 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:12,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:12,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2095408049, now seen corresponding path program 1 times [2025-03-17 05:23:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:12,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725180649] [2025-03-17 05:23:12,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:12,712 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-17 05:23:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:12,717 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-17 05:23:12,718 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-17 05:23:12,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:13,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:13,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:13,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:13,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:23:13,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-17 05:23:13,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:13,064 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725180649] [2025-03-17 05:23:13,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725180649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:13,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:13,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:23:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065614351] [2025-03-17 05:23:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:13,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:23:13,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:13,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:23:13,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:23:13,088 INFO L87 Difference]: Start difference. First operand has 79 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:13,105 INFO L93 Difference]: Finished difference Result 155 states and 237 transitions. [2025-03-17 05:23:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:23:13,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2025-03-17 05:23:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:13,111 INFO L225 Difference]: With dead ends: 155 [2025-03-17 05:23:13,111 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 05:23:13,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-17 05:23:13,116 INFO L435 NwaCegarLoop]: 111 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, 111 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-17 05:23:13,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 05:23:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 05:23:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:23:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-03-17 05:23:13,145 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 88 [2025-03-17 05:23:13,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:13,146 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-03-17 05:23:13,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-03-17 05:23:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:23:13,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:13,149 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:13,158 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-17 05:23:13,350 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-17 05:23:13,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:13,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:13,351 INFO L85 PathProgramCache]: Analyzing trace with hash 969296754, now seen corresponding path program 1 times [2025-03-17 05:23:13,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:13,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371320192] [2025-03-17 05:23:13,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:13,352 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-17 05:23:13,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:13,356 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-17 05:23:13,360 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-17 05:23:13,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:13,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:13,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:13,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:13,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:23:13,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 05:23:13,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:13,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:13,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371320192] [2025-03-17 05:23:13,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371320192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:13,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:13,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:13,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168971792] [2025-03-17 05:23:13,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:13,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:13,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:13,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:13,703 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 05:23:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:13,757 INFO L93 Difference]: Finished difference Result 155 states and 224 transitions. [2025-03-17 05:23:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-03-17 05:23:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:13,759 INFO L225 Difference]: With dead ends: 155 [2025-03-17 05:23:13,760 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 05:23:13,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 85 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-17 05:23:13,761 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 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-17 05:23:13,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:23:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 05:23:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 05:23:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:23:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-03-17 05:23:13,773 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 88 [2025-03-17 05:23:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:13,774 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-03-17 05:23:13,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 05:23:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-03-17 05:23:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:23:13,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:13,778 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:13,796 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 (3)] Ended with exit code 0 [2025-03-17 05:23:13,978 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-17 05:23:13,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:13,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash 948959379, now seen corresponding path program 1 times [2025-03-17 05:23:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229171569] [2025-03-17 05:23:13,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:13,981 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-17 05:23:13,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:13,987 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-17 05:23:13,988 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-17 05:23:14,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:14,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:14,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:23:14,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:14,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2025-03-17 05:23:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 05:23:14,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:15,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2025-03-17 05:23:15,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:15,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229171569] [2025-03-17 05:23:15,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229171569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:15,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1304388056] [2025-03-17 05:23:15,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:15,210 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:15,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:23:15,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:23:15,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-17 05:23:15,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:15,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:15,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:15,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:15,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:23:15,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:23:15,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1304388056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:23:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-03-17 05:23:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209418172] [2025-03-17 05:23:15,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:15,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:23:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:15,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:23:15,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:23:15,698 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:15,816 INFO L93 Difference]: Finished difference Result 164 states and 235 transitions. [2025-03-17 05:23:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:23:15,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2025-03-17 05:23:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:15,818 INFO L225 Difference]: With dead ends: 164 [2025-03-17 05:23:15,819 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 05:23:15,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:23:15,822 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:15,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 499 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 05:23:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-03-17 05:23:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:23:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 119 transitions. [2025-03-17 05:23:15,832 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 119 transitions. Word has length 88 [2025-03-17 05:23:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:15,832 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 119 transitions. [2025-03-17 05:23:15,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 119 transitions. [2025-03-17 05:23:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:23:15,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:15,835 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:15,847 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:23:16,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-17 05:23:16,235 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:16,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:16,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1836463060, now seen corresponding path program 1 times [2025-03-17 05:23:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:16,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449866453] [2025-03-17 05:23:16,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:16,237 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-17 05:23:16,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:16,240 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-17 05:23:16,243 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-17 05:23:16,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:16,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:16,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:16,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:16,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:23:16,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:16,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2025-03-17 05:23:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 05:23:17,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:17,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2025-03-17 05:23:17,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:17,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449866453] [2025-03-17 05:23:17,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449866453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:17,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [725984725] [2025-03-17 05:23:17,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:17,345 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:17,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:23:17,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:23:17,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-17 05:23:17,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:17,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:17,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:17,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:17,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:23:17,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:23:17,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [725984725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:17,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:23:17,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-03-17 05:23:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664439688] [2025-03-17 05:23:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:17,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:23:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:17,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:23:17,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:23:17,781 INFO L87 Difference]: Start difference. First operand 85 states and 119 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:17,859 INFO L93 Difference]: Finished difference Result 172 states and 241 transitions. [2025-03-17 05:23:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:23:17,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2025-03-17 05:23:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:17,861 INFO L225 Difference]: With dead ends: 172 [2025-03-17 05:23:17,861 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:23:17,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:23:17,862 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:17,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 592 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:23:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-17 05:23:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:23:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2025-03-17 05:23:17,869 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 88 [2025-03-17 05:23:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:17,869 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2025-03-17 05:23:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2025-03-17 05:23:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:23:17,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:17,870 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:17,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-17 05:23:18,077 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-17 05:23:18,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-17 05:23:18,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:18,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1837386581, now seen corresponding path program 1 times [2025-03-17 05:23:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622989822] [2025-03-17 05:23:18,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:18,273 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-17 05:23:18,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:18,277 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-17 05:23:18,282 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-17 05:23:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:18,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:18,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:18,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:18,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:23:18,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:18,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2025-03-17 05:23:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 05:23:21,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:21,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2025-03-17 05:23:21,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:21,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622989822] [2025-03-17 05:23:21,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622989822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:21,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1150834079] [2025-03-17 05:23:21,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:21,865 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:21,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:23:21,867 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:23:21,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-17 05:23:21,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:22,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:22,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:22,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:22,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:23:22,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:22,415 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-17 05:23:22,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 43 treesize of output 25 [2025-03-17 05:23:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:23:22,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:22,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1150834079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:22,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:23:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-17 05:23:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934493027] [2025-03-17 05:23:22,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:22,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:23:22,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:22,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:23:22,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=248, Unknown=1, NotChecked=0, Total=306 [2025-03-17 05:23:22,526 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:22,780 INFO L93 Difference]: Finished difference Result 261 states and 364 transitions. [2025-03-17 05:23:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:23:22,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 88 [2025-03-17 05:23:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:22,783 INFO L225 Difference]: With dead ends: 261 [2025-03-17 05:23:22,784 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 05:23:22,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=65, Invalid=314, Unknown=1, NotChecked=0, Total=380 [2025-03-17 05:23:22,786 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 106 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:22,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 594 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 05:23:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 95. [2025-03-17 05:23:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 05:23:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-03-17 05:23:22,802 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 88 [2025-03-17 05:23:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:22,802 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-03-17 05:23:22,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:23:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-03-17 05:23:22,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:23:22,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:22,803 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:22,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-17 05:23:23,012 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-17 05:23:23,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-17 05:23:23,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash -950028906, now seen corresponding path program 1 times [2025-03-17 05:23:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234760981] [2025-03-17 05:23:23,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:23,205 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-17 05:23:23,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:23,208 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-17 05:23:23,209 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-17 05:23:23,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:23,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:23,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:23,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:23,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:23:23,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:23,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2025-03-17 05:23:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 05:23:23,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:24,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2025-03-17 05:23:24,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:24,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234760981] [2025-03-17 05:23:24,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234760981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:24,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [373910066] [2025-03-17 05:23:24,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:24,176 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:23:24,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:23:24,179 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:23:24,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-17 05:23:24,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:24,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:24,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:24,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:24,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:23:24,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:25,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2025-03-17 05:23:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 05:23:26,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:23:26,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2025-03-17 05:23:26,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [373910066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:26,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:23:26,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-17 05:23:26,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439732711] [2025-03-17 05:23:26,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:23:26,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:23:26,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:26,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:23:26,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:23:26,537 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 05:23:32,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:23:35,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:23:40,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:23:44,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:23:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:44,953 INFO L93 Difference]: Finished difference Result 290 states and 400 transitions. [2025-03-17 05:23:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:23:44,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 88 [2025-03-17 05:23:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:44,955 INFO L225 Difference]: With dead ends: 290 [2025-03-17 05:23:44,955 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 05:23:44,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:23:44,956 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 126 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 36 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:44,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 666 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 214 Invalid, 4 Unknown, 0 Unchecked, 15.4s Time] [2025-03-17 05:23:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 05:23:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2025-03-17 05:23:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 118 states have internal predecessors, (157), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:23:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 193 transitions. [2025-03-17 05:23:44,977 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 193 transitions. Word has length 88 [2025-03-17 05:23:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:44,977 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 193 transitions. [2025-03-17 05:23:44,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 05:23:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 193 transitions. [2025-03-17 05:23:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:23:44,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:44,978 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:44,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-03-17 05:23:45,188 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-17 05:23:45,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-17 05:23:45,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:45,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash 294735575, now seen corresponding path program 1 times [2025-03-17 05:23:45,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:45,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672632379] [2025-03-17 05:23:45,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:45,379 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-17 05:23:45,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:45,382 INFO L229 MonitoredProcess]: Starting monitored process 12 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-17 05:23:45,383 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 (12)] Waiting until timeout for monitored process [2025-03-17 05:23:45,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:23:45,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:23:45,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:45,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:45,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:23:45,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:45,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 77 treesize of output 41 [2025-03-17 05:23:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 05:23:45,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:45,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:45,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672632379] [2025-03-17 05:23:45,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672632379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:45,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:45,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:23:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836342384] [2025-03-17 05:23:45,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:45,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:23:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:45,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:23:45,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:23:45,700 INFO L87 Difference]: Start difference. First operand 140 states and 193 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 05:23:47,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:23:48,781 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-17 05:23:50,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:23:52,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:23:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:52,361 INFO L93 Difference]: Finished difference Result 271 states and 372 transitions. [2025-03-17 05:23:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:23:52,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-03-17 05:23:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:52,365 INFO L225 Difference]: With dead ends: 271 [2025-03-17 05:23:52,365 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 05:23:52,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:23:52,366 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 100 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:52,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 342 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-03-17 05:23:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 05:23:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2025-03-17 05:23:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 118 states have internal predecessors, (155), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:23:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 191 transitions. [2025-03-17 05:23:52,388 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 191 transitions. Word has length 88 [2025-03-17 05:23:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:52,389 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 191 transitions. [2025-03-17 05:23:52,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 05:23:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 191 transitions. [2025-03-17 05:23:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:23:52,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:52,390 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:23:52,403 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 (12)] Ended with exit code 0