./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.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 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:12:02,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:12:02,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:12:02,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:12:02,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:12:02,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:12:02,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:12:02,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:12:02,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:12:02,922 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:12:02,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:12:02,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:12:02,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:12:02,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:12:02,923 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:12:02,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:12:02,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:12:02,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:12:02,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:12:02,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:12:02,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:12:02,925 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 -> 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f [2025-03-04 01:12:03,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:12:03,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:12:03,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:12:03,207 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:12:03,208 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:12:03,209 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-92.i [2025-03-04 01:12:04,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ddfdc349/e950eb50dad749f4a2ff5e865a86624d/FLAGb8b52c4a3 [2025-03-04 01:12:04,698 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:12:04,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2025-03-04 01:12:04,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ddfdc349/e950eb50dad749f4a2ff5e865a86624d/FLAGb8b52c4a3 [2025-03-04 01:12:04,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ddfdc349/e950eb50dad749f4a2ff5e865a86624d [2025-03-04 01:12:04,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:12:04,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:12:04,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:12:04,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:12:04,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:12:04,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:04,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a7746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04, skipping insertion in model container [2025-03-04 01:12:04,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:04,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:12:04,867 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-92.i[916,929] [2025-03-04 01:12:04,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:12:04,941 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:12:04,949 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-92.i[916,929] [2025-03-04 01:12:04,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:12:04,991 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:12:04,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04 WrapperNode [2025-03-04 01:12:04,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:12:04,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:12:04,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:12:04,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:12:04,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,039 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2025-03-04 01:12:05,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:12:05,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:12:05,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:12:05,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:12:05,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,073 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 21, 23, 3, 61, 3, 10]. 50 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 3, 1, 6, 1, 2]. The 18 writes are split as follows [0, 4, 4, 1, 6, 1, 2]. [2025-03-04 01:12:05,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:12:05,112 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:12:05,112 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:12:05,112 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:12:05,113 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (1/1) ... [2025-03-04 01:12:05,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:12:05,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:12:05,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:12:05,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:12:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:12:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:12:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:12:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:12:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:12:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:12:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:12:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:12:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:12:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:12:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:12:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:12:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:12:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:12:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:12:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:12:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:12:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:12:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:12:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:12:05,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:12:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:12:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:12:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:12:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:12:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:12:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:12:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:12:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:12:05,304 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:12:05,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:12:05,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem86#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~bitwise90#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~short97#1;havoc property_#t~mem102#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~short111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite120#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2025-03-04 01:12:05,761 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-04 01:12:05,761 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:12:05,776 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:12:05,777 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:12:05,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:12:05 BoogieIcfgContainer [2025-03-04 01:12:05,777 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:12:05,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:12:05,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:12:05,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:12:05,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:12:04" (1/3) ... [2025-03-04 01:12:05,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417e2fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:12:05, skipping insertion in model container [2025-03-04 01:12:05,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:04" (2/3) ... [2025-03-04 01:12:05,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417e2fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:12:05, skipping insertion in model container [2025-03-04 01:12:05,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:12:05" (3/3) ... [2025-03-04 01:12:05,785 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-92.i [2025-03-04 01:12:05,796 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:12:05,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-92.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:12:05,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:12:05,852 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;@7e762686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:12:05,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:12:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:12:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:12:05,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:05,866 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:05,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:05,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash 442051637, now seen corresponding path program 1 times [2025-03-04 01:12:05,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451860238] [2025-03-04 01:12:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:05,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:12:06,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:12:06,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:06,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:12:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:06,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451860238] [2025-03-04 01:12:06,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451860238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:06,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377499890] [2025-03-04 01:12:06,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:06,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:06,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:12:06,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:12:06,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:12:06,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:12:06,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:12:06,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:06,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:06,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:12:06,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:12:06,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377499890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:06,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:06,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:12:06,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529756287] [2025-03-04 01:12:06,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:06,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:12:06,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:06,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:12:06,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:12:06,482 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:12:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:06,504 INFO L93 Difference]: Finished difference Result 218 states and 336 transitions. [2025-03-04 01:12:06,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:12:06,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-03-04 01:12:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:06,510 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:12:06,510 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:12:06,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:12:06,516 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:06,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:12:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 01:12:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:12:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-04 01:12:06,543 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2025-03-04 01:12:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:06,544 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-04 01:12:06,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:12:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-04 01:12:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:12:06,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:06,546 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:06,553 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-04 01:12:06,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:12:06,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:06,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash -712455196, now seen corresponding path program 1 times [2025-03-04 01:12:06,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:06,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028319644] [2025-03-04 01:12:06,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:06,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:06,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:12:06,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:12:06,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:06,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:12:07,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:07,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028319644] [2025-03-04 01:12:07,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028319644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:07,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:07,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:12:07,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666623704] [2025-03-04 01:12:07,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:07,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:12:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:07,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:12:07,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:12:07,105 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:07,155 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2025-03-04 01:12:07,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:12:07,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:12:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:07,161 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:12:07,161 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:12:07,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:12:07,162 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:07,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:12:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-04 01:12:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:12:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-03-04 01:12:07,172 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 153 [2025-03-04 01:12:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:07,173 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-03-04 01:12:07,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-03-04 01:12:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:12:07,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:07,175 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:07,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:12:07,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:07,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash -711531675, now seen corresponding path program 1 times [2025-03-04 01:12:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:07,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660213533] [2025-03-04 01:12:07,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:07,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:12:07,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:12:07,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:07,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:12:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:08,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660213533] [2025-03-04 01:12:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660213533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314314199] [2025-03-04 01:12:08,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:12:08,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:12:08,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:12:08,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:12:08,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:12:08,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:08,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:08,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:12:08,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:08,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2025-03-04 01:12:08,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 93 [2025-03-04 01:12:09,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-03-04 01:12:09,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:09,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 29 [2025-03-04 01:12:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-04 01:12:09,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:12:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314314199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:12:10,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:12:10,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-03-04 01:12:10,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530405103] [2025-03-04 01:12:10,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:12:10,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:12:10,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:10,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:12:10,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:12:10,121 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 13 states, 10 states have (on average 10.1) internal successors, (101), 13 states have internal predecessors, (101), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2025-03-04 01:12:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:10,689 INFO L93 Difference]: Finished difference Result 231 states and 323 transitions. [2025-03-04 01:12:10,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:12:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 10.1) internal successors, (101), 13 states have internal predecessors, (101), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) Word has length 153 [2025-03-04 01:12:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:10,691 INFO L225 Difference]: With dead ends: 231 [2025-03-04 01:12:10,691 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:12:10,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:12:10,694 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 394 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:10,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 506 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:12:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:12:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-04 01:12:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:12:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2025-03-04 01:12:10,705 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 153 [2025-03-04 01:12:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:10,705 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2025-03-04 01:12:10,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 10.1) internal successors, (101), 13 states have internal predecessors, (101), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2025-03-04 01:12:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2025-03-04 01:12:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:12:10,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:10,707 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:10,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:12:10,907 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,SelfDestructingSolverStorable2 [2025-03-04 01:12:10,908 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:10,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash -500180762, now seen corresponding path program 1 times [2025-03-04 01:12:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:10,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932624798] [2025-03-04 01:12:10,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:10,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:12:11,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:12:11,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:11,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:12:12,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:12,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932624798] [2025-03-04 01:12:12,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932624798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:12,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:12,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:12:12,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666720425] [2025-03-04 01:12:12,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:12,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:12:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:12,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:12:12,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:12:12,646 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:12:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:13,400 INFO L93 Difference]: Finished difference Result 325 states and 450 transitions. [2025-03-04 01:12:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:12:13,401 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-03-04 01:12:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:13,403 INFO L225 Difference]: With dead ends: 325 [2025-03-04 01:12:13,404 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 01:12:13,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:12:13,405 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 113 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:13,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1417 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:12:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 01:12:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2025-03-04 01:12:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 172 states have (on average 1.3313953488372092) internal successors, (229), 173 states have internal predecessors, (229), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:12:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2025-03-04 01:12:13,440 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 153 [2025-03-04 01:12:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:13,441 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2025-03-04 01:12:13,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:12:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2025-03-04 01:12:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:12:13,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:13,444 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:13,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:12:13,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:13,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1007371047, now seen corresponding path program 1 times [2025-03-04 01:12:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:13,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302145845] [2025-03-04 01:12:13,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:13,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:12:13,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:12:13,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:13,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:12:14,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:14,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302145845] [2025-03-04 01:12:14,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302145845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:14,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:14,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:12:14,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743563110] [2025-03-04 01:12:14,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:14,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:12:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:14,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:12:14,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:12:14,293 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:14,513 INFO L93 Difference]: Finished difference Result 413 states and 572 transitions. [2025-03-04 01:12:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:12:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:12:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:14,516 INFO L225 Difference]: With dead ends: 413 [2025-03-04 01:12:14,516 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 01:12:14,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:14,517 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 97 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:14,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 836 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:12:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 01:12:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2025-03-04 01:12:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 173 states have (on average 1.3179190751445087) internal successors, (228), 174 states have internal predecessors, (228), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:12:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 286 transitions. [2025-03-04 01:12:14,541 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 286 transitions. Word has length 153 [2025-03-04 01:12:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:14,542 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 286 transitions. [2025-03-04 01:12:14,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 286 transitions. [2025-03-04 01:12:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:12:14,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:14,544 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:14,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:12:14,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 461433255, now seen corresponding path program 1 times [2025-03-04 01:12:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977597618] [2025-03-04 01:12:14,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:14,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:14,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:12:14,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:12:14,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:14,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:12:15,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:15,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977597618] [2025-03-04 01:12:15,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977597618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:15,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:15,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:12:15,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196529940] [2025-03-04 01:12:15,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:15,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:12:15,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:15,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:12:15,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:12:15,313 INFO L87 Difference]: Start difference. First operand 208 states and 286 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:15,537 INFO L93 Difference]: Finished difference Result 419 states and 573 transitions. [2025-03-04 01:12:15,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:12:15,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:12:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:15,540 INFO L225 Difference]: With dead ends: 419 [2025-03-04 01:12:15,540 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:12:15,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:15,541 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 100 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:15,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 668 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:12:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:12:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2025-03-04 01:12:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 176 states have (on average 1.3068181818181819) internal successors, (230), 177 states have internal predecessors, (230), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:12:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 288 transitions. [2025-03-04 01:12:15,560 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 288 transitions. Word has length 153 [2025-03-04 01:12:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:15,561 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 288 transitions. [2025-03-04 01:12:15,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 288 transitions. [2025-03-04 01:12:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:12:15,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:15,562 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:15,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:12:15,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:15,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1968985064, now seen corresponding path program 1 times [2025-03-04 01:12:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:15,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378182587] [2025-03-04 01:12:15,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:15,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:15,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:12:15,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:12:15,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:15,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:12:17,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:17,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378182587] [2025-03-04 01:12:17,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378182587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:17,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:17,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:12:17,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310747650] [2025-03-04 01:12:17,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:17,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:12:17,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:17,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:12:17,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:12:17,229 INFO L87 Difference]: Start difference. First operand 212 states and 288 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:12:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:18,160 INFO L93 Difference]: Finished difference Result 451 states and 613 transitions. [2025-03-04 01:12:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:12:18,160 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-04 01:12:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:18,162 INFO L225 Difference]: With dead ends: 451 [2025-03-04 01:12:18,162 INFO L226 Difference]: Without dead ends: 242 [2025-03-04 01:12:18,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:12:18,163 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 304 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:18,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1542 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:12:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-04 01:12:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 212. [2025-03-04 01:12:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 176 states have (on average 1.3011363636363635) internal successors, (229), 177 states have internal predecessors, (229), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:12:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 287 transitions. [2025-03-04 01:12:18,181 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 287 transitions. Word has length 153 [2025-03-04 01:12:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:18,182 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 287 transitions. [2025-03-04 01:12:18,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:12:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 287 transitions. [2025-03-04 01:12:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:12:18,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:18,183 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:18,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:12:18,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:18,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash 381238979, now seen corresponding path program 1 times [2025-03-04 01:12:18,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:18,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630156857] [2025-03-04 01:12:18,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:18,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:18,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:12:18,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:12:18,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:18,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:12:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240766616] [2025-03-04 01:12:18,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:18,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:18,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:12:18,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:12:18,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:12:18,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:12:18,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:12:18,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:18,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:18,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 01:12:18,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:18,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 01:12:18,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:18,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-03-04 01:12:18,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:18,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-03-04 01:12:18,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:18,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-03-04 01:12:18,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 88 [2025-03-04 01:12:18,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:18,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 126 [2025-03-04 01:12:18,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:12:18,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 41 [2025-03-04 01:12:19,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:19,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 47 [2025-03-04 01:12:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 374 proven. 63 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-04 01:12:19,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-04 01:12:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630156857] [2025-03-04 01:12:38,520 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:12:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240766616] [2025-03-04 01:12:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240766616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:12:38,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:12:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2025-03-04 01:12:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193436934] [2025-03-04 01:12:38,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:12:38,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 01:12:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:38,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 01:12:38,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=548, Unknown=3, NotChecked=0, Total=702 [2025-03-04 01:12:38,523 INFO L87 Difference]: Start difference. First operand 212 states and 287 transitions. Second operand has 27 states, 23 states have (on average 4.434782608695652) internal successors, (102), 27 states have internal predecessors, (102), 9 states have call successors, (32), 3 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 9 states have call successors, (32) [2025-03-04 01:12:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:39,600 INFO L93 Difference]: Finished difference Result 448 states and 594 transitions. [2025-03-04 01:12:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 01:12:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.434782608695652) internal successors, (102), 27 states have internal predecessors, (102), 9 states have call successors, (32), 3 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 9 states have call successors, (32) Word has length 157 [2025-03-04 01:12:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:39,602 INFO L225 Difference]: With dead ends: 448 [2025-03-04 01:12:39,602 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 01:12:39,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=488, Invalid=1764, Unknown=4, NotChecked=0, Total=2256 [2025-03-04 01:12:39,605 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 892 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:39,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1129 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:12:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 01:12:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2025-03-04 01:12:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.2789473684210526) internal successors, (243), 191 states have internal predecessors, (243), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:12:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 301 transitions. [2025-03-04 01:12:39,623 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 301 transitions. Word has length 157 [2025-03-04 01:12:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:39,624 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 301 transitions. [2025-03-04 01:12:39,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.434782608695652) internal successors, (102), 27 states have internal predecessors, (102), 9 states have call successors, (32), 3 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 9 states have call successors, (32) [2025-03-04 01:12:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 301 transitions. [2025-03-04 01:12:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:12:39,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:39,626 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:39,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:12:39,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:39,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:39,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1342852996, now seen corresponding path program 1 times [2025-03-04 01:12:39,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:39,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274338093] [2025-03-04 01:12:39,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:39,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:12:39,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:12:39,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:39,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:12:39,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425023940] [2025-03-04 01:12:39,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:39,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:39,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:12:39,908 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-04 01:12:39,909 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-04 01:12:40,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:12:40,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:12:40,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:40,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:40,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:12:40,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:40,111 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 19 treesize of output 7 [2025-03-04 01:12:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:12:40,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:40,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:40,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274338093] [2025-03-04 01:12:40,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:12:40,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425023940] [2025-03-04 01:12:40,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425023940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:40,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:40,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:12:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662735814] [2025-03-04 01:12:40,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:40,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:12:40,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:40,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:12:40,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:40,122 INFO L87 Difference]: Start difference. First operand 230 states and 301 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:40,312 INFO L93 Difference]: Finished difference Result 648 states and 850 transitions. [2025-03-04 01:12:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:12:40,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2025-03-04 01:12:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:40,315 INFO L225 Difference]: With dead ends: 648 [2025-03-04 01:12:40,315 INFO L226 Difference]: Without dead ends: 421 [2025-03-04 01:12:40,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:12:40,316 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 100 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:40,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 932 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:12:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-04 01:12:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 261. [2025-03-04 01:12:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 221 states have (on average 1.2850678733031675) internal successors, (284), 222 states have internal predecessors, (284), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:12:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 342 transitions. [2025-03-04 01:12:40,337 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 342 transitions. Word has length 157 [2025-03-04 01:12:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:40,337 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 342 transitions. [2025-03-04 01:12:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 342 transitions. [2025-03-04 01:12:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:12:40,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:40,338 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:40,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:12:40,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:40,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:40,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 837294371, now seen corresponding path program 1 times [2025-03-04 01:12:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:40,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414266120] [2025-03-04 01:12:40,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:40,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:12:40,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:12:40,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:40,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:12:40,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874471582] [2025-03-04 01:12:40,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:40,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:40,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:12:40,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:12:40,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:12:40,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:12:40,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:12:40,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:40,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:40,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:12:40,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:40,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 01:12:40,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 01:12:40,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 01:12:40,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 01:12:40,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2025-03-04 01:12:41,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2025-03-04 01:12:41,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 28 [2025-03-04 01:12:41,351 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 106 treesize of output 76 [2025-03-04 01:12:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 354 proven. 33 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 01:12:41,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:42,288 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 70 treesize of output 46 [2025-03-04 01:12:42,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:42,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414266120] [2025-03-04 01:12:42,386 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:12:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874471582] [2025-03-04 01:12:42,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874471582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:42,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:12:42,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 01:12:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110980052] [2025-03-04 01:12:42,387 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:12:42,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:12:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:42,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:12:42,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:12:42,388 INFO L87 Difference]: Start difference. First operand 261 states and 342 transitions. Second operand has 12 states, 10 states have (on average 7.4) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:12:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:43,075 INFO L93 Difference]: Finished difference Result 525 states and 687 transitions. [2025-03-04 01:12:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:12:43,078 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.4) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 157 [2025-03-04 01:12:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:43,081 INFO L225 Difference]: With dead ends: 525 [2025-03-04 01:12:43,081 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 01:12:43,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:12:43,083 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 103 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:43,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 488 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:12:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 01:12:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2025-03-04 01:12:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 221 states have (on average 1.2669683257918551) internal successors, (280), 222 states have internal predecessors, (280), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:12:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 338 transitions. [2025-03-04 01:12:43,116 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 338 transitions. Word has length 157 [2025-03-04 01:12:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:43,118 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 338 transitions. [2025-03-04 01:12:43,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.4) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:12:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 338 transitions. [2025-03-04 01:12:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:12:43,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:43,119 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:43,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:12:43,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 01:12:43,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:43,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2008204378, now seen corresponding path program 1 times [2025-03-04 01:12:43,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806222396] [2025-03-04 01:12:43,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:43,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:12:43,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:12:43,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:43,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:12:43,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:12:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806222396] [2025-03-04 01:12:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806222396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637721277] [2025-03-04 01:12:43,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:43,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:43,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:12:43,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:12:43,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:12:43,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:12:43,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:12:43,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:43,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:43,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:12:43,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:43,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 01:12:44,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 01:12:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 88 proven. 51 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-03-04 01:12:44,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:12:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637721277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:12:44,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:12:44,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2025-03-04 01:12:44,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43480928] [2025-03-04 01:12:44,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:12:44,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:12:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:12:44,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:12:44,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:12:44,392 INFO L87 Difference]: Start difference. First operand 261 states and 338 transitions. Second operand has 18 states, 15 states have (on average 8.333333333333334) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 4 states have call predecessors, (56), 7 states have call successors, (56) [2025-03-04 01:12:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:45,024 INFO L93 Difference]: Finished difference Result 545 states and 695 transitions. [2025-03-04 01:12:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:12:45,025 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.333333333333334) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 4 states have call predecessors, (56), 7 states have call successors, (56) Word has length 159 [2025-03-04 01:12:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:45,026 INFO L225 Difference]: With dead ends: 545 [2025-03-04 01:12:45,027 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 01:12:45,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 309 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:12:45,027 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 400 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:45,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 845 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:12:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 01:12:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2025-03-04 01:12:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 233 states have (on average 1.2188841201716738) internal successors, (284), 234 states have internal predecessors, (284), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:12:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 342 transitions. [2025-03-04 01:12:45,053 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 342 transitions. Word has length 159 [2025-03-04 01:12:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:45,054 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 342 transitions. [2025-03-04 01:12:45,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.333333333333334) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (56), 4 states have call predecessors, (56), 7 states have call successors, (56) [2025-03-04 01:12:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 342 transitions. [2025-03-04 01:12:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:12:45,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:45,056 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:45,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 01:12:45,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:45,256 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:45,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1640371811, now seen corresponding path program 1 times [2025-03-04 01:12:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:12:45,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302012492] [2025-03-04 01:12:45,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:12:45,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:12:45,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:12:45,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:45,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:12:45,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589730370] [2025-03-04 01:12:45,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:45,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:45,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:12:45,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:12:45,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:12:45,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:12:45,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:12:45,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:45,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:12:45,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:12:45,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:12:45,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:12:45,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:45,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:12:46,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:12:46,076 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:12:46,078 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:12:46,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 01:12:46,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:12:46,288 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:46,373 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:12:46,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:12:46 BoogieIcfgContainer [2025-03-04 01:12:46,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:12:46,376 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:12:46,376 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:12:46,376 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:12:46,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:12:05" (3/4) ... [2025-03-04 01:12:46,378 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:12:46,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:12:46,379 INFO L158 Benchmark]: Toolchain (without parser) took 41639.94ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 105.5MB in the beginning and 457.4MB in the end (delta: -351.9MB). Peak memory consumption was 143.4MB. Max. memory is 16.1GB. [2025-03-04 01:12:46,379 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:12:46,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.59ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:12:46,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.64ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 86.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:12:46,380 INFO L158 Benchmark]: Boogie Preprocessor took 71.16ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 82.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:12:46,380 INFO L158 Benchmark]: IcfgBuilder took 665.30ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 48.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:12:46,380 INFO L158 Benchmark]: TraceAbstraction took 40596.11ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 47.9MB in the beginning and 457.6MB in the end (delta: -409.6MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2025-03-04 01:12:46,380 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 637.5MB. Free memory was 457.6MB in the beginning and 457.4MB in the end (delta: 203.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:12:46,381 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.83ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.59ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.64ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 86.4MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.16ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 82.4MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 665.30ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 48.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40596.11ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 47.9MB in the beginning and 457.6MB in the end (delta: -409.6MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 637.5MB. Free memory was 457.6MB in the beginning and 457.4MB in the end (delta: 203.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L28-L30] float float_Array_0[1] = { 2.4 }; [L28-L30] float float_Array_0[1] = { 2.4 }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 500 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 500 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L63] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L64] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L67] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] double_Array_0[0] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] double_Array_0[1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] signed_char_Array_0[0][2] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L89] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] RET updateVariables() [L105] CALL step() [L43] EXPR signed_char_Array_0[0][2] [L43] EXPR signed_char_Array_0[1][1] [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR signed_char_Array_0[1][0] [L43] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] signed_char_Array_0[1][2] = ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))) [L44] EXPR signed_char_Array_0[1][0] [L44] EXPR signed_char_Array_0[0][0] [L44] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR signed_char_Array_0[0][0] & signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] signed long int stepLocal_0 = (~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1]); [L45] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(stepLocal_0 >= signed_char_Array_0[0][1]) [L48] EXPR double_Array_0[0] [L48] double_Array_0[2] = double_Array_0[0] [L50] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) [L50] EXPR signed_char_Array_0[0][2] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] signed_short_int_Array_0[0] = ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))) [L51] EXPR signed_char_Array_0[0][0] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed long int stepLocal_1 = signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]; [L52] COND FALSE !(stepLocal_1 < -100) [L55] EXPR BOOL_unsigned_char_Array_0[2] [L55] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] BOOL_unsigned_char_Array_0[0] = (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]) [L57] EXPR double_Array_0[1] [L57] float_Array_0[0] = double_Array_0[1] [L58] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L59] EXPR signed_char_Array_0[1][0] [L59] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) [L59] EXPR signed_char_Array_0[0][0] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] unsigned_short_int_Array_0[0] = (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR signed_char_Array_0[1][2] [L96] EXPR signed_char_Array_0[0][2] [L96] EXPR signed_char_Array_0[1][1] [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] [L96] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR signed_char_Array_0[0][0] & signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) [L96] EXPR double_Array_0[2] [L96] EXPR double_Array_0[0] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96-L97] return (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.5s, OverallIterations: 12, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2528 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2504 mSDsluCounter, 8961 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7288 mSDsCounter, 374 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4428 IncrementalHoareTripleChecker+Invalid, 4802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 374 mSolverCounterUnsat, 1673 mSDtfsCounter, 4428 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1605 GetRequests, 1425 SyntacticMatches, 5 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=11, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 227 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 30.3s InterpolantComputationTime, 2959 NumberOfCodeBlocks, 2959 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2618 ConstructedInterpolants, 2 QuantifiedInterpolants, 13817 SizeOfPredicates, 30 NumberOfNonLiveVariables, 3321 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 11247/11628 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:12:46,424 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-92.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 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:12:48,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:12:48,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:12:48,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:12:48,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:12:48,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:12:48,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:12:48,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:12:48,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:12:48,413 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:12:48,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:12:48,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:12:48,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:12:48,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:12:48,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:12:48,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:12:48,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:12:48,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:12:48,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:12:48,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:12:48,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:12:48,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:12:48,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:12:48,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:12:48,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:12:48,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:12:48,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:12:48,415 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:12:48,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:12:48,416 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:12:48,416 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:12:48,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:12:48,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:12:48,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:12:48,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:12:48,416 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 -> 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f [2025-03-04 01:12:48,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:12:48,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:12:48,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:12:48,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:12:48,684 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:12:48,685 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-92.i [2025-03-04 01:12:49,978 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38818b72/3776a3ab406e4c25b0fc44cef47d5f95/FLAGfb8f1fa26 [2025-03-04 01:12:50,195 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:12:50,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2025-03-04 01:12:50,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38818b72/3776a3ab406e4c25b0fc44cef47d5f95/FLAGfb8f1fa26 [2025-03-04 01:12:50,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a38818b72/3776a3ab406e4c25b0fc44cef47d5f95 [2025-03-04 01:12:50,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:12:50,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:12:50,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:12:50,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:12:50,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:12:50,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a21801a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50, skipping insertion in model container [2025-03-04 01:12:50,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:12:50,678 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-92.i[916,929] [2025-03-04 01:12:50,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:12:50,741 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:12:50,748 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-92.i[916,929] [2025-03-04 01:12:50,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:12:50,809 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:12:50,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50 WrapperNode [2025-03-04 01:12:50,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:12:50,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:12:50,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:12:50,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:12:50,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,857 INFO L138 Inliner]: procedures = 36, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2025-03-04 01:12:50,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:12:50,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:12:50,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:12:50,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:12:50,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,887 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 21, 23, 3, 61, 3, 10]. 50 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 3, 1, 6, 1, 2]. The 18 writes are split as follows [0, 4, 4, 1, 6, 1, 2]. [2025-03-04 01:12:50,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:12:50,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:12:50,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:12:50,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:12:50,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (1/1) ... [2025-03-04 01:12:50,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:12:50,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:12:50,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:12:50,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:12:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:12:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:12:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:12:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:12:50,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:12:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:12:50,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:12:50,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:12:50,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-04 01:12:51,129 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:12:51,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:12:51,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem85#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite84#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1;havoc property_#t~mem100#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem117#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~short116#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1; [2025-03-04 01:12:51,859 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-03-04 01:12:51,860 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:12:51,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:12:51,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:12:51,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:12:51 BoogieIcfgContainer [2025-03-04 01:12:51,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:12:51,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:12:51,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:12:51,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:12:51,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:12:50" (1/3) ... [2025-03-04 01:12:51,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4789c3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:12:51, skipping insertion in model container [2025-03-04 01:12:51,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:12:50" (2/3) ... [2025-03-04 01:12:51,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4789c3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:12:51, skipping insertion in model container [2025-03-04 01:12:51,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:12:51" (3/3) ... [2025-03-04 01:12:51,878 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-92.i [2025-03-04 01:12:51,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:12:51,890 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-92.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:12:51,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:12:51,943 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;@2a265188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:12:51,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:12:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.353658536585366) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:12:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:12:51,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:51,957 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:51,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:51,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash 254776027, now seen corresponding path program 1 times [2025-03-04 01:12:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:51,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414054434] [2025-03-04 01:12:51,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:51,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:51,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:51,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:12:51,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:12:52,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:12:52,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:12:52,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:52,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:52,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:12:52,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-04 01:12:52,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:52,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:52,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414054434] [2025-03-04 01:12:52,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414054434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:52,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:12:52,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883493307] [2025-03-04 01:12:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:52,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:12:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:52,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:12:52,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:12:52,433 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.353658536585366) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:12:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:52,459 INFO L93 Difference]: Finished difference Result 202 states and 312 transitions. [2025-03-04 01:12:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:12:52,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-03-04 01:12:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:52,467 INFO L225 Difference]: With dead ends: 202 [2025-03-04 01:12:52,467 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:12:52,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:12:52,472 INFO L435 NwaCegarLoop]: 144 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, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:52,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:12:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:12:52,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:12:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:12:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-03-04 01:12:52,514 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 151 [2025-03-04 01:12:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:52,514 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-03-04 01:12:52,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:12:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-03-04 01:12:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:12:52,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:52,517 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:52,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:12:52,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:52,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:52,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1808880202, now seen corresponding path program 1 times [2025-03-04 01:12:52,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:52,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866206637] [2025-03-04 01:12:52,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:52,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:52,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:52,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:12:52,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:12:52,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:12:53,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:12:53,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:53,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:53,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:12:53,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:12:53,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:12:53,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866206637] [2025-03-04 01:12:53,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866206637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:12:53,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:12:53,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:12:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827491781] [2025-03-04 01:12:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:12:53,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:12:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:53,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:12:53,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:53,161 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:53,332 INFO L93 Difference]: Finished difference Result 208 states and 298 transitions. [2025-03-04 01:12:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:12:53,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-04 01:12:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:53,334 INFO L225 Difference]: With dead ends: 208 [2025-03-04 01:12:53,334 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:12:53,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:12:53,335 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:53,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 789 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:12:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:12:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-04 01:12:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:12:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 152 transitions. [2025-03-04 01:12:53,344 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 152 transitions. Word has length 151 [2025-03-04 01:12:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:53,345 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 152 transitions. [2025-03-04 01:12:53,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:12:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 152 transitions. [2025-03-04 01:12:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:12:53,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:53,348 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:53,359 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-04 01:12:53,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:53,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1809803723, now seen corresponding path program 1 times [2025-03-04 01:12:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158457180] [2025-03-04 01:12:53,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:53,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:53,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:53,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:12:53,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:12:53,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:12:54,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:12:54,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:54,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:54,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:12:54,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:54,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:12:54,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-04 01:12:54,265 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 22 treesize of output 10 [2025-03-04 01:12:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-04 01:12:54,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:12:54,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158457180] [2025-03-04 01:12:54,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158457180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:12:54,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:12:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-04 01:12:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058221910] [2025-03-04 01:12:54,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:12:54,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:12:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:12:54,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:12:54,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:12:54,575 INFO L87 Difference]: Start difference. First operand 109 states and 152 transitions. Second operand has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:12:55,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:12:55,342 INFO L93 Difference]: Finished difference Result 221 states and 306 transitions. [2025-03-04 01:12:55,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:12:55,342 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 151 [2025-03-04 01:12:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:12:55,344 INFO L225 Difference]: With dead ends: 221 [2025-03-04 01:12:55,344 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:12:55,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:12:55,345 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 189 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:12:55,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:12:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:12:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-03-04 01:12:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:12:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2025-03-04 01:12:55,354 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 151 [2025-03-04 01:12:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:12:55,354 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2025-03-04 01:12:55,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 01:12:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2025-03-04 01:12:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:12:55,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:12:55,356 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:12:55,368 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-04 01:12:55,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:55,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:12:55,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:12:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2021154636, now seen corresponding path program 1 times [2025-03-04 01:12:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:12:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759185959] [2025-03-04 01:12:55,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:55,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:12:55,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:12:55,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:12:55,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:12:55,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:12:56,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:12:56,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:56,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:12:56,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:12:56,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:12:56,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:12:56,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2025-03-04 01:12:56,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:56,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-03-04 01:12:56,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:56,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-03-04 01:12:56,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:56,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2025-03-04 01:12:56,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:56,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2025-03-04 01:12:57,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:57,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 29 [2025-03-04 01:12:57,060 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 28 treesize of output 16 [2025-03-04 01:12:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 497 proven. 33 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 01:12:57,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:12:58,755 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 32 treesize of output 20 [2025-03-04 01:12:59,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:12:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759185959] [2025-03-04 01:12:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759185959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:12:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1979848729] [2025-03-04 01:12:59,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:12:59,021 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:12:59,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:12:59,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:12:59,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-04 01:12:59,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:12:59,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:12:59,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:12:59,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:00,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:13:00,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:00,204 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 12 treesize of output 8 [2025-03-04 01:13:00,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2025-03-04 01:13:01,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:01,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2025-03-04 01:13:01,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2025-03-04 01:13:01,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:01,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2025-03-04 01:13:02,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:02,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2025-03-04 01:13:02,841 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 32 treesize of output 20 [2025-03-04 01:13:02,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:02,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 30 [2025-03-04 01:13:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 551 proven. 33 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 01:13:03,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:03,714 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 32 treesize of output 20 [2025-03-04 01:13:03,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1979848729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:03,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:13:03,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2025-03-04 01:13:03,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97456750] [2025-03-04 01:13:03,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:13:03,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 01:13:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:13:03,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 01:13:03,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:13:03,977 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 27 states, 23 states have (on average 5.869565217391305) internal successors, (135), 26 states have internal predecessors, (135), 14 states have call successors, (38), 11 states have call predecessors, (38), 14 states have return successors, (38), 12 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-04 01:13:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:07,778 INFO L93 Difference]: Finished difference Result 251 states and 327 transitions. [2025-03-04 01:13:07,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 01:13:07,779 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 5.869565217391305) internal successors, (135), 26 states have internal predecessors, (135), 14 states have call successors, (38), 11 states have call predecessors, (38), 14 states have return successors, (38), 12 states have call predecessors, (38), 14 states have call successors, (38) Word has length 151 [2025-03-04 01:13:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:07,780 INFO L225 Difference]: With dead ends: 251 [2025-03-04 01:13:07,780 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 01:13:07,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=585, Invalid=1671, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 01:13:07,783 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 96 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:07,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 702 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 01:13:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 01:13:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-04 01:13:07,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:13:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2025-03-04 01:13:07,797 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 151 [2025-03-04 01:13:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:07,798 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2025-03-04 01:13:07,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 5.869565217391305) internal successors, (135), 26 states have internal predecessors, (135), 14 states have call successors, (38), 11 states have call predecessors, (38), 14 states have return successors, (38), 12 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-04 01:13:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2025-03-04 01:13:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:13:07,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:07,799 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:07,810 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 (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:13:08,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-04 01:13:08,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:13:08,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:08,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1714105041, now seen corresponding path program 1 times [2025-03-04 01:13:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:13:08,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299491979] [2025-03-04 01:13:08,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:08,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:13:08,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:13:08,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:13:08,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:13:08,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:13:08,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:13:08,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:08,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:08,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:13:08,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:08,683 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 39 treesize of output 21 [2025-03-04 01:13:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 204 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:13:08,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:13:08,927 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:13:08,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299491979] [2025-03-04 01:13:08,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299491979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:13:08,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:13:08,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-04 01:13:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122625583] [2025-03-04 01:13:08,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:13:08,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:13:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:13:08,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:13:08,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:13:08,928 INFO L87 Difference]: Start difference. First operand 137 states and 171 transitions. Second operand has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-04 01:13:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:09,301 INFO L93 Difference]: Finished difference Result 281 states and 348 transitions. [2025-03-04 01:13:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:13:09,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 153 [2025-03-04 01:13:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:09,303 INFO L225 Difference]: With dead ends: 281 [2025-03-04 01:13:09,303 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 01:13:09,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:13:09,304 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 71 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:09,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 486 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:13:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 01:13:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2025-03-04 01:13:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 112 states have (on average 1.2053571428571428) internal successors, (135), 112 states have internal predecessors, (135), 19 states have call successors, (19), 9 states have call predecessors, (19), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:13:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 173 transitions. [2025-03-04 01:13:09,316 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 173 transitions. Word has length 153 [2025-03-04 01:13:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:09,316 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 173 transitions. [2025-03-04 01:13:09,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-04 01:13:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions. [2025-03-04 01:13:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:13:09,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:09,317 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:09,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:13:09,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:13:09,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:09,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2122929266, now seen corresponding path program 1 times [2025-03-04 01:13:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:13:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657920166] [2025-03-04 01:13:09,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:09,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:13:09,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:13:09,522 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:13:09,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:13:09,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:13:09,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:13:09,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:09,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:09,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:13:09,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:09,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2025-03-04 01:13:09,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:09,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2025-03-04 01:13:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 204 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:13:10,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:13:10,288 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:13:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657920166] [2025-03-04 01:13:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657920166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:13:10,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:13:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2025-03-04 01:13:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031756721] [2025-03-04 01:13:10,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:13:10,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:13:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:13:10,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:13:10,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:13:10,290 INFO L87 Difference]: Start difference. First operand 141 states and 173 transitions. Second operand has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-04 01:13:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:13:10,908 INFO L93 Difference]: Finished difference Result 289 states and 352 transitions. [2025-03-04 01:13:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:13:10,909 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) Word has length 153 [2025-03-04 01:13:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:13:10,910 INFO L225 Difference]: With dead ends: 289 [2025-03-04 01:13:10,910 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 01:13:10,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:13:10,911 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 146 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:13:10,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 700 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:13:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 01:13:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2025-03-04 01:13:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 115 states have (on average 1.191304347826087) internal successors, (137), 115 states have internal predecessors, (137), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:13:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 175 transitions. [2025-03-04 01:13:10,929 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 175 transitions. Word has length 153 [2025-03-04 01:13:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:13:10,929 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 175 transitions. [2025-03-04 01:13:10,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.25) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 4 states have call successors, (35) [2025-03-04 01:13:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 175 transitions. [2025-03-04 01:13:10,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:13:10,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:13:10,931 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:13:10,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:13:11,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:13:11,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:13:11,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:13:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -410044340, now seen corresponding path program 1 times [2025-03-04 01:13:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:13:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542144439] [2025-03-04 01:13:11,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:11,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:13:11,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:13:11,134 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:13:11,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:13:11,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:13:11,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:13:11,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:11,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:11,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 01:13:11,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:11,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:13:11,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-03-04 01:13:12,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 41 [2025-03-04 01:13:12,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:12,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 65 [2025-03-04 01:13:12,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:12,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 58 [2025-03-04 01:13:13,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 64 [2025-03-04 01:13:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 414 proven. 120 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-04 01:13:14,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:13:15,966 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:13:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542144439] [2025-03-04 01:13:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542144439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:13:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [211784338] [2025-03-04 01:13:15,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:13:15,966 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:13:15,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:13:15,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:13:15,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:13:16,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:13:16,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:13:16,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:13:16,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:13:16,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 01:13:16,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:13:17,049 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 12 treesize of output 8 [2025-03-04 01:13:17,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-03-04 01:13:18,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:18,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 51 [2025-03-04 01:13:19,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:19,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 52 [2025-03-04 01:13:19,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:19,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2025-03-04 01:13:20,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2025-03-04 01:13:23,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:13:23,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 54 [2025-03-04 01:13:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 468 proven. 108 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-04 01:13:24,522 INFO L312 TraceCheckSpWp]: Computing backward predicates...